About the Execution of ITS-Tools for StigmergyElection-PT-08b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 1815354.00 | 0.00 | 0.00 | ?T????T????????? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100353.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-08b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12M 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 StigmergyElection-PT-08b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-08b-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717012515244
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 19:55:16] [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-29 19:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:55:17] [INFO ] Load time of PNML (sax parser for PT used): 667 ms
[2024-05-29 19:55:17] [INFO ] Transformed 1107 places.
[2024-05-29 19:55:17] [INFO ] Transformed 14564 transitions.
[2024-05-29 19:55:17] [INFO ] Found NUPN structural information;
[2024-05-29 19:55:17] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 873 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 108 out of 1107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 985 transition count 14442
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 985 transition count 14442
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 298 place count 931 transition count 14388
Iterating global reduction 0 with 54 rules applied. Total rules applied 352 place count 931 transition count 14388
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 362 place count 921 transition count 14378
Iterating global reduction 0 with 10 rules applied. Total rules applied 372 place count 921 transition count 14378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 376 place count 917 transition count 14374
Iterating global reduction 0 with 4 rules applied. Total rules applied 380 place count 917 transition count 14374
Applied a total of 380 rules in 1195 ms. Remains 917 /1107 variables (removed 190) and now considering 14374/14564 (removed 190) transitions.
// Phase 1: matrix 14374 rows 917 cols
[2024-05-29 19:55:19] [INFO ] Computed 9 invariants in 301 ms
[2024-05-29 19:55:23] [INFO ] Implicit Places using invariants in 4521 ms returned []
Implicit Place search using SMT only with invariants took 4603 ms to find 0 implicit places.
Running 14373 sub problems to find dead transitions.
[2024-05-29 19:55:23] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 916/15291 variables, and 0 constraints, problems are : Problem set: 0 solved, 14373 unsolved in 30242 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/917 constraints, PredecessorRefiner: 14373/1198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14373 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/15291 variables, and 0 constraints, problems are : Problem set: 0 solved, 14373 unsolved in 30149 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/917 constraints, PredecessorRefiner: 13175/1198 constraints, Known Traps: 0/0 constraints]
After SMT, in 257836ms problems are : Problem set: 0 solved, 14373 unsolved
Search for dead transitions found 0 dead transitions in 258056ms
Starting structural reductions in LTL mode, iteration 1 : 917/1107 places, 14374/14564 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263962 ms. Remains : 917/1107 places, 14374/14564 transitions.
Support contains 108 out of 917 places after structural reductions.
[2024-05-29 19:59:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 19:59:43] [INFO ] Flatten gal took : 1424 ms
FORMULA StigmergyElection-PT-08b-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:59:44] [INFO ] Flatten gal took : 1165 ms
[2024-05-29 19:59:46] [INFO ] Input system was already deterministic with 14374 transitions.
Support contains 89 out of 917 places (down from 108) after GAL structural reductions.
RANDOM walk for 40000 steps (287 resets) in 2592 ms. (15 steps per ms) remains 25/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
[2024-05-29 19:59:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 863/903 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 14/917 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/917 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15291/15291 variables, and 926 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 917/917 constraints, PredecessorRefiner: 25/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 863/903 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 19:59:59] [INFO ] Deduced a trap composed of 171 places in 6353 ms of which 43 ms to minimize.
SMT process timed out in 11773ms, After SMT, problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 917 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 917/917 places, 14374/14374 transitions.
Graph (trivial) has 866 edges and 917 vertex of which 91 / 917 are part of one of the 17 SCC in 7 ms
Free SCC test removed 74 places
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Graph (complete) has 2282 edges and 843 vertex of which 836 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.70 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 533 transitions
Trivial Post-agglo rules discarded 533 transitions
Performed 533 trivial Post agglomeration. Transition count delta: 533
Iterating post reduction 0 with 540 rules applied. Total rules applied 542 place count 836 transition count 13733
Reduce places removed 533 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 557 rules applied. Total rules applied 1099 place count 303 transition count 13709
Reduce places removed 12 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 28 rules applied. Total rules applied 1127 place count 291 transition count 13693
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1143 place count 275 transition count 13693
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 1143 place count 275 transition count 13658
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1213 place count 240 transition count 13658
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1222 place count 231 transition count 13649
Iterating global reduction 4 with 9 rules applied. Total rules applied 1231 place count 231 transition count 13649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1231 place count 231 transition count 13647
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1235 place count 229 transition count 13647
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1236 place count 228 transition count 13646
Iterating global reduction 4 with 1 rules applied. Total rules applied 1237 place count 228 transition count 13646
Performed 41 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 1319 place count 187 transition count 13604
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1323 place count 187 transition count 13600
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1342 place count 168 transition count 1226
Iterating global reduction 5 with 19 rules applied. Total rules applied 1361 place count 168 transition count 1226
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1375 place count 168 transition count 1212
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1395 place count 158 transition count 1202
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1409 place count 151 transition count 1212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1411 place count 151 transition count 1210
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 1422 place count 151 transition count 1199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1424 place count 150 transition count 1205
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1432 place count 150 transition count 1197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1434 place count 149 transition count 1203
Free-agglomeration rule applied 43 times.
Iterating global reduction 7 with 43 rules applied. Total rules applied 1477 place count 149 transition count 1160
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 1520 place count 106 transition count 1160
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1523 place count 103 transition count 1157
Iterating global reduction 8 with 3 rules applied. Total rules applied 1526 place count 103 transition count 1157
Drop transitions (Redundant composition of simpler transitions.) removed 129 transitions
Redundant transition composition rules discarded 129 transitions
Iterating global reduction 8 with 129 rules applied. Total rules applied 1655 place count 103 transition count 1028
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1657 place count 103 transition count 1028
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1658 place count 103 transition count 1027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1660 place count 102 transition count 1026
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1661 place count 102 transition count 1026
Applied a total of 1661 rules in 3840 ms. Remains 102 /917 variables (removed 815) and now considering 1026/14374 (removed 13348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3840 ms. Remains : 102/917 places, 1026/14374 transitions.
RANDOM walk for 40000 steps (2005 resets) in 1782 ms. (22 steps per ms) remains 1/25 properties
BEST_FIRST walk for 38181 steps (274 resets) in 107 ms. (353 steps per ms) remains 0/1 properties
[2024-05-29 20:00:05] [INFO ] Flatten gal took : 1062 ms
[2024-05-29 20:00:06] [INFO ] Flatten gal took : 1021 ms
[2024-05-29 20:00:08] [INFO ] Input system was already deterministic with 14374 transitions.
Computed a total of 125 stabilizing places and 133 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 917/917 places, 14374/14374 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 890 transition count 14347
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 890 transition count 14347
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 63 place count 881 transition count 14338
Iterating global reduction 0 with 9 rules applied. Total rules applied 72 place count 881 transition count 14338
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 877 transition count 14334
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 877 transition count 14334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 876 transition count 14333
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 876 transition count 14333
Applied a total of 82 rules in 560 ms. Remains 876 /917 variables (removed 41) and now considering 14333/14374 (removed 41) transitions.
// Phase 1: matrix 14333 rows 876 cols
[2024-05-29 20:00:09] [INFO ] Computed 9 invariants in 214 ms
[2024-05-29 20:00:13] [INFO ] Implicit Places using invariants in 4180 ms returned []
Implicit Place search using SMT only with invariants took 4183 ms to find 0 implicit places.
Running 14332 sub problems to find dead transitions.
[2024-05-29 20:00:13] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 875/15209 variables, and 0 constraints, problems are : Problem set: 0 solved, 14332 unsolved in 30189 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/876 constraints, PredecessorRefiner: 14332/1161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/15209 variables, and 0 constraints, problems are : Problem set: 0 solved, 14332 unsolved in 30146 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/876 constraints, PredecessorRefiner: 13171/1161 constraints, Known Traps: 0/0 constraints]
After SMT, in 264149ms problems are : Problem set: 0 solved, 14332 unsolved
Search for dead transitions found 0 dead transitions in 264355ms
Starting structural reductions in LTL mode, iteration 1 : 876/917 places, 14333/14374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269140 ms. Remains : 876/917 places, 14333/14374 transitions.
[2024-05-29 20:04:39] [INFO ] Flatten gal took : 985 ms
[2024-05-29 20:04:40] [INFO ] Flatten gal took : 1036 ms
[2024-05-29 20:04:42] [INFO ] Input system was already deterministic with 14333 transitions.
[2024-05-29 20:04:43] [INFO ] Flatten gal took : 1038 ms
[2024-05-29 20:04:44] [INFO ] Flatten gal took : 1055 ms
[2024-05-29 20:04:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality11478206073314383763.gal : 225 ms
[2024-05-29 20:04:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17943231133804971532.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/CTLCardinality11478206073314383763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17943231133804971532.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 20:05:16] [INFO ] Flatten gal took : 1136 ms
[2024-05-29 20:05:16] [INFO ] Applying decomposition
[2024-05-29 20:05:17] [INFO ] Flatten gal took : 1010 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/graph9098000187100687890.txt' '-o' '/tmp/graph9098000187100687890.bin' '-w' '/tmp/graph9098000187100687890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9098000187100687890.bin' '-l' '-1' '-v' '-w' '/tmp/graph9098000187100687890.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:05:20] [INFO ] Decomposing Gal with order
[2024-05-29 20:05:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:05:24] [INFO ] Removed a total of 107144 redundant transitions.
[2024-05-29 20:05:24] [INFO ] Flatten gal took : 2484 ms
[2024-05-29 20:05:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 1133 ms.
[2024-05-29 20:05:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2426185923752857867.gal : 102 ms
[2024-05-29 20:05:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18393223773987966854.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/CTLCardinality2426185923752857867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18393223773987966854.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 -...263
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 : 917/917 places, 14374/14374 transitions.
Graph (trivial) has 922 edges and 917 vertex of which 138 / 917 are part of one of the 24 SCC in 2 ms
Free SCC test removed 114 places
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 545 place count 802 transition count 13700
Reduce places removed 544 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 560 rules applied. Total rules applied 1105 place count 258 transition count 13684
Reduce places removed 8 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 13 rules applied. Total rules applied 1118 place count 250 transition count 13679
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1123 place count 245 transition count 13679
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 1123 place count 245 transition count 13652
Deduced a syphon composed of 27 places in 7 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1177 place count 218 transition count 13652
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1197 place count 198 transition count 13630
Iterating global reduction 4 with 20 rules applied. Total rules applied 1217 place count 198 transition count 13630
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 1219 place count 198 transition count 13628
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1221 place count 196 transition count 13628
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 1221 place count 196 transition count 13624
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1229 place count 192 transition count 13624
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1232 place count 189 transition count 11434
Iterating global reduction 6 with 3 rules applied. Total rules applied 1235 place count 189 transition count 11434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1236 place count 189 transition count 11433
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1237 place count 188 transition count 11431
Iterating global reduction 7 with 1 rules applied. Total rules applied 1238 place count 188 transition count 11431
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 1298 place count 158 transition count 11401
Discarding 26 places :
Symmetric choice reduction at 7 with 26 rule applications. Total rules 1324 place count 132 transition count 961
Iterating global reduction 7 with 26 rules applied. Total rules applied 1350 place count 132 transition count 961
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1365 place count 132 transition count 946
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1370 place count 127 transition count 936
Iterating global reduction 8 with 5 rules applied. Total rules applied 1375 place count 127 transition count 936
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1378 place count 124 transition count 930
Iterating global reduction 8 with 3 rules applied. Total rules applied 1381 place count 124 transition count 930
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1383 place count 123 transition count 929
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1384 place count 122 transition count 918
Iterating global reduction 8 with 1 rules applied. Total rules applied 1385 place count 122 transition count 918
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1386 place count 122 transition count 917
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 1396 place count 122 transition count 907
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1414 place count 113 transition count 898
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1415 place count 112 transition count 897
Applied a total of 1415 rules in 2062 ms. Remains 112 /917 variables (removed 805) and now considering 897/14374 (removed 13477) transitions.
[2024-05-29 20:05:58] [INFO ] Flow matrix only has 887 transitions (discarded 10 similar events)
// Phase 1: matrix 887 rows 112 cols
[2024-05-29 20:05:58] [INFO ] Computed 2 invariants in 20 ms
[2024-05-29 20:05:58] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-29 20:05:58] [INFO ] Flow matrix only has 887 transitions (discarded 10 similar events)
[2024-05-29 20:05:58] [INFO ] Invariant cache hit.
[2024-05-29 20:05:58] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-29 20:05:59] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2024-05-29 20:05:59] [INFO ] Redundant transitions in 49 ms returned []
Running 881 sub problems to find dead transitions.
[2024-05-29 20:05:59] [INFO ] Flow matrix only has 887 transitions (discarded 10 similar events)
[2024-05-29 20:05:59] [INFO ] Invariant cache hit.
[2024-05-29 20:05:59] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 2 (OVERLAPS) 8/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:11] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 2 ms to minimize.
[2024-05-29 20:06:12] [INFO ] Deduced a trap composed of 18 places in 325 ms of which 1 ms to minimize.
[2024-05-29 20:06:12] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 1 ms to minimize.
[2024-05-29 20:06:13] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 4 ms to minimize.
[2024-05-29 20:06:13] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 1 ms to minimize.
[2024-05-29 20:06:13] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:06:13] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 1 ms to minimize.
[2024-05-29 20:06:14] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:06:14] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2024-05-29 20:06:14] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:06:14] [INFO ] Deduced a trap composed of 30 places in 238 ms of which 0 ms to minimize.
[2024-05-29 20:06:15] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:06:15] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:06:15] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:06:16] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:06:16] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:06:16] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2024-05-29 20:06:16] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:06:17] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:06:17] [INFO ] Deduced a trap composed of 17 places in 235 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:19] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2024-05-29 20:06:19] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:06:20] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 1 ms to minimize.
[2024-05-29 20:06:20] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:06:20] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 0 ms to minimize.
[2024-05-29 20:06:21] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 0 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:06:22] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 3 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:06:23] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 0 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 20 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:06:24] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:06:25] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:26] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 0 ms to minimize.
[2024-05-29 20:06:26] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:06:27] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:06:27] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:06:27] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:06:28] [INFO ] Deduced a trap composed of 28 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:06:28] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 1 ms to minimize.
[2024-05-29 20:06:28] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:06:29] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 0 ms to minimize.
[2024-05-29 20:06:32] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:06:32] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:06:33] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 0 ms to minimize.
[2024-05-29 20:06:33] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 1 ms to minimize.
[2024-05-29 20:06:33] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:06:34] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:06:34] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 0 ms to minimize.
[2024-05-29 20:06:34] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:35] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:06:35] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:06:35] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 112/999 variables, and 62 constraints, problems are : Problem set: 0 solved, 881 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/112 constraints, ReadFeed: 0/255 constraints, PredecessorRefiner: 881/881 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 881 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 2 (OVERLAPS) 8/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:40] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 2 ms to minimize.
[2024-05-29 20:06:40] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 1 ms to minimize.
[2024-05-29 20:06:40] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:06:41] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 0 ms to minimize.
[2024-05-29 20:06:41] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 0 ms to minimize.
[2024-05-29 20:06:41] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:06:41] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 0 ms to minimize.
[2024-05-29 20:06:42] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:06:42] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 0 ms to minimize.
[2024-05-29 20:06:42] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 0 ms to minimize.
[2024-05-29 20:06:43] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:06:43] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 0 ms to minimize.
[2024-05-29 20:06:43] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:06:44] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:06:44] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:06:44] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:06:45] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:06:48] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 1 ms to minimize.
[2024-05-29 20:06:49] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:06:49] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:50] [INFO ] Deduced a trap composed of 26 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:06:50] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 881 unsolved
[2024-05-29 20:06:55] [INFO ] Deduced a trap composed of 18 places in 289 ms of which 0 ms to minimize.
[2024-05-29 20:06:55] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:06:55] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 8 (OVERLAPS) 886/998 variables, 112/199 constraints. Problems are: Problem set: 0 solved, 881 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/998 variables, 254/453 constraints. Problems are: Problem set: 0 solved, 881 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 998/999 variables, and 1334 constraints, problems are : Problem set: 0 solved, 881 unsolved in 32801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 254/255 constraints, PredecessorRefiner: 881/881 constraints, Known Traps: 85/85 constraints]
After SMT, in 70482ms problems are : Problem set: 0 solved, 881 unsolved
Search for dead transitions found 0 dead transitions in 70490ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/917 places, 897/14374 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73747 ms. Remains : 112/917 places, 897/14374 transitions.
[2024-05-29 20:07:09] [INFO ] Flatten gal took : 83 ms
[2024-05-29 20:07:09] [INFO ] Flatten gal took : 83 ms
[2024-05-29 20:07:10] [INFO ] Input system was already deterministic with 897 transitions.
[2024-05-29 20:07:10] [INFO ] Flatten gal took : 81 ms
[2024-05-29 20:07:10] [INFO ] Flatten gal took : 77 ms
[2024-05-29 20:07:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality11221542403035573435.gal : 10 ms
[2024-05-29 20:07:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16609070576128286610.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/CTLCardinality11221542403035573435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16609070576128286610.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 -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 20:07:40] [INFO ] Flatten gal took : 77 ms
[2024-05-29 20:07:40] [INFO ] Applying decomposition
[2024-05-29 20:07:40] [INFO ] Flatten gal took : 78 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/graph7678343485149697959.txt' '-o' '/tmp/graph7678343485149697959.bin' '-w' '/tmp/graph7678343485149697959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7678343485149697959.bin' '-l' '-1' '-v' '-w' '/tmp/graph7678343485149697959.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:07:40] [INFO ] Decomposing Gal with order
[2024-05-29 20:07:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:07:40] [INFO ] Removed a total of 6153 redundant transitions.
[2024-05-29 20:07:40] [INFO ] Flatten gal took : 91 ms
[2024-05-29 20:07:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 17 ms.
[2024-05-29 20:07:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality538441335054140805.gal : 3 ms
[2024-05-29 20:07:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality6680167559153339627.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/CTLCardinality538441335054140805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6680167559153339627.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 917/917 places, 14374/14374 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 891 transition count 14348
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 891 transition count 14348
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 882 transition count 14339
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 882 transition count 14339
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 877 transition count 14334
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 877 transition count 14334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 876 transition count 14333
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 876 transition count 14333
Applied a total of 82 rules in 502 ms. Remains 876 /917 variables (removed 41) and now considering 14333/14374 (removed 41) transitions.
// Phase 1: matrix 14333 rows 876 cols
[2024-05-29 20:08:11] [INFO ] Computed 9 invariants in 231 ms
[2024-05-29 20:08:15] [INFO ] Implicit Places using invariants in 4284 ms returned []
Implicit Place search using SMT only with invariants took 4285 ms to find 0 implicit places.
Running 14332 sub problems to find dead transitions.
[2024-05-29 20:08:15] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 875/15209 variables, and 0 constraints, problems are : Problem set: 0 solved, 14332 unsolved in 30171 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/876 constraints, PredecessorRefiner: 14332/1162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 875/15209 variables, and 0 constraints, problems are : Problem set: 0 solved, 14332 unsolved in 30144 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/876 constraints, PredecessorRefiner: 13170/1162 constraints, Known Traps: 0/0 constraints]
After SMT, in 294623ms problems are : Problem set: 0 solved, 14332 unsolved
Search for dead transitions found 0 dead transitions in 294792ms
Starting structural reductions in LTL mode, iteration 1 : 876/917 places, 14333/14374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299616 ms. Remains : 876/917 places, 14333/14374 transitions.
[2024-05-29 20:13:11] [INFO ] Flatten gal took : 1078 ms
[2024-05-29 20:13:12] [INFO ] Flatten gal took : 1142 ms
[2024-05-29 20:13:15] [INFO ] Input system was already deterministic with 14333 transitions.
[2024-05-29 20:13:17] [INFO ] Flatten gal took : 1125 ms
[2024-05-29 20:13:18] [INFO ] Flatten gal took : 1124 ms
[2024-05-29 20:13:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16244503230352498764.gal : 197 ms
[2024-05-29 20:13:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality6393291740920137427.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/CTLCardinality16244503230352498764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6393291740920137427.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-29 20:13:49] [INFO ] Flatten gal took : 1060 ms
[2024-05-29 20:13:49] [INFO ] Applying decomposition
[2024-05-29 20:13:50] [INFO ] Flatten gal took : 1064 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/graph14067040077076704584.txt' '-o' '/tmp/graph14067040077076704584.bin' '-w' '/tmp/graph14067040077076704584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14067040077076704584.bin' '-l' '-1' '-v' '-w' '/tmp/graph14067040077076704584.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:13:54] [INFO ] Decomposing Gal with order
[2024-05-29 20:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:13:57] [INFO ] Removed a total of 107152 redundant transitions.
[2024-05-29 20:13:57] [INFO ] Flatten gal took : 1706 ms
[2024-05-29 20:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 772 ms.
[2024-05-29 20:13:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality12249180186736420172.gal : 85 ms
[2024-05-29 20:13:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality16604216596298777514.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/CTLCardinality12249180186736420172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16604216596298777514.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 : 917/917 places, 14374/14374 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 888 transition count 14345
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 888 transition count 14345
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 879 transition count 14336
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 879 transition count 14336
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 874 transition count 14331
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 874 transition count 14331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 873 transition count 14330
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 873 transition count 14330
Applied a total of 88 rules in 586 ms. Remains 873 /917 variables (removed 44) and now considering 14330/14374 (removed 44) transitions.
// Phase 1: matrix 14330 rows 873 cols
[2024-05-29 20:14:29] [INFO ] Computed 9 invariants in 221 ms
[2024-05-29 20:14:33] [INFO ] Implicit Places using invariants in 4250 ms returned []
Implicit Place search using SMT only with invariants took 4252 ms to find 0 implicit places.
Running 14329 sub problems to find dead transitions.
[2024-05-29 20:14:33] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 872/15203 variables, and 0 constraints, problems are : Problem set: 0 solved, 14329 unsolved in 30397 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 14329/1159 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14329 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 872/15203 variables, and 0 constraints, problems are : Problem set: 0 solved, 14329 unsolved in 30155 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/873 constraints, PredecessorRefiner: 13170/1159 constraints, Known Traps: 0/0 constraints]
After SMT, in 274433ms problems are : Problem set: 0 solved, 14329 unsolved
Search for dead transitions found 0 dead transitions in 274600ms
Starting structural reductions in LTL mode, iteration 1 : 873/917 places, 14330/14374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279484 ms. Remains : 873/917 places, 14330/14374 transitions.
[2024-05-29 20:19:09] [INFO ] Flatten gal took : 1070 ms
[2024-05-29 20:19:10] [INFO ] Flatten gal took : 1142 ms
[2024-05-29 20:19:13] [INFO ] Input system was already deterministic with 14330 transitions.
[2024-05-29 20:19:14] [INFO ] Flatten gal took : 1244 ms
[2024-05-29 20:19:15] [INFO ] Flatten gal took : 1106 ms
[2024-05-29 20:19:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2949076374753088654.gal : 202 ms
[2024-05-29 20:19:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality8113076340764234790.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/CTLCardinality2949076374753088654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8113076340764234790.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 20:19:47] [INFO ] Flatten gal took : 1128 ms
[2024-05-29 20:19:47] [INFO ] Applying decomposition
[2024-05-29 20:19:48] [INFO ] Flatten gal took : 1121 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/graph12573193693222863599.txt' '-o' '/tmp/graph12573193693222863599.bin' '-w' '/tmp/graph12573193693222863599.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12573193693222863599.bin' '-l' '-1' '-v' '-w' '/tmp/graph12573193693222863599.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:19:54] [INFO ] Decomposing Gal with order
[2024-05-29 20:19:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:19:58] [INFO ] Removed a total of 107150 redundant transitions.
[2024-05-29 20:19:58] [INFO ] Flatten gal took : 2562 ms
[2024-05-29 20:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 726 ms.
[2024-05-29 20:19:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15661026014763026570.gal : 116 ms
[2024-05-29 20:19:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality16548609652014233178.ctl : 9 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/CTLCardinality15661026014763026570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16548609652014233178.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 : 917/917 places, 14374/14374 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 891 transition count 14348
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 891 transition count 14348
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 883 transition count 14340
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 883 transition count 14340
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 878 transition count 14335
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 878 transition count 14335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 877 transition count 14334
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 877 transition count 14334
Applied a total of 80 rules in 989 ms. Remains 877 /917 variables (removed 40) and now considering 14334/14374 (removed 40) transitions.
// Phase 1: matrix 14334 rows 877 cols
[2024-05-29 20:20:31] [INFO ] Computed 9 invariants in 398 ms
[2024-05-29 20:20:37] [INFO ] Implicit Places using invariants in 6715 ms returned []
Implicit Place search using SMT only with invariants took 6724 ms to find 0 implicit places.
Running 14333 sub problems to find dead transitions.
[2024-05-29 20:20:38] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 876/15211 variables, and 0 constraints, problems are : Problem set: 0 solved, 14333 unsolved in 30150 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/877 constraints, PredecessorRefiner: 14333/1161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 876/15211 variables, and 0 constraints, problems are : Problem set: 0 solved, 14333 unsolved in 30393 ms.
Refiners :[Positive P Invariants (semi-flows): 0/9 constraints, State Equation: 0/877 constraints, PredecessorRefiner: 13172/1161 constraints, Known Traps: 0/0 constraints]
After SMT, in 282354ms problems are : Problem set: 0 solved, 14333 unsolved
Search for dead transitions found 0 dead transitions in 282526ms
Starting structural reductions in LTL mode, iteration 1 : 877/917 places, 14334/14374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290304 ms. Remains : 877/917 places, 14334/14374 transitions.
[2024-05-29 20:25:21] [INFO ] Flatten gal took : 1075 ms
[2024-05-29 20:25:22] [INFO ] Flatten gal took : 1150 ms
[2024-05-29 20:25:24] [INFO ] Input system was already deterministic with 14334 transitions.
[2024-05-29 20:25:26] [INFO ] Flatten gal took : 1028 ms
[2024-05-29 20:25:27] [INFO ] Flatten gal took : 1042 ms
[2024-05-29 20:25:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality6690999934466937148.gal : 192 ms
[2024-05-29 20:25:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality13158974986773858487.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/CTLCardinality6690999934466937148.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13158974986773858487.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
BK_STOP 1717014330598
--------------------
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="StigmergyElection-PT-08b"
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 StigmergyElection-PT-08b, 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 r400-tall-171690532100353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08b.tgz
mv StigmergyElection-PT-08b 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 ;