About the Execution of ITS-Tools for PolyORBLF-COL-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 2128840.00 | 0.00 | 0.00 | FTFFTF?TFTTF?T?T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446600201.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S06J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446600201
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K Apr 11 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 17:16 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 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:48 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-S06J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716911620700
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 15:53:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:53:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:53:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 15:53:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:53:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 602 ms
[2024-05-28 15:53:42] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 23 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2024-05-28 15:53:42] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 4 ms.
[2024-05-28 15:53:42] [INFO ] Skeletonized 16 HLPN properties in 2 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 40001 steps (3803 resets) in 2156 ms. (18 steps per ms) remains 50/65 properties
BEST_FIRST walk for 4003 steps (11 resets) in 217 ms. (18 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (10 resets) in 74 ms. (53 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (11 resets) in 28 ms. (137 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (208 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (13 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (18 resets) in 34 ms. (114 steps per ms) remains 49/50 properties
BEST_FIRST walk for 4002 steps (10 resets) in 43 ms. (90 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (12 resets) in 29 ms. (133 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (15 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (15 resets) in 55 ms. (71 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (12 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (18 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (12 resets) in 39 ms. (100 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (11 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (15 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (208 resets) in 35 ms. (111 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (16 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (16 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (14 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (20 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (12 resets) in 39 ms. (100 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (17 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (18 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (16 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (10 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (16 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (18 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (10 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (14 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (14 resets) in 93 ms. (42 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (13 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (12 resets) in 30 ms. (129 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (11 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (17 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (11 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (10 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (15 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (15 resets) in 31 ms. (125 steps per ms) remains 49/49 properties
[2024-05-28 15:53:44] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:53:44] [INFO ] Computed 26 invariants in 7 ms
[2024-05-28 15:53:44] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp52 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 47 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 44 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/70 variables, 10/13 constraints. Problems are: Problem set: 34 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/13 constraints. Problems are: Problem set: 34 solved, 15 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 5 (OVERLAPS) 11/81 variables, 13/26 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 48 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 48 solved, 1 unsolved in 475 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: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 48 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/31 variables, 3/3 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/45 variables, 5/8 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/49 variables, 1/9 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 48 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 48 solved, 1 unsolved
[2024-05-28 15:53:45] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 9 ms to minimize.
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 73/145 variables, and 22 constraints, problems are : Problem set: 49 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 0/49 constraints, Known Traps: 1/1 constraints]
After SMT, in 624ms problems are : Problem set: 49 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:53:45] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 15:53:45] [INFO ] Flatten gal took : 24 ms
[2024-05-28 15:53:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 15:53:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:53:45] [INFO ] Flatten gal took : 10 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-28 15:53:45] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 188 ms.
[2024-05-28 15:53:45] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 330 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 85 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-05-28 15:53:45] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-05-28 15:53:45] [INFO ] Computed 52 invariants in 187 ms
[2024-05-28 15:53:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 39846ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 39885ms
[2024-05-28 15:54:25] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-05-28 15:54:25] [INFO ] Invariant cache hit.
[2024-05-28 15:54:25] [INFO ] Implicit Places using invariants in 273 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 283 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 17 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40303 ms. Remains : 688/700 places, 2670/2670 transitions.
Support contains 330 out of 688 places after structural reductions.
[2024-05-28 15:54:25] [INFO ] Flatten gal took : 221 ms
[2024-05-28 15:54:26] [INFO ] Flatten gal took : 154 ms
[2024-05-28 15:54:26] [INFO ] Input system was already deterministic with 2670 transitions.
RANDOM walk for 40000 steps (252 resets) in 1334 ms. (29 steps per ms) remains 18/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (14 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (14 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (112 resets) in 43 ms. (90 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (13 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (37 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (9 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (14 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
[2024-05-28 15:54:27] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-05-28 15:54:27] [INFO ] Computed 46 invariants in 88 ms
[2024-05-28 15:54:27] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 233/425 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 1/12 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 0/12 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 22/447 variables, 6/18 constraints. Problems are: Problem set: 9 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/18 constraints. Problems are: Problem set: 9 solved, 9 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 684/3322 variables, and 42 constraints, problems are : Problem set: 18 solved, 0 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 18/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 990ms problems are : Problem set: 18 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 18 atomic propositions for a total of 6 simplifications.
[2024-05-28 15:54:28] [INFO ] Flatten gal took : 172 ms
[2024-05-28 15:54:28] [INFO ] Flatten gal took : 175 ms
[2024-05-28 15:54:28] [INFO ] Input system was already deterministic with 2670 transitions.
Support contains 63 out of 688 places (down from 188) after GAL structural reductions.
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 78 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 15:54:28] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-05-28 15:54:29] [INFO ] Computed 46 invariants in 119 ms
[2024-05-28 15:54:29] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40150ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40176ms
[2024-05-28 15:55:09] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:55:09] [INFO ] Invariant cache hit.
[2024-05-28 15:55:09] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-05-28 15:55:09] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:55:09] [INFO ] Invariant cache hit.
[2024-05-28 15:55:10] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:55:22] [INFO ] Implicit Places using invariants and state equation in 13046 ms returned []
Implicit Place search using SMT with State Equation took 13597 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 15:55:22] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:55:22] [INFO ] Invariant cache hit.
[2024-05-28 15:55:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 15:56:04] [INFO ] Deduced a trap composed of 93 places in 217 ms of which 4 ms to minimize.
[2024-05-28 15:56:04] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 2 ms to minimize.
[2024-05-28 15:56:04] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-05-28 15:56:04] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-28 15:56:05] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2024-05-28 15:56:06] [INFO ] Deduced a trap composed of 407 places in 586 ms of which 5 ms to minimize.
[2024-05-28 15:56:06] [INFO ] Deduced a trap composed of 414 places in 529 ms of which 4 ms to minimize.
[2024-05-28 15:56:07] [INFO ] Deduced a trap composed of 177 places in 458 ms of which 4 ms to minimize.
[2024-05-28 15:56:08] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 2 ms to minimize.
[2024-05-28 15:56:09] [INFO ] Deduced a trap composed of 366 places in 652 ms of which 5 ms to minimize.
[2024-05-28 15:56:12] [INFO ] Deduced a trap composed of 399 places in 702 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 51 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 15:56:17] [INFO ] Deduced a trap composed of 375 places in 589 ms of which 5 ms to minimize.
[2024-05-28 15:56:20] [INFO ] Deduced a trap composed of 103 places in 647 ms of which 5 ms to minimize.
[2024-05-28 15:56:21] [INFO ] Deduced a trap composed of 363 places in 734 ms of which 5 ms to minimize.
[2024-05-28 15:56:31] [INFO ] Deduced a trap composed of 372 places in 527 ms of which 7 ms to minimize.
[2024-05-28 15:56:35] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 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 670/3298 variables, and 56 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 16/16 constraints]
After SMT, in 79453ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 79478ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133349 ms. Remains : 676/688 places, 2658/2670 transitions.
[2024-05-28 15:56:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 15:56:42] [INFO ] Flatten gal took : 174 ms
FORMULA PolyORBLF-COL-S06J06T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:56:42] [INFO ] Flatten gal took : 183 ms
[2024-05-28 15:56:42] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 103 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 15:56:43] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:56:43] [INFO ] Invariant cache hit.
[2024-05-28 15:56:43] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 46869ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 46907ms
[2024-05-28 15:57:29] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:57:29] [INFO ] Invariant cache hit.
[2024-05-28 15:57:30] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-28 15:57:30] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:57:30] [INFO ] Invariant cache hit.
[2024-05-28 15:57:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 15:57:44] [INFO ] Implicit Places using invariants and state equation in 14307 ms returned []
Implicit Place search using SMT with State Equation took 15033 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 15:57:45] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 15:57:45] [INFO ] Invariant cache hit.
[2024-05-28 15:57:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 15:58:35] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2024-05-28 15:58:35] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2024-05-28 15:58:35] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 1 ms to minimize.
[2024-05-28 15:58:35] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 1 ms to minimize.
[2024-05-28 15:58:36] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:58:37] [INFO ] Deduced a trap composed of 407 places in 614 ms of which 5 ms to minimize.
[2024-05-28 15:58:37] [INFO ] Deduced a trap composed of 414 places in 551 ms of which 5 ms to minimize.
[2024-05-28 15:58:38] [INFO ] Deduced a trap composed of 177 places in 522 ms of which 5 ms to minimize.
[2024-05-28 15:58:39] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-05-28 15:58:40] [INFO ] Deduced a trap composed of 366 places in 536 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 10.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.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 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.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 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 10.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 50 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 15:58:49] [INFO ] Deduced a trap composed of 408 places in 701 ms of which 5 ms to minimize.
[2024-05-28 15:58:49] [INFO ] Deduced a trap composed of 388 places in 532 ms of which 4 ms to minimize.
[2024-05-28 15:58:50] [INFO ] Deduced a trap composed of 49 places in 492 ms of which 4 ms to minimize.
[2024-05-28 15:58:50] [INFO ] Deduced a trap composed of 417 places in 485 ms of which 5 ms to minimize.
[2024-05-28 15:58:51] [INFO ] Deduced a trap composed of 456 places in 640 ms of which 3 ms to minimize.
[2024-05-28 15:58:52] [INFO ] Deduced a trap composed of 46 places in 727 ms of which 3 ms to minimize.
[2024-05-28 15:58:52] [INFO ] Deduced a trap composed of 15 places in 583 ms of which 3 ms to minimize.
[2024-05-28 15:58:53] [INFO ] Deduced a trap composed of 397 places in 575 ms of which 3 ms to minimize.
[2024-05-28 15:58:54] [INFO ] Deduced a trap composed of 415 places in 500 ms of which 3 ms to minimize.
[2024-05-28 15:58:54] [INFO ] Deduced a trap composed of 449 places in 481 ms of which 3 ms to minimize.
[2024-05-28 15:58:55] [INFO ] Deduced a trap composed of 399 places in 525 ms of which 4 ms to minimize.
[2024-05-28 15:59:01] [INFO ] Deduced a trap composed of 65 places in 437 ms of which 3 ms to minimize.
[2024-05-28 15:59:06] [INFO ] Deduced a trap composed of 373 places in 646 ms of which 6 ms to minimize.
[2024-05-28 15:59:06] [INFO ] Deduced a trap composed of 404 places in 591 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 64 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 24/24 constraints]
After SMT, in 86710ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 86769ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148834 ms. Remains : 676/688 places, 2658/2670 transitions.
[2024-05-28 15:59:11] [INFO ] Flatten gal took : 123 ms
[2024-05-28 15:59:12] [INFO ] Flatten gal took : 139 ms
[2024-05-28 15:59:12] [INFO ] Input system was already deterministic with 2658 transitions.
[2024-05-28 15:59:12] [INFO ] Flatten gal took : 120 ms
[2024-05-28 15:59:12] [INFO ] Flatten gal took : 128 ms
[2024-05-28 15:59:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10625948997740045005.gal : 106 ms
[2024-05-28 15:59:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality6417246607214252012.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10625948997740045005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6417246607214252012.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 15:59:42] [INFO ] Flatten gal took : 165 ms
[2024-05-28 15:59:42] [INFO ] Applying decomposition
[2024-05-28 15:59:43] [INFO ] Flatten gal took : 142 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph598746206599064478.txt' '-o' '/tmp/graph598746206599064478.bin' '-w' '/tmp/graph598746206599064478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph598746206599064478.bin' '-l' '-1' '-v' '-w' '/tmp/graph598746206599064478.weights' '-q' '0' '-e' '0.001'
[2024-05-28 15:59:43] [INFO ] Decomposing Gal with order
[2024-05-28 15:59:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 15:59:44] [INFO ] Removed a total of 1254 redundant transitions.
[2024-05-28 15:59:44] [INFO ] Flatten gal took : 358 ms
[2024-05-28 15:59:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 119 ms.
[2024-05-28 15:59:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14050569826908854598.gal : 72 ms
[2024-05-28 15:59:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality11776322596687887572.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14050569826908854598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11776322596687887572.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 45 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 16:00:14] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:00:14] [INFO ] Invariant cache hit.
[2024-05-28 16:00:14] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 42184ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
[2024-05-28 16:00:56] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:00:56] [INFO ] Invariant cache hit.
[2024-05-28 16:00:57] [INFO ] Implicit Places using invariants in 682 ms returned []
[2024-05-28 16:00:57] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:00:57] [INFO ] Invariant cache hit.
[2024-05-28 16:00:59] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:01:11] [INFO ] Implicit Places using invariants and state equation in 14318 ms returned []
Implicit Place search using SMT with State Equation took 15007 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 16:01:11] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 16:01:11] [INFO ] Invariant cache hit.
[2024-05-28 16:01:11] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 6 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-05-28 16:01:56] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:01:57] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 407 places in 691 ms of which 5 ms to minimize.
[2024-05-28 16:01:58] [INFO ] Deduced a trap composed of 414 places in 578 ms of which 5 ms to minimize.
[2024-05-28 16:01:59] [INFO ] Deduced a trap composed of 177 places in 556 ms of which 5 ms to minimize.
[2024-05-28 16:02:00] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:02:01] [INFO ] Deduced a trap composed of 366 places in 598 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 50 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 16:02:10] [INFO ] Deduced a trap composed of 408 places in 704 ms of which 5 ms to minimize.
[2024-05-28 16:02:10] [INFO ] Deduced a trap composed of 388 places in 668 ms of which 4 ms to minimize.
[2024-05-28 16:02:11] [INFO ] Deduced a trap composed of 49 places in 758 ms of which 5 ms to minimize.
[2024-05-28 16:02:12] [INFO ] Deduced a trap composed of 417 places in 672 ms of which 5 ms to minimize.
[2024-05-28 16:02:13] [INFO ] Deduced a trap composed of 456 places in 620 ms of which 7 ms to minimize.
[2024-05-28 16:02:13] [INFO ] Deduced a trap composed of 46 places in 672 ms of which 5 ms to minimize.
[2024-05-28 16:02:14] [INFO ] Deduced a trap composed of 15 places in 598 ms of which 4 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 397 places in 674 ms of which 5 ms to minimize.
[2024-05-28 16:02:15] [INFO ] Deduced a trap composed of 415 places in 679 ms of which 5 ms to minimize.
[2024-05-28 16:02:16] [INFO ] Deduced a trap composed of 449 places in 633 ms of which 4 ms to minimize.
[2024-05-28 16:02:17] [INFO ] Deduced a trap composed of 399 places in 568 ms of which 6 ms to minimize.
[2024-05-28 16:02:22] [INFO ] Deduced a trap composed of 65 places in 456 ms of which 3 ms to minimize.
[2024-05-28 16:02:27] [INFO ] Deduced a trap composed of 373 places in 522 ms of which 5 ms to minimize.
[2024-05-28 16:02:28] [INFO ] Deduced a trap composed of 404 places in 464 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 64 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 24/24 constraints]
After SMT, in 81118ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 81148ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138425 ms. Remains : 676/688 places, 2658/2670 transitions.
[2024-05-28 16:02:33] [INFO ] Flatten gal took : 94 ms
[2024-05-28 16:02:33] [INFO ] Flatten gal took : 107 ms
[2024-05-28 16:02:33] [INFO ] Input system was already deterministic with 2658 transitions.
[2024-05-28 16:02:33] [INFO ] Flatten gal took : 100 ms
[2024-05-28 16:02:33] [INFO ] Flatten gal took : 173 ms
[2024-05-28 16:02:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3906564962759711832.gal : 22 ms
[2024-05-28 16:02:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12495049479429434925.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3906564962759711832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12495049479429434925.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:03:04] [INFO ] Flatten gal took : 177 ms
[2024-05-28 16:03:04] [INFO ] Applying decomposition
[2024-05-28 16:03:04] [INFO ] Flatten gal took : 211 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3602815381641743807.txt' '-o' '/tmp/graph3602815381641743807.bin' '-w' '/tmp/graph3602815381641743807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3602815381641743807.bin' '-l' '-1' '-v' '-w' '/tmp/graph3602815381641743807.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:03:04] [INFO ] Decomposing Gal with order
[2024-05-28 16:03:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:03:05] [INFO ] Removed a total of 2323 redundant transitions.
[2024-05-28 16:03:05] [INFO ] Flatten gal took : 566 ms
[2024-05-28 16:03:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 3209 labels/synchronizations in 235 ms.
[2024-05-28 16:03:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4830464425130166617.gal : 36 ms
[2024-05-28 16:03:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality15380836838745600581.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4830464425130166617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15380836838745600581.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
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 432 place count 472 transition count 2454
Applied a total of 432 rules in 386 ms. Remains 472 /688 variables (removed 216) and now considering 2454/2670 (removed 216) transitions.
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:03:37] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-05-28 16:03:37] [INFO ] Computed 46 invariants in 98 ms
[2024-05-28 16:03:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2024-05-28 16:04:14] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2024-05-28 16:04:15] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-28 16:04:15] [INFO ] Deduced a trap composed of 234 places in 429 ms of which 2 ms to minimize.
[2024-05-28 16:04:16] [INFO ] Deduced a trap composed of 200 places in 412 ms of which 2 ms to minimize.
[2024-05-28 16:04:16] [INFO ] Deduced a trap composed of 264 places in 428 ms of which 2 ms to minimize.
[2024-05-28 16:04:17] [INFO ] Deduced a trap composed of 226 places in 500 ms of which 3 ms to minimize.
[2024-05-28 16:04:17] [INFO ] Deduced a trap composed of 238 places in 405 ms of which 2 ms to minimize.
[2024-05-28 16:04:17] [INFO ] Deduced a trap composed of 225 places in 447 ms of which 2 ms to minimize.
[2024-05-28 16:04:18] [INFO ] Deduced a trap composed of 220 places in 429 ms of which 2 ms to minimize.
[2024-05-28 16:04:18] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 53 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:04:26] [INFO ] Deduced a trap composed of 216 places in 398 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 54 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 14/14 constraints]
After SMT, in 62202ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 62251ms
[2024-05-28 16:04:39] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:04:39] [INFO ] Invariant cache hit.
[2024-05-28 16:04:39] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-28 16:04:39] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:04:39] [INFO ] Invariant cache hit.
[2024-05-28 16:04:40] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 16:04:47] [INFO ] Implicit Places using invariants and state equation in 7659 ms returned []
Implicit Place search using SMT with State Equation took 8131 ms to find 0 implicit places.
[2024-05-28 16:04:47] [INFO ] Redundant transitions in 111 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-05-28 16:04:47] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-05-28 16:04:47] [INFO ] Invariant cache hit.
[2024-05-28 16:04:47] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:05:23] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 3 ms to minimize.
[2024-05-28 16:05:23] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 1 ms to minimize.
[2024-05-28 16:05:23] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:05:23] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 1 ms to minimize.
[2024-05-28 16:05:23] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:05:24] [INFO ] Deduced a trap composed of 229 places in 413 ms of which 3 ms to minimize.
[2024-05-28 16:05:24] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 0 ms to minimize.
[2024-05-28 16:05:27] [INFO ] Deduced a trap composed of 216 places in 355 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 48 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-05-28 16:05:42] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 2 ms to minimize.
[2024-05-28 16:05:45] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(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)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 10/10 constraints]
After SMT, in 80816ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 80839ms
Starting structural reductions in SI_CTL mode, iteration 1 : 472/688 places, 2454/2670 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 151775 ms. Remains : 472/688 places, 2454/2670 transitions.
[2024-05-28 16:06:08] [INFO ] Flatten gal took : 213 ms
[2024-05-28 16:06:08] [INFO ] Flatten gal took : 201 ms
[2024-05-28 16:06:09] [INFO ] Input system was already deterministic with 2454 transitions.
[2024-05-28 16:06:09] [INFO ] Flatten gal took : 160 ms
[2024-05-28 16:06:09] [INFO ] Flatten gal took : 102 ms
[2024-05-28 16:06:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9234329365665517644.gal : 28 ms
[2024-05-28 16:06:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality13797683835558173511.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9234329365665517644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13797683835558173511.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:06:39] [INFO ] Flatten gal took : 123 ms
[2024-05-28 16:06:39] [INFO ] Applying decomposition
[2024-05-28 16:06:39] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7151827683173786667.txt' '-o' '/tmp/graph7151827683173786667.bin' '-w' '/tmp/graph7151827683173786667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7151827683173786667.bin' '-l' '-1' '-v' '-w' '/tmp/graph7151827683173786667.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:06:39] [INFO ] Decomposing Gal with order
[2024-05-28 16:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:06:40] [INFO ] Removed a total of 1216 redundant transitions.
[2024-05-28 16:06:40] [INFO ] Flatten gal took : 383 ms
[2024-05-28 16:06:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2142 labels/synchronizations in 113 ms.
[2024-05-28 16:06:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality13759193301637491141.gal : 30 ms
[2024-05-28 16:06:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5510493011266129732.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13759193301637491141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5510493011266129732.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 16:07:11] [INFO ] Flatten gal took : 115 ms
[2024-05-28 16:07:11] [INFO ] Flatten gal took : 115 ms
[2024-05-28 16:07:11] [INFO ] Applying decomposition
[2024-05-28 16:07:11] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13677399674116398504.txt' '-o' '/tmp/graph13677399674116398504.bin' '-w' '/tmp/graph13677399674116398504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13677399674116398504.bin' '-l' '-1' '-v' '-w' '/tmp/graph13677399674116398504.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:07:11] [INFO ] Decomposing Gal with order
[2024-05-28 16:07:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:07:12] [INFO ] Removed a total of 2031 redundant transitions.
[2024-05-28 16:07:12] [INFO ] Flatten gal took : 400 ms
[2024-05-28 16:07:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 3264 labels/synchronizations in 84 ms.
[2024-05-28 16:07:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7374032241349484771.gal : 21 ms
[2024-05-28 16:07:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15112743786526571175.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7374032241349484771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15112743786526571175.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 16:14:37] [INFO ] Applying decomposition
[2024-05-28 16:14:37] [INFO ] Flatten gal took : 201 ms
[2024-05-28 16:14:37] [INFO ] Decomposing Gal with order
[2024-05-28 16:14:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:14:38] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to cJobCnt in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[AwakeTasks_0, IdleTasks_0, NotifyEventJobQueuedE_0, QueueJobE_0, P_2321_0, TryAllocateOneTaskE_0, TryAllocateOneTaskB_0, P_2318_0, EnablePollingE_0, EnablePollingB_0, FetchJobB_0, ScheduleTaskE_Check_0, ScheduleTaskB_0, Abort_Check_Sources_E_0, Abort_Check_Sources_B_0, NotifyEventSourceAddedB_0, Insert_Source_E_0, NotifyEventSourceAddedE_0, P_1113_0, ProcessingEvt_0, P_1155_0, nyo_0, P_1158_0, P_1159_0, P_1160_0, NotifyEventEndOfCheckSourcesB_0, NotifyEventEndOfCheckSourcesE_0, Check_Sources_B_0, Check_Sources_E_0, NotifyEventJobCompletedE_0, NotifyEventJobCompletedB_0, RunE_0, RunB_0, Perform_Work_E_0, Try_Check_Sources_B_0, Try_Check_Sources_E_0, P_1617_0, ScheduleTaskE_Idle_0],[AwakeTasks_1, IdleTasks_1, NotifyEventJobQueuedE_1, QueueJobE_1, P_2321_1, TryAllocateOneTaskE_1, TryAllocateOneTaskB_1, P_2318_1, EnablePollingE_1, EnablePollingB_1, FetchJobB_1, ScheduleTaskE_Check_1, ScheduleTaskB_1, Abort_Check_Sources_E_1, Abort_Check_Sources_B_1, NotifyEventSourceAddedB_1, Insert_Source_E_1, NotifyEventSourceAddedE_1, P_1113_1, ProcessingEvt_1, P_1155_1, nyo_1, P_1158_1, P_1159_1, P_1160_1, NotifyEventEndOfCheckSourcesB_1, NotifyEventEndOfCheckSourcesE_1, Check_Sources_B_1, Check_Sources_E_1, NotifyEventJobCompletedE_1, NotifyEventJobCompletedB_1, RunE_1, RunB_1, Perform_Work_E_1, Try_Check_Sources_B_1, Try_Check_Sources_E_1, P_1617_1, ScheduleTaskE_Idle_1],[AwakeTasks_2, IdleTasks_2, NotifyEventJobQueuedE_2, QueueJobE_2, P_2321_2, TryAllocateOneTaskE_2, TryAllocateOneTaskB_2, P_2318_2, EnablePollingE_2, EnablePollingB_2, FetchJobB_2, ScheduleTaskE_Check_2, ScheduleTaskB_2, Abort_Check_Sources_E_2, Abort_Check_Sources_B_2, NotifyEventSourceAddedB_2, Insert_Source_E_2, NotifyEventSourceAddedE_2, P_1113_2, ProcessingEvt_2, P_1155_2, nyo_2, P_1158_2, P_1159_2, P_1160_2, NotifyEventEndOfCheckSourcesB_2, NotifyEventEndOfCheckSourcesE_2, Check_Sources_B_2, Check_Sources_E_2, NotifyEventJobCompletedE_2, NotifyEventJobCompletedB_2, RunE_2, RunB_2, Perform_Work_E_2, Try_Check_Sources_B_2, Try_Check_Sources_E_2, P_1617_2, ScheduleTaskE_Idle_2],[AwakeTasks_3, IdleTasks_3, NotifyEventJobQueuedE_3, QueueJobE_3, P_2321_3, TryAllocateOneTaskE_3, TryAllocateOneTaskB_3, P_2318_3, EnablePollingE_3, EnablePollingB_3, FetchJobB_3, ScheduleTaskE_Check_3, ScheduleTaskB_3, Abort_Check_Sources_E_3, Abort_Check_Sources_B_3, NotifyEventSourceAddedB_3, Insert_Source_E_3, NotifyEventSourceAddedE_3, P_1113_3, ProcessingEvt_3, P_1155_3, nyo_3, P_1158_3, P_1159_3, P_1160_3, NotifyEventEndOfCheckSourcesB_3, NotifyEventEndOfCheckSourcesE_3, Check_Sources_B_3, Check_Sources_E_3, NotifyEventJobCompletedE_3, NotifyEventJobCompletedB_3, RunE_3, RunB_3, Perform_Work_E_3, Try_Check_Sources_B_3, Try_Check_Sources_E_3, P_1617_3, ScheduleTaskE_Idle_3],[AwakeTasks_4, IdleTasks_4, NotifyEventJobQueuedE_4, QueueJobE_4, P_2321_4, TryAllocateOneTaskE_4, TryAllocateOneTaskB_4, P_2318_4, EnablePollingE_4, EnablePollingB_4, FetchJobB_4, ScheduleTaskE_Check_4, ScheduleTaskB_4, Abort_Check_Sources_E_4, Abort_Check_Sources_B_4, NotifyEventSourceAddedB_4, Insert_Source_E_4, NotifyEventSourceAddedE_4, P_1113_4, ProcessingEvt_4, P_1155_4, nyo_4, P_1158_4, P_1159_4, P_1160_4, NotifyEventEndOfCheckSourcesB_4, NotifyEventEndOfCheckSourcesE_4, Check_Sources_B_4, Check_Sources_E_4, NotifyEventJobCompletedE_4, NotifyEventJobCompletedB_4, RunE_4, RunB_4, Perform_Work_E_4, Try_Check_Sources_B_4, Try_Check_Sources_E_4, P_1617_4, ScheduleTaskE_Idle_4],[AwakeTasks_5, IdleTasks_5, NotifyEventJobQueuedE_5, QueueJobE_5, P_2321_5, TryAllocateOneTaskE_5, TryAllocateOneTaskB_5, P_2318_5, EnablePollingE_5, EnablePollingB_5, FetchJobB_5, ScheduleTaskE_Check_5, ScheduleTaskB_5, Abort_Check_Sources_E_5, Abort_Check_Sources_B_5, NotifyEventSourceAddedB_5, Insert_Source_E_5, NotifyEventSourceAddedE_5, P_1113_5, ProcessingEvt_5, P_1155_5, nyo_5, P_1158_5, P_1159_5, P_1160_5, NotifyEventEndOfCheckSourcesB_5, NotifyEventEndOfCheckSourcesE_5, Check_Sources_B_5, Check_Sources_E_5, NotifyEventJobCompletedE_5, NotifyEventJobCompletedB_5, RunE_5, RunB_5, Perform_Work_E_5, Try_Check_Sources_B_5, Try_Check_Sources_E_5, P_1617_5, ScheduleTaskE_Idle_5],[P_1725_0, P_1724_0, P_1712_0, AvailableJobId_0],[P_1725_1, P_1724_1, P_1712_1, AvailableJobId_1],[P_1725_2, P_1724_2, P_1712_2, AvailableJobId_2],[P_1725_3, P_1724_3, P_1712_3, AvailableJobId_3],[P_1725_4, P_1724_4, P_1712_4, AvailableJobId_4],[P_1725_5, P_1724_5, P_1712_5, AvailableJobId_5],[P_1725_6, P_1724_6, P_1712_6, AvailableJobId_6],[NotifyEventJobQueuedB_0, QueueJobB_0, FetchJobE_0, ScheduleTaskE_Work_0],[NotifyEventJobQueuedB_1, QueueJobB_1, FetchJobE_1, ScheduleTaskE_Work_1],[NotifyEventJobQueuedB_2, QueueJobB_2, FetchJobE_2, ScheduleTaskE_Work_2],[NotifyEventJobQueuedB_3, QueueJobB_3, FetchJobE_3, ScheduleTaskE_Work_3],[NotifyEventJobQueuedB_4, QueueJobB_4, FetchJobE_4, ScheduleTaskE_Work_4],[NotifyEventJobQueuedB_5, QueueJobB_5, FetchJobE_5, ScheduleTaskE_Work_5],[NotifyEventJobQueuedB_6, QueueJobB_6, FetchJobE_6, ScheduleTaskE_Work_6],[NotifyEventJobQueuedB_7, QueueJobB_7, FetchJobE_7, ScheduleTaskE_Work_7],[NotifyEventJobQueuedB_8, QueueJobB_8, FetchJobE_8, ScheduleTaskE_Work_8],[NotifyEventJobQueuedB_9, QueueJobB_9, FetchJobE_9, ScheduleTaskE_Work_9],[NotifyEventJobQueuedB_10, QueueJobB_10, FetchJobE_10, ScheduleTaskE_Work_10],[NotifyEventJobQueuedB_11, QueueJobB_11, FetchJobE_11, ScheduleTaskE_Work_11],[NotifyEventJobQueuedB_12, QueueJobB_12, FetchJobE_12, ScheduleTaskE_Work_12],[NotifyEventJobQueuedB_13, QueueJobB_13, FetchJobE_13, ScheduleTaskE_Work_13],[NotifyEventJobQueuedB_14, QueueJobB_14, FetchJobE_14, ScheduleTaskE_Work_14],[NotifyEventJobQueuedB_15, QueueJobB_15, FetchJobE_15, ScheduleTaskE_Work_15],[NotifyEventJobQueuedB_16, QueueJobB_16, FetchJobE_16, ScheduleTaskE_Work_16],[NotifyEventJobQueuedB_17, QueueJobB_17, FetchJobE_17, ScheduleTaskE_Work_17],[NotifyEventJobQueuedB_18, QueueJobB_18, FetchJobE_18, ScheduleTaskE_Work_18],[NotifyEventJobQueuedB_19, QueueJobB_19, FetchJobE_19, ScheduleTaskE_Work_19],[NotifyEventJobQueuedB_20, QueueJobB_20, FetchJobE_20, ScheduleTaskE_Work_20],[NotifyEventJobQueuedB_21, QueueJobB_21, FetchJobE_21, ScheduleTaskE_Work_21],[NotifyEventJobQueuedB_22, QueueJobB_22, FetchJobE_22, ScheduleTaskE_Work_22],[NotifyEventJobQueuedB_23, QueueJobB_23, FetchJobE_23, ScheduleTaskE_Work_23],[NotifyEventJobQueuedB_24, QueueJobB_24, FetchJobE_24, ScheduleTaskE_Work_24],[NotifyEventJobQueuedB_25, QueueJobB_25, FetchJobE_25, ScheduleTaskE_Work_25],[NotifyEventJobQueuedB_26, QueueJobB_26, FetchJobE_26, ScheduleTaskE_Work_26],[NotifyEventJobQueuedB_27, QueueJobB_27, FetchJobE_27, ScheduleTaskE_Work_27],[NotifyEventJobQueuedB_28, QueueJobB_28, FetchJobE_28, ScheduleTaskE_Work_28],[NotifyEventJobQueuedB_29, QueueJobB_29, FetchJobE_29, ScheduleTaskE_Work_29],[NotifyEventJobQueuedB_30, QueueJobB_30, FetchJobE_30, ScheduleTaskE_Work_30],[NotifyEventJobQueuedB_31, QueueJobB_31, FetchJobE_31, ScheduleTaskE_Work_31],[NotifyEventJobQueuedB_32, QueueJobB_32, FetchJobE_32, ScheduleTaskE_Work_32],[NotifyEventJobQueuedB_33, QueueJobB_33, FetchJobE_33, ScheduleTaskE_Work_33],[NotifyEventJobQueuedB_34, QueueJobB_34, FetchJobE_34, ScheduleTaskE_Work_34],[NotifyEventJobQueuedB_35, QueueJobB_35, FetchJobE_35, ScheduleTaskE_Work_35],[NotifyEventJobQueuedB_36, QueueJobB_36, FetchJobE_36, ScheduleTaskE_Work_36],[NotifyEventJobQueuedB_37, QueueJobB_37, FetchJobE_37, ScheduleTaskE_Work_37],[NotifyEventJobQueuedB_38, QueueJobB_38, FetchJobE_38, ScheduleTaskE_Work_38],[NotifyEventJobQueuedB_39, QueueJobB_39, FetchJobE_39, ScheduleTaskE_Work_39],[NotifyEventJobQueuedB_40, QueueJobB_40, FetchJobE_40, ScheduleTaskE_Work_40],[NotifyEventJobQueuedB_41, QueueJobB_41, FetchJobE_41, ScheduleTaskE_Work_41],[DataOnSrc_0, ModifiedSrc_0, AbourtToModifySrc_0],[DataOnSrc_1, ModifiedSrc_1, AbourtToModifySrc_1],[DataOnSrc_2, ModifiedSrc_2, AbourtToModifySrc_2],[DataOnSrc_3, ModifiedSrc_3, AbourtToModifySrc_3],[DataOnSrc_4, ModifiedSrc_4, AbourtToModifySrc_4],[DataOnSrc_5, ModifiedSrc_5, AbourtToModifySrc_5],[DisablePollingE_0, DisablePollingB_0, Insert_Source_B_0, P_1119_0, P_2579_0],[DisablePollingE_1, DisablePollingB_1, Insert_Source_B_1, P_1119_1, P_2579_1],[DisablePollingE_2, DisablePollingB_2, Insert_Source_B_2, P_1119_2, P_2579_2],[DisablePollingE_3, DisablePollingB_3, Insert_Source_B_3, P_1119_3, P_2579_3],[DisablePollingE_4, DisablePollingB_4, Insert_Source_B_4, P_1119_4, P_2579_4],[DisablePollingE_5, DisablePollingB_5, Insert_Source_B_5, P_1119_5, P_2579_5],[DisablePollingE_6, DisablePollingB_6, Insert_Source_B_6, P_1119_6, P_2579_6],[DisablePollingE_7, DisablePollingB_7, Insert_Source_B_7, P_1119_7, P_2579_7],[DisablePollingE_8, DisablePollingB_8, Insert_Source_B_8, P_1119_8, P_2579_8],[DisablePollingE_9, DisablePollingB_9, Insert_Source_B_9, P_1119_9, P_2579_9],[DisablePollingE_10, DisablePollingB_10, Insert_Source_B_10, P_1119_10, P_2579_10],[DisablePollingE_11, DisablePollingB_11, Insert_Source_B_11, P_1119_11, P_2579_11],[DisablePollingE_12, DisablePollingB_12, Insert_Source_B_12, P_1119_12, P_2579_12],[DisablePollingE_13, DisablePollingB_13, Insert_Source_B_13, P_1119_13, P_2579_13],[DisablePollingE_14, DisablePollingB_14, Insert_Source_B_14, P_1119_14, P_2579_14],[DisablePollingE_15, DisablePollingB_15, Insert_Source_B_15, P_1119_15, P_2579_15],[DisablePollingE_16, DisablePollingB_16, Insert_Source_B_16, P_1119_16, P_2579_16],[DisablePollingE_17, DisablePollingB_17, Insert_Source_B_17, P_1119_17, P_2579_17],[DisablePollingE_18, DisablePollingB_18, Insert_Source_B_18, P_1119_18, P_2579_18],[DisablePollingE_19, DisablePollingB_19, Insert_Source_B_19, P_1119_19, P_2579_19],[DisablePollingE_20, DisablePollingB_20, Insert_Source_B_20, P_1119_20, P_2579_20],[DisablePollingE_21, DisablePollingB_21, Insert_Source_B_21, P_1119_21, P_2579_21],[DisablePollingE_22, DisablePollingB_22, Insert_Source_B_22, P_1119_22, P_2579_22],[DisablePollingE_23, DisablePollingB_23, Insert_Source_B_23, P_1119_23, P_2579_23],[DisablePollingE_24, DisablePollingB_24, Insert_Source_B_24, P_1119_24, P_2579_24],[DisablePollingE_25, DisablePollingB_25, Insert_Source_B_25, P_1119_25, P_2579_25],[DisablePollingE_26, DisablePollingB_26, Insert_Source_B_26, P_1119_26, P_2579_26],[DisablePollingE_27, DisablePollingB_27, Insert_Source_B_27, P_1119_27, P_2579_27],[DisablePollingE_28, DisablePollingB_28, Insert_Source_B_28, P_1119_28, P_2579_28],[DisablePollingE_29, DisablePollingB_29, Insert_Source_B_29, P_1119_29, P_2579_29],[DisablePollingE_30, DisablePollingB_30, Insert_Source_B_30, P_1119_30, P_2579_30],[DisablePollingE_31, DisablePollingB_31, Insert_Source_B_31, P_1119_31, P_2579_31],[DisablePollingE_32, DisablePollingB_32, Insert_Source_B_32, P_1119_32, P_2579_32],[DisablePollingE_33, DisablePollingB_33, Insert_Source_B_33, P_1119_33, P_2579_33],[DisablePollingE_34, DisablePollingB_34, Insert_Source_B_34, P_1119_34, P_2579_34],[DisablePollingE_35, DisablePollingB_35, Insert_Source_B_35, P_1119_35, P_2579_35],
at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:943)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 16:14:38] [INFO ] Flatten gal took : 174 ms
[2024-05-28 16:14:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15093178797889415290.gal : 40 ms
[2024-05-28 16:14:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6804594166923029219.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15093178797889415290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6804594166923029219.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-28 16:21:41] [INFO ] Flatten gal took : 151 ms
[2024-05-28 16:21:41] [INFO ] Input system was already deterministic with 2670 transitions.
[2024-05-28 16:21:41] [INFO ] Transformed 688 places.
[2024-05-28 16:21:41] [INFO ] Transformed 2670 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 16:22:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality13562131022662594292.gal : 30 ms
[2024-05-28 16:22:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14106309732820894191.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13562131022662594292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14106309732820894191.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2127198 ms.
BK_STOP 1716913749540
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-COL-S06J06T06, 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 r290-tajo-171654446600201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T06.tgz
mv PolyORBLF-COL-S06J06T06 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 '
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 ;