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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:06 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.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 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-S04J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716851771101

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-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:16:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 23:16:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:16:12] [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-27 23:16:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:16:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 608 ms
[2024-05-27 23:16:13] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-05-27 23:16:13] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-27 23:16:13] [INFO ] Skeletonized 16 HLPN properties in 3 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 40000 steps (16 resets) in 2145 ms. (18 steps per ms) remains 52/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 94 ms. (42 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (9 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
[2024-05-27 23:16:14] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:16:14] [INFO ] Computed 26 invariants in 6 ms
[2024-05-27 23:16:14] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 2 (OVERLAPS) 21/73 variables, 11/14 constraints. Problems are: Problem set: 32 solved, 20 unsolved
[2024-05-27 23:16:15] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 10 ms to minimize.
Problem AtomicPropp36 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/15 constraints. Problems are: Problem set: 33 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/15 constraints. Problems are: Problem set: 33 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 5 (OVERLAPS) 8/81 variables, 12/27 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/108 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/116 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 51 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 116 constraints, problems are : Problem set: 51 solved, 1 unsolved in 617 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: 52/52 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 51 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 2/2 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/51 variables, 6/8 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/9 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 51 solved, 1 unsolved
Problem AtomicPropp62 is UNSAT
After SMT solving in domain Int declared 75/145 variables, and 22 constraints, problems are : Problem set: 52 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/52 constraints, Known Traps: 0/1 constraints]
After SMT, in 714ms problems are : Problem set: 52 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:16:15] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-27 23:16:15] [INFO ] Flatten gal took : 26 ms
[2024-05-27 23:16:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:16:15] [INFO ] Flatten gal took : 7 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 23:16:15] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 70 ms.
[2024-05-27 23:16:15] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 400 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 91 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:16:15] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:16:15] [INFO ] Computed 50 invariants in 76 ms
[2024-05-27 23:16:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:16:35] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-27 23:16:35] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-27 23:16:35] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 2 ms to minimize.
[2024-05-27 23:16:35] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 2 ms to minimize.
[2024-05-27 23:16:35] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:16:36] [INFO ] Deduced a trap composed of 340 places in 266 ms of which 4 ms to minimize.
[2024-05-27 23:16:36] [INFO ] Deduced a trap composed of 139 places in 261 ms of which 4 ms to minimize.
[2024-05-27 23:16:37] [INFO ] Deduced a trap composed of 336 places in 330 ms of which 5 ms to minimize.
[2024-05-27 23:16:38] [INFO ] Deduced a trap composed of 377 places in 363 ms of which 4 ms to minimize.
[2024-05-27 23:16:38] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 4 ms to minimize.
[2024-05-27 23:16:39] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:16:52] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-27 23:16:52] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 59 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 13/13 constraints]
After SMT, in 45151ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45174ms
[2024-05-27 23:17:00] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:17:00] [INFO ] Invariant cache hit.
[2024-05-27 23:17:01] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-27 23:17:01] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:17:01] [INFO ] Invariant cache hit.
[2024-05-27 23:17:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:17:08] [INFO ] Implicit Places using invariants and state equation in 7206 ms returned []
Implicit Place search using SMT with State Equation took 7465 ms to find 0 implicit places.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:17:08] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:17:08] [INFO ] Invariant cache hit.
[2024-05-27 23:17:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:17:26] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-27 23:17:26] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:17:26] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:17:26] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:17:26] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:17:27] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 4 ms to minimize.
[2024-05-27 23:17:27] [INFO ] Deduced a trap composed of 142 places in 290 ms of which 4 ms to minimize.
[2024-05-27 23:17:29] [INFO ] Deduced a trap composed of 82 places in 301 ms of which 4 ms to minimize.
[2024-05-27 23:17:29] [INFO ] Deduced a trap composed of 341 places in 291 ms of which 4 ms to minimize.
[2024-05-27 23:17:30] [INFO ] Deduced a trap composed of 358 places in 388 ms of which 3 ms to minimize.
[2024-05-27 23:17:30] [INFO ] Deduced a trap composed of 340 places in 319 ms of which 3 ms to minimize.
[2024-05-27 23:17:31] [INFO ] Deduced a trap composed of 412 places in 415 ms of which 4 ms to minimize.
[2024-05-27 23:17:31] [INFO ] Deduced a trap composed of 332 places in 422 ms of which 4 ms to minimize.
[2024-05-27 23:17:31] [INFO ] Deduced a trap composed of 340 places in 386 ms of which 3 ms to minimize.
[2024-05-27 23:17:32] [INFO ] Deduced a trap composed of 349 places in 385 ms of which 4 ms to minimize.
[2024-05-27 23:17:32] [INFO ] Deduced a trap composed of 331 places in 397 ms of which 4 ms to minimize.
[2024-05-27 23:17:41] [INFO ] Deduced a trap composed of 359 places in 417 ms of which 5 ms to minimize.
[2024-05-27 23:17:41] [INFO ] Deduced a trap composed of 361 places in 375 ms of which 4 ms to minimize.
[2024-05-27 23:17:42] [INFO ] Deduced a trap composed of 332 places in 326 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 65 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:17:45] [INFO ] Deduced a trap composed of 304 places in 362 ms of which 4 ms to minimize.
[2024-05-27 23:17:46] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 3 ms to minimize.
[2024-05-27 23:18:03] [INFO ] Deduced a trap composed of 331 places in 367 ms of which 3 ms to minimize.
[2024-05-27 23:18:04] [INFO ] Deduced a trap composed of 334 places in 254 ms of which 3 ms to minimize.
[2024-05-27 23:18:04] [INFO ] Deduced a trap composed of 282 places in 386 ms of which 5 ms to minimize.
[2024-05-27 23:18:05] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 4 ms to minimize.
[2024-05-27 23:18:06] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 6 ms to minimize.
[2024-05-27 23:18:10] [INFO ] Deduced a trap composed of 107 places in 264 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 73 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 27/27 constraints]
After SMT, in 64726ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 64742ms
Starting structural reductions in LTL mode, iteration 1 : 602/618 places, 1552/1564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117504 ms. Remains : 602/618 places, 1552/1564 transitions.
Support contains 400 out of 602 places after structural reductions.
[2024-05-27 23:18:13] [INFO ] Flatten gal took : 130 ms
[2024-05-27 23:18:13] [INFO ] Flatten gal took : 107 ms
[2024-05-27 23:18:13] [INFO ] Input system was already deterministic with 1552 transitions.
RANDOM walk for 40000 steps (9 resets) in 1155 ms. (34 steps per ms) remains 22/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
[2024-05-27 23:18:14] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:18:14] [INFO ] Invariant cache hit.
[2024-05-27 23:18:14] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 186/417 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 15/432 variables, 6/17 constraints. Problems are: Problem set: 8 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 14 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 599/2130 variables, and 47 constraints, problems are : Problem set: 22 solved, 0 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 30/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 22 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 22 atomic propositions for a total of 8 simplifications.
[2024-05-27 23:18:14] [INFO ] Flatten gal took : 74 ms
[2024-05-27 23:18:15] [INFO ] Flatten gal took : 74 ms
[2024-05-27 23:18:15] [INFO ] Input system was already deterministic with 1552 transitions.
Support contains 133 out of 602 places (down from 156) after GAL structural reductions.
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 602/602 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 602 transition count 1522
Reduce places removed 30 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 42 rules applied. Total rules applied 72 place count 572 transition count 1510
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 560 transition count 1510
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 84 place count 560 transition count 1444
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 216 place count 494 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 3 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 324 place count 440 transition count 1390
Applied a total of 324 rules in 139 ms. Remains 440 /602 variables (removed 162) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-27 23:18:15] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 440 cols
[2024-05-27 23:18:15] [INFO ] Computed 50 invariants in 45 ms
[2024-05-27 23:18:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-27 23:18:28] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 188 places in 372 ms of which 4 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 188 places in 340 ms of which 3 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 242 places in 216 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/1806 variables, and 55 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/440 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-27 23:18:41] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-27 23:18:41] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-27 23:18:42] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-27 23:18:56] [INFO ] Deduced a trap composed of 170 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/1806 variables, and 59 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/440 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 13/13 constraints]
After SMT, in 44408ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 44422ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44565 ms. Remains : 440/602 places, 1390/1552 transitions.
[2024-05-27 23:18:59] [INFO ] Flatten gal took : 56 ms
[2024-05-27 23:18:59] [INFO ] Flatten gal took : 57 ms
[2024-05-27 23:19:00] [INFO ] Input system was already deterministic with 1390 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 602/602 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 602 transition count 1522
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 572 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 566 transition count 1516
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 72 place count 566 transition count 1444
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 216 place count 494 transition count 1444
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 252 place count 476 transition count 1426
Applied a total of 252 rules in 82 ms. Remains 476 /602 variables (removed 126) and now considering 1426/1552 (removed 126) transitions.
Running 1422 sub problems to find dead transitions.
[2024-05-27 23:19:00] [INFO ] Flow matrix only has 1402 transitions (discarded 24 similar events)
// Phase 1: matrix 1402 rows 476 cols
[2024-05-27 23:19:00] [INFO ] Computed 50 invariants in 26 ms
[2024-05-27 23:19:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
[2024-05-27 23:19:14] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:19:14] [INFO ] Deduced a trap composed of 60 places in 37 ms of which 1 ms to minimize.
[2024-05-27 23:19:14] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 0 ms to minimize.
[2024-05-27 23:19:14] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 0 ms to minimize.
[2024-05-27 23:19:14] [INFO ] Deduced a trap composed of 60 places in 35 ms of which 0 ms to minimize.
[2024-05-27 23:19:14] [INFO ] Deduced a trap composed of 215 places in 258 ms of which 3 ms to minimize.
[2024-05-27 23:19:15] [INFO ] Deduced a trap composed of 231 places in 340 ms of which 4 ms to minimize.
[2024-05-27 23:19:16] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/1878 variables, and 54 constraints, problems are : Problem set: 0 solved, 1422 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/476 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1422/1422 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/472 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 1422 unsolved
[2024-05-27 23:19:26] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 2 ms to minimize.
[2024-05-27 23:19:26] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 2 ms to minimize.
[2024-05-27 23:19:26] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2024-05-27 23:19:31] [INFO ] Deduced a trap composed of 284 places in 266 ms of which 3 ms to minimize.
[2024-05-27 23:19:40] [INFO ] Deduced a trap composed of 213 places in 243 ms of which 2 ms to minimize.
[2024-05-27 23:19:41] [INFO ] Deduced a trap composed of 83 places in 267 ms of which 2 ms to minimize.
[2024-05-27 23:19:41] [INFO ] Deduced a trap composed of 101 places in 225 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/1878 variables, and 61 constraints, problems are : Problem set: 0 solved, 1422 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 33/36 constraints, State Equation: 0/476 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1422 constraints, Known Traps: 15/15 constraints]
After SMT, in 44516ms problems are : Problem set: 0 solved, 1422 unsolved
Search for dead transitions found 0 dead transitions in 44530ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44616 ms. Remains : 476/602 places, 1426/1552 transitions.
[2024-05-27 23:19:44] [INFO ] Flatten gal took : 68 ms
[2024-05-27 23:19:44] [INFO ] Flatten gal took : 66 ms
[2024-05-27 23:19:44] [INFO ] Input system was already deterministic with 1426 transitions.
RANDOM walk for 146 steps (0 resets) in 8 ms. (16 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 1552/1552 transitions.
Applied a total of 0 rules in 17 ms. Remains 602 /602 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:19:44] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:19:45] [INFO ] Computed 50 invariants in 54 ms
[2024-05-27 23:19:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:20:02] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:20:02] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 0 ms to minimize.
[2024-05-27 23:20:02] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-05-27 23:20:02] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 0 ms to minimize.
[2024-05-27 23:20:02] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
[2024-05-27 23:20:03] [INFO ] Deduced a trap composed of 340 places in 313 ms of which 4 ms to minimize.
[2024-05-27 23:20:03] [INFO ] Deduced a trap composed of 139 places in 291 ms of which 3 ms to minimize.
[2024-05-27 23:20:04] [INFO ] Deduced a trap composed of 336 places in 374 ms of which 4 ms to minimize.
[2024-05-27 23:20:05] [INFO ] Deduced a trap composed of 377 places in 410 ms of which 4 ms to minimize.
[2024-05-27 23:20:06] [INFO ] Deduced a trap composed of 326 places in 357 ms of which 4 ms to minimize.
[2024-05-27 23:20:06] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:20:20] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 1 ms to minimize.
[2024-05-27 23:20:21] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 59 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 13/13 constraints]
After SMT, in 44650ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 44666ms
Finished structural reductions in LTL mode , in 1 iterations and 44686 ms. Remains : 602/602 places, 1552/1552 transitions.
[2024-05-27 23:20:29] [INFO ] Flatten gal took : 78 ms
[2024-05-27 23:20:29] [INFO ] Flatten gal took : 85 ms
[2024-05-27 23:20:29] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 602/602 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 602 transition count 1510
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 560 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 84 place count 560 transition count 1438
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 488 transition count 1438
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 348 place count 428 transition count 1378
Applied a total of 348 rules in 76 ms. Remains 428 /602 variables (removed 174) and now considering 1378/1552 (removed 174) transitions.
Running 1374 sub problems to find dead transitions.
[2024-05-27 23:20:30] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 428 cols
[2024-05-27 23:20:30] [INFO ] Computed 50 invariants in 33 ms
[2024-05-27 23:20:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-27 23:20:43] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:20:43] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:20:43] [INFO ] Deduced a trap composed of 52 places in 37 ms of which 0 ms to minimize.
[2024-05-27 23:20:43] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 1 ms to minimize.
[2024-05-27 23:20:43] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
[2024-05-27 23:20:44] [INFO ] Deduced a trap composed of 173 places in 357 ms of which 4 ms to minimize.
[2024-05-27 23:20:44] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 1 ms to minimize.
[2024-05-27 23:20:47] [INFO ] Deduced a trap composed of 216 places in 267 ms of which 3 ms to minimize.
[2024-05-27 23:20:47] [INFO ] Deduced a trap composed of 169 places in 339 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/1782 variables, and 55 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/428 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-05-27 23:20:57] [INFO ] Deduced a trap composed of 167 places in 298 ms of which 3 ms to minimize.
[2024-05-27 23:20:58] [INFO ] Deduced a trap composed of 70 places in 291 ms of which 3 ms to minimize.
[2024-05-27 23:20:58] [INFO ] Deduced a trap composed of 49 places in 299 ms of which 2 ms to minimize.
[2024-05-27 23:21:00] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-27 23:21:11] [INFO ] Deduced a trap composed of 132 places in 215 ms of which 3 ms to minimize.
[2024-05-27 23:21:11] [INFO ] Deduced a trap composed of 146 places in 307 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/1782 variables, and 61 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 30/33 constraints, State Equation: 0/428 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 15/15 constraints]
After SMT, in 45065ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 45081ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45160 ms. Remains : 428/602 places, 1378/1552 transitions.
[2024-05-27 23:21:15] [INFO ] Flatten gal took : 47 ms
[2024-05-27 23:21:15] [INFO ] Flatten gal took : 49 ms
[2024-05-27 23:21:15] [INFO ] Input system was already deterministic with 1378 transitions.
RANDOM walk for 185 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S04J06T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 1552/1552 transitions.
Applied a total of 0 rules in 8 ms. Remains 602 /602 variables (removed 0) and now considering 1552/1552 (removed 0) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:21:15] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:21:15] [INFO ] Computed 50 invariants in 68 ms
[2024-05-27 23:21:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:21:32] [INFO ] Deduced a trap composed of 81 places in 43 ms of which 1 ms to minimize.
[2024-05-27 23:21:32] [INFO ] Deduced a trap composed of 81 places in 43 ms of which 1 ms to minimize.
[2024-05-27 23:21:32] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:21:32] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:21:33] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-05-27 23:21:33] [INFO ] Deduced a trap composed of 340 places in 270 ms of which 3 ms to minimize.
[2024-05-27 23:21:33] [INFO ] Deduced a trap composed of 139 places in 313 ms of which 3 ms to minimize.
[2024-05-27 23:21:34] [INFO ] Deduced a trap composed of 336 places in 414 ms of which 5 ms to minimize.
[2024-05-27 23:21:36] [INFO ] Deduced a trap composed of 377 places in 375 ms of which 4 ms to minimize.
[2024-05-27 23:21:36] [INFO ] Deduced a trap composed of 326 places in 326 ms of which 4 ms to minimize.
[2024-05-27 23:21:37] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:21:51] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 2 ms to minimize.
[2024-05-27 23:21:51] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-05-27 23:22:00] [INFO ] Deduced a trap composed of 313 places in 353 ms of which 3 ms to minimize.
SMT process timed out in 45007ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45022ms
Finished structural reductions in LTL mode , in 1 iterations and 45034 ms. Remains : 602/602 places, 1552/1552 transitions.
[2024-05-27 23:22:00] [INFO ] Flatten gal took : 50 ms
[2024-05-27 23:22:00] [INFO ] Flatten gal took : 54 ms
[2024-05-27 23:22:00] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 602/602 places, 1552/1552 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 602 transition count 1522
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 572 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 566 transition count 1516
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 72 place count 566 transition count 1444
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 216 place count 494 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 324 place count 440 transition count 1390
Applied a total of 324 rules in 55 ms. Remains 440 /602 variables (removed 162) and now considering 1390/1552 (removed 162) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-27 23:22:00] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 440 cols
[2024-05-27 23:22:00] [INFO ] Computed 50 invariants in 41 ms
[2024-05-27 23:22:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-27 23:22:14] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 2 ms to minimize.
[2024-05-27 23:22:14] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2024-05-27 23:22:14] [INFO ] Deduced a trap composed of 54 places in 37 ms of which 1 ms to minimize.
[2024-05-27 23:22:14] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-27 23:22:14] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:22:14] [INFO ] Deduced a trap composed of 182 places in 350 ms of which 3 ms to minimize.
[2024-05-27 23:22:15] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 2 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 1 ms to minimize.
[2024-05-27 23:22:17] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/1806 variables, and 55 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/440 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 30/46 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/436 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/1806 variables, and 55 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/18 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/440 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 9/9 constraints]
After SMT, in 44662ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 44675ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44733 ms. Remains : 440/602 places, 1390/1552 transitions.
[2024-05-27 23:22:45] [INFO ] Flatten gal took : 59 ms
[2024-05-27 23:22:45] [INFO ] Flatten gal took : 57 ms
[2024-05-27 23:22:45] [INFO ] Input system was already deterministic with 1390 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 602/602 places, 1552/1552 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 602 transition count 1516
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 566 transition count 1510
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 560 transition count 1510
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 84 place count 560 transition count 1468
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 168 place count 518 transition count 1468
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 288 place count 458 transition count 1408
Applied a total of 288 rules in 54 ms. Remains 458 /602 variables (removed 144) and now considering 1408/1552 (removed 144) transitions.
Running 1404 sub problems to find dead transitions.
[2024-05-27 23:22:45] [INFO ] Flow matrix only has 1384 transitions (discarded 24 similar events)
// Phase 1: matrix 1384 rows 458 cols
[2024-05-27 23:22:45] [INFO ] Computed 50 invariants in 21 ms
[2024-05-27 23:22:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1404 unsolved
[2024-05-27 23:22:59] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:22:59] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:22:59] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
[2024-05-27 23:22:59] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:22:59] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-27 23:23:00] [INFO ] Deduced a trap composed of 197 places in 264 ms of which 3 ms to minimize.
[2024-05-27 23:23:00] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-27 23:23:01] [INFO ] Deduced a trap composed of 61 places in 262 ms of which 3 ms to minimize.
[2024-05-27 23:23:03] [INFO ] Deduced a trap composed of 216 places in 210 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/1842 variables, and 55 constraints, problems are : Problem set: 0 solved, 1404 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1404/1404 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1404 unsolved
[2024-05-27 23:23:16] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-27 23:23:28] [INFO ] Deduced a trap composed of 151 places in 214 ms of which 2 ms to minimize.
[2024-05-27 23:23:29] [INFO ] Deduced a trap composed of 201 places in 244 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/1842 variables, and 58 constraints, problems are : Problem set: 0 solved, 1404 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/458 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1404 constraints, Known Traps: 12/12 constraints]
After SMT, in 44777ms problems are : Problem set: 0 solved, 1404 unsolved
Search for dead transitions found 0 dead transitions in 44790ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 44847 ms. Remains : 458/602 places, 1408/1552 transitions.
[2024-05-27 23:23:30] [INFO ] Flatten gal took : 49 ms
[2024-05-27 23:23:30] [INFO ] Flatten gal took : 53 ms
[2024-05-27 23:23:30] [INFO ] Input system was already deterministic with 1408 transitions.
[2024-05-27 23:23:30] [INFO ] Flatten gal took : 51 ms
[2024-05-27 23:23:30] [INFO ] Flatten gal took : 53 ms
[2024-05-27 23:23:30] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-27 23:23:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 602 places, 1552 transitions and 7760 arcs took 15 ms.
Total runtime 438353 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 602
TRANSITIONS: 1552
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.035s, Sys 0.004s]


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


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

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

Process ID: 1051
MODEL NAME: /home/mcc/execution/414/model
602 places, 1552 transitions.

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..
No place bound informations found.
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-S04J06T06"
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-S04J06T06, 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-171654445300145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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