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.r516-tajo-171654446500177.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S06J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446500177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:51 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.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-S06J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717251014989

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:10:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:10:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:10:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:10:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:10:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 748 ms
[2024-06-01 14:10:17] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 632 PT places and 10560.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2024-06-01 14:10:17] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-06-01 14:10:17] [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 40005 steps (3867 resets) in 1680 ms. (23 steps per ms) remains 92/110 properties
BEST_FIRST walk for 4002 steps (14 resets) in 138 ms. (28 steps per ms) remains 82/92 properties
BEST_FIRST walk for 4001 steps (13 resets) in 122 ms. (32 steps per ms) remains 82/82 properties
BEST_FIRST walk for 4004 steps (15 resets) in 102 ms. (38 steps per ms) remains 81/82 properties
BEST_FIRST walk for 4002 steps (12 resets) in 69 ms. (57 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (20 resets) in 49 ms. (80 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (16 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (14 resets) in 41 ms. (95 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (21 resets) in 41 ms. (95 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (20 resets) in 55 ms. (71 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (10 resets) in 36 ms. (108 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (18 resets) in 63 ms. (62 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (14 resets) in 40 ms. (97 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4003 steps (16 resets) in 37 ms. (105 steps per ms) remains 80/81 properties
BEST_FIRST walk for 4004 steps (20 resets) in 45 ms. (87 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (17 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (12 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (16 resets) in 41 ms. (95 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (12 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (20 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (16 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (17 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (12 resets) in 21 ms. (181 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (208 resets) in 14 ms. (266 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (17 resets) in 26 ms. (148 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (22 resets) in 37 ms. (105 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (18 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (29 resets) in 50 ms. (78 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (18 resets) in 31 ms. (125 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (26 resets) in 22 ms. (174 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (18 resets) in 34 ms. (114 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (18 resets) in 30 ms. (129 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (12 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (18 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (13 resets) in 33 ms. (117 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (14 resets) in 25 ms. (153 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (14 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (32 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (13 resets) in 28 ms. (138 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4001 steps (12 resets) in 29 ms. (133 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (26 resets) in 40 ms. (97 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4003 steps (14 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (13 resets) in 24 ms. (160 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4000 steps (13 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (208 resets) in 13 ms. (286 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (21 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (17 resets) in 20 ms. (190 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (208 resets) in 15 ms. (250 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (12 resets) in 27 ms. (142 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 4002 steps (17 resets) in 33 ms. (117 steps per ms) remains 80/80 properties
[2024-06-01 14:10:19] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:10:19] [INFO ] Computed 26 invariants in 7 ms
[2024-06-01 14:10:19] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp108 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 71 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp107 is UNSAT
At refinement iteration 3 (OVERLAPS) 14/74 variables, 8/12 constraints. Problems are: Problem set: 56 solved, 24 unsolved
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp106 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 4/16 constraints. Problems are: Problem set: 60 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 60 solved, 20 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp109 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 26 constraints, problems are : Problem set: 80 solved, 0 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 738ms problems are : Problem set: 80 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 80 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:10:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-06-01 14:10:19] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:10:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:10:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:10:19] [INFO ] Flatten gal took : 10 ms
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
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
[2024-06-01 14:10:20] [INFO ] Unfolded HLPN to a Petri net with 632 places and 10500 transitions 88770 arcs in 205 ms.
[2024-06-01 14:10:20] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 230 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 620 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 620 transition count 2424
Applied a total of 18 rules in 109 ms. Remains 620 /632 variables (removed 12) and now considering 2424/2430 (removed 6) transitions.
Running 2418 sub problems to find dead transitions.
[2024-06-01 14:10:20] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 620 cols
[2024-06-01 14:10:20] [INFO ] Computed 48 invariants in 178 ms
[2024-06-01 14:10:20] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2418 unsolved
SMT process timed out in 41753ms, After SMT, problems are : Problem set: 0 solved, 2418 unsolved
Search for dead transitions found 0 dead transitions in 41788ms
[2024-06-01 14:11:02] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
[2024-06-01 14:11:02] [INFO ] Invariant cache hit.
[2024-06-01 14:11:02] [INFO ] Implicit Places using invariants in 430 ms returned [490, 491, 492, 493, 494, 495]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 440 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 614/632 places, 2424/2430 transitions.
Applied a total of 0 rules in 19 ms. Remains 614 /614 variables (removed 0) and now considering 2424/2424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42392 ms. Remains : 614/632 places, 2424/2430 transitions.
Support contains 230 out of 614 places after structural reductions.
[2024-06-01 14:11:02] [INFO ] Flatten gal took : 203 ms
[2024-06-01 14:11:03] [INFO ] Flatten gal took : 146 ms
[2024-06-01 14:11:03] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 218 out of 614 places (down from 230) after GAL structural reductions.
RANDOM walk for 40000 steps (285 resets) in 1367 ms. (29 steps per ms) remains 18/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (13 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 52 ms. (75 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (14 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (16 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (14 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (17 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (14 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
[2024-06-01 14:11:04] [INFO ] Flow matrix only has 2388 transitions (discarded 36 similar events)
// Phase 1: matrix 2388 rows 614 cols
[2024-06-01 14:11:04] [INFO ] Computed 42 invariants in 52 ms
[2024-06-01 14:11:04] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 1 (OVERLAPS) 143/282 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 15/297 variables, 4/12 constraints. Problems are: Problem set: 2 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 16 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 610/3002 variables, and 39 constraints, problems are : Problem set: 18 solved, 0 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 11/14 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/614 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 18/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 807ms problems are : Problem set: 18 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 18 atomic propositions for a total of 5 simplifications.
[2024-06-01 14:11:05] [INFO ] Flatten gal took : 165 ms
[2024-06-01 14:11:05] [INFO ] Flatten gal took : 116 ms
[2024-06-01 14:11:05] [INFO ] Input system was already deterministic with 2424 transitions.
Support contains 49 out of 614 places (down from 76) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 53 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:11:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 608 cols
[2024-06-01 14:11:05] [INFO ] Computed 42 invariants in 43 ms
[2024-06-01 14:11:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:11:42] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 16 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 25 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 14/28 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 25 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 14/28 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 1/1 constraints]
After SMT, in 59168ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59202ms
Finished structural reductions in LTL mode , in 1 iterations and 59277 ms. Remains : 608/614 places, 2418/2424 transitions.
[2024-06-01 14:12:04] [INFO ] Flatten gal took : 103 ms
[2024-06-01 14:12:05] [INFO ] Flatten gal took : 111 ms
[2024-06-01 14:12:05] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 62 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:12:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:12:05] [INFO ] Invariant cache hit.
[2024-06-01 14:12:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:12:42] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
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 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.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 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 9.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 4.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 25 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 14/28 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
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 602/2990 variables, and 25 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 14/28 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 1/1 constraints]
After SMT, in 59583ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59613ms
Finished structural reductions in LTL mode , in 1 iterations and 59693 ms. Remains : 608/614 places, 2418/2424 transitions.
[2024-06-01 14:13:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 14:13:05] [INFO ] Flatten gal took : 108 ms
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:13:05] [INFO ] Flatten gal took : 105 ms
[2024-06-01 14:13:05] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 614/614 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 608 transition count 2418
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 608 transition count 2418
Applied a total of 12 rules in 44 ms. Remains 608 /614 variables (removed 6) and now considering 2418/2424 (removed 6) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 14:13:05] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 14:13:05] [INFO ] Invariant cache hit.
[2024-06-01 14:13:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 14:13:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/2990 variables, and 25 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 14/28 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/602 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/2990 variables, and 25 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 14/28 constraints, State Equation: 0/608 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 1/1 constraints]
After SMT, in 59827ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 59854ms
Finished structural reductions in LTL mode , in 1 iterations and 59904 ms. Remains : 608/614 places, 2418/2424 transitions.
[2024-06-01 14:14:05] [INFO ] Flatten gal took : 124 ms
[2024-06-01 14:14:05] [INFO ] Flatten gal took : 132 ms
[2024-06-01 14:14:05] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 2424/2424 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 614 transition count 2382
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 572 transition count 2382
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 572 transition count 2310
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 228 place count 500 transition count 2310
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 384 place count 422 transition count 2232
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 390 place count 416 transition count 2226
Iterating global reduction 2 with 6 rules applied. Total rules applied 396 place count 416 transition count 2226
Applied a total of 396 rules in 296 ms. Remains 416 /614 variables (removed 198) and now considering 2226/2424 (removed 198) transitions.
Running 2220 sub problems to find dead transitions.
[2024-06-01 14:14:06] [INFO ] Flow matrix only has 2190 transitions (discarded 36 similar events)
// Phase 1: matrix 2190 rows 416 cols
[2024-06-01 14:14:06] [INFO ] Computed 42 invariants in 38 ms
[2024-06-01 14:14:06] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 1 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 52 places in 456 ms of which 4 ms to minimize.
[2024-06-01 14:14:40] [INFO ] Deduced a trap composed of 187 places in 416 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 410/2606 variables, and 43 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2220/966 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2220 unsolved
[2024-06-01 14:14:50] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/2606 variables, and 44 constraints, problems are : Problem set: 0 solved, 2220 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/416 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/966 constraints, Known Traps: 8/8 constraints]
After SMT, in 58846ms problems are : Problem set: 0 solved, 2220 unsolved
Search for dead transitions found 0 dead transitions in 58872ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 59174 ms. Remains : 416/614 places, 2226/2424 transitions.
[2024-06-01 14:15:05] [INFO ] Flatten gal took : 82 ms
[2024-06-01 14:15:05] [INFO ] Flatten gal took : 86 ms
[2024-06-01 14:15:05] [INFO ] Input system was already deterministic with 2226 transitions.
RANDOM walk for 163 steps (5 resets) in 7 ms. (20 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S06J04T06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 614/614 places, 2424/2424 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 614 transition count 2388
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 578 transition count 2388
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 72 place count 578 transition count 2316
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 216 place count 506 transition count 2316
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 372 place count 428 transition count 2238
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 378 place count 422 transition count 2232
Iterating global reduction 2 with 6 rules applied. Total rules applied 384 place count 422 transition count 2232
Applied a total of 384 rules in 104 ms. Remains 422 /614 variables (removed 192) and now considering 2232/2424 (removed 192) transitions.
Running 2226 sub problems to find dead transitions.
[2024-06-01 14:15:05] [INFO ] Flow matrix only has 2196 transitions (discarded 36 similar events)
// Phase 1: matrix 2196 rows 422 cols
[2024-06-01 14:15:05] [INFO ] Computed 42 invariants in 47 ms
[2024-06-01 14:15:05] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2024-06-01 14:15:34] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2024-06-01 14:15:35] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-06-01 14:15:35] [INFO ] Deduced a trap composed of 189 places in 402 ms of which 2 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 53 places in 503 ms of which 4 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 197 places in 411 ms of which 3 ms to minimize.
[2024-06-01 14:15:36] [INFO ] Deduced a trap composed of 177 places in 472 ms of which 3 ms to minimize.
[2024-06-01 14:15:37] [INFO ] Deduced a trap composed of 202 places in 542 ms of which 3 ms to minimize.
[2024-06-01 14:15:38] [INFO ] Deduced a trap composed of 188 places in 473 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/2618 variables, and 47 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2226/972 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 2226 unsolved
[2024-06-01 14:15:49] [INFO ] Deduced a trap composed of 184 places in 365 ms of which 3 ms to minimize.
[2024-06-01 14:15:51] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 9)
(s1 1)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/2618 variables, and 49 constraints, problems are : Problem set: 0 solved, 2226 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/422 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/972 constraints, Known Traps: 13/13 constraints]
After SMT, in 57124ms problems are : Problem set: 0 solved, 2226 unsolved
Search for dead transitions found 0 dead transitions in 57142ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 57251 ms. Remains : 422/614 places, 2232/2424 transitions.
[2024-06-01 14:16:02] [INFO ] Flatten gal took : 115 ms
[2024-06-01 14:16:02] [INFO ] Flatten gal took : 98 ms
[2024-06-01 14:16:03] [INFO ] Input system was already deterministic with 2232 transitions.
[2024-06-01 14:16:03] [INFO ] Flatten gal took : 128 ms
[2024-06-01 14:16:03] [INFO ] Flatten gal took : 130 ms
[2024-06-01 14:16:03] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 14:16:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 614 places, 2424 transitions and 14814 arcs took 24 ms.
Total runtime 346968 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-COL-S06J04T06-CTLCardinality-2024-12

BK_STOP 1717251363615

--------------------
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
mcc2024
ctl formula name PolyORBLF-COL-S06J04T06-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/665/ctl_0_
ctl formula name PolyORBLF-COL-S06J04T06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/665/ctl_1_
ctl formula name PolyORBLF-COL-S06J04T06-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/665/ctl_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J04T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S06J04T06, 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 r516-tajo-171654446500177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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