fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r400-tall-171690531700146
Last Updated
July 7, 2024

About the Execution of ITS-Tools for StigmergyCommit-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 399968.00 0.00 0.00 [undef] Cannot compute

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690531700146.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 StigmergyCommit-PT-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690531700146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 1.4M 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 StigmergyCommit-PT-05b-CTLFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-05b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716987530169

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 12:58:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:58:51] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-05-29 12:58:51] [INFO ] Transformed 1837 places.
[2024-05-29 12:58:51] [INFO ] Transformed 3460 transitions.
[2024-05-29 12:58:51] [INFO ] Found NUPN structural information;
[2024-05-29 12:58:51] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 115 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 143 place count 1694 transition count 3317
Iterating global reduction 0 with 143 rules applied. Total rules applied 286 place count 1694 transition count 3317
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 375 place count 1605 transition count 3228
Iterating global reduction 0 with 89 rules applied. Total rules applied 464 place count 1605 transition count 3228
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 515 place count 1554 transition count 3177
Iterating global reduction 0 with 51 rules applied. Total rules applied 566 place count 1554 transition count 3177
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 607 place count 1513 transition count 3136
Iterating global reduction 0 with 41 rules applied. Total rules applied 648 place count 1513 transition count 3136
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 682 place count 1479 transition count 3102
Iterating global reduction 0 with 34 rules applied. Total rules applied 716 place count 1479 transition count 3102
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 749 place count 1446 transition count 3069
Iterating global reduction 0 with 33 rules applied. Total rules applied 782 place count 1446 transition count 3069
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 813 place count 1415 transition count 3038
Iterating global reduction 0 with 31 rules applied. Total rules applied 844 place count 1415 transition count 3038
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 874 place count 1385 transition count 3008
Iterating global reduction 0 with 30 rules applied. Total rules applied 904 place count 1385 transition count 3008
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 929 place count 1360 transition count 2983
Iterating global reduction 0 with 25 rules applied. Total rules applied 954 place count 1360 transition count 2983
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 973 place count 1341 transition count 2964
Iterating global reduction 0 with 19 rules applied. Total rules applied 992 place count 1341 transition count 2964
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 994 place count 1341 transition count 2962
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1002 place count 1333 transition count 2954
Iterating global reduction 1 with 8 rules applied. Total rules applied 1010 place count 1333 transition count 2954
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 1018 place count 1325 transition count 2946
Iterating global reduction 1 with 8 rules applied. Total rules applied 1026 place count 1325 transition count 2946
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1029 place count 1322 transition count 2943
Iterating global reduction 1 with 3 rules applied. Total rules applied 1032 place count 1322 transition count 2943
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1035 place count 1319 transition count 2940
Iterating global reduction 1 with 3 rules applied. Total rules applied 1038 place count 1319 transition count 2940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1039 place count 1318 transition count 2939
Iterating global reduction 1 with 1 rules applied. Total rules applied 1040 place count 1318 transition count 2939
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1041 place count 1317 transition count 2938
Iterating global reduction 1 with 1 rules applied. Total rules applied 1042 place count 1317 transition count 2938
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 1043 place count 1316 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 1044 place count 1316 transition count 2937
Applied a total of 1044 rules in 1446 ms. Remains 1316 /1837 variables (removed 521) and now considering 2937/3460 (removed 523) transitions.
// Phase 1: matrix 2937 rows 1316 cols
[2024-05-29 12:58:53] [INFO ] Computed 7 invariants in 59 ms
[2024-05-29 12:58:53] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-05-29 12:58:53] [INFO ] Invariant cache hit.
[2024-05-29 12:58:54] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Running 2936 sub problems to find dead transitions.
[2024-05-29 12:58:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1315/4253 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1316 constraints, PredecessorRefiner: 2936/2936 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2936 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1315/4253 variables, and 0 constraints, problems are : Problem set: 0 solved, 2936 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1316 constraints, PredecessorRefiner: 0/2936 constraints, Known Traps: 0/0 constraints]
After SMT, in 80232ms problems are : Problem set: 0 solved, 2936 unsolved
Search for dead transitions found 0 dead transitions in 80286ms
Starting structural reductions in LTL mode, iteration 1 : 1316/1837 places, 2937/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83316 ms. Remains : 1316/1837 places, 2937/3460 transitions.
Support contains 115 out of 1316 places after structural reductions.
[2024-05-29 13:00:15] [INFO ] Flatten gal took : 292 ms
[2024-05-29 13:00:15] [INFO ] Flatten gal took : 177 ms
[2024-05-29 13:00:16] [INFO ] Input system was already deterministic with 2937 transitions.
Support contains 110 out of 1316 places (down from 115) after GAL structural reductions.
RANDOM walk for 40000 steps (355 resets) in 2155 ms. (18 steps per ms) remains 75/87 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
[2024-05-29 13:00:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 1 (OVERLAPS) 1219/1316 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 69 unsolved
[2024-05-29 13:00:19] [INFO ] Deduced a trap composed of 322 places in 639 ms of which 45 ms to minimize.
Problem AtomicPropp18 is UNSAT
[2024-05-29 13:00:20] [INFO ] Deduced a trap composed of 311 places in 615 ms of which 5 ms to minimize.
[2024-05-29 13:00:21] [INFO ] Deduced a trap composed of 312 places in 556 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1316/4253 variables, and 10 constraints, problems are : Problem set: 7 solved, 68 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/1316 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 7 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1229/1316 variables, 7/7 constraints. Problems are: Problem set: 7 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1316 variables, 3/10 constraints. Problems are: Problem set: 7 solved, 68 unsolved
[2024-05-29 13:00:24] [INFO ] Deduced a trap composed of 320 places in 665 ms of which 6 ms to minimize.
[2024-05-29 13:00:24] [INFO ] Deduced a trap composed of 318 places in 696 ms of which 5 ms to minimize.
[2024-05-29 13:00:25] [INFO ] Deduced a trap composed of 327 places in 579 ms of which 5 ms to minimize.
Problem AtomicPropp2 is UNSAT
[2024-05-29 13:00:27] [INFO ] Deduced a trap composed of 324 places in 609 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1316/4253 variables, and 14 constraints, problems are : Problem set: 8 solved, 67 unsolved in 5030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/1316 constraints, PredecessorRefiner: 0/75 constraints, Known Traps: 7/7 constraints]
After SMT, in 10625ms problems are : Problem set: 8 solved, 67 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 1316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1316/1316 places, 2937/2937 transitions.
Graph (trivial) has 1151 edges and 1316 vertex of which 82 / 1316 are part of one of the 14 SCC in 8 ms
Free SCC test removed 68 places
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 2220 edges and 1248 vertex of which 1244 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 795 transitions
Trivial Post-agglo rules discarded 795 transitions
Performed 795 trivial Post agglomeration. Transition count delta: 795
Iterating post reduction 0 with 798 rules applied. Total rules applied 800 place count 1244 transition count 2047
Reduce places removed 795 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 807 rules applied. Total rules applied 1607 place count 449 transition count 2035
Reduce places removed 5 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 56 rules applied. Total rules applied 1663 place count 444 transition count 1984
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 56 rules applied. Total rules applied 1719 place count 393 transition count 1979
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1721 place count 391 transition count 1979
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 73 Pre rules applied. Total rules applied 1721 place count 391 transition count 1906
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 1867 place count 318 transition count 1906
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1871 place count 314 transition count 1902
Iterating global reduction 5 with 4 rules applied. Total rules applied 1875 place count 314 transition count 1902
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1879 place count 310 transition count 1898
Iterating global reduction 5 with 4 rules applied. Total rules applied 1883 place count 310 transition count 1898
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1885 place count 310 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1886 place count 309 transition count 1895
Iterating global reduction 6 with 1 rules applied. Total rules applied 1887 place count 309 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1888 place count 308 transition count 1894
Iterating global reduction 6 with 1 rules applied. Total rules applied 1889 place count 308 transition count 1894
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1890 place count 308 transition count 1893
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 7 with 86 rules applied. Total rules applied 1976 place count 265 transition count 1850
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1985 place count 265 transition count 1841
Discarding 17 places :
Symmetric choice reduction at 8 with 17 rule applications. Total rules 2002 place count 248 transition count 1813
Iterating global reduction 8 with 17 rules applied. Total rules applied 2019 place count 248 transition count 1813
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2022 place count 248 transition count 1810
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 2032 place count 238 transition count 1800
Iterating global reduction 9 with 10 rules applied. Total rules applied 2042 place count 238 transition count 1800
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 2048 place count 232 transition count 1794
Iterating global reduction 9 with 6 rules applied. Total rules applied 2054 place count 232 transition count 1794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2056 place count 232 transition count 1792
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 14 rules applied. Total rules applied 2070 place count 225 transition count 1785
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2076 place count 222 transition count 1795
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 2080 place count 222 transition count 1791
Free-agglomeration rule applied 23 times.
Iterating global reduction 10 with 23 rules applied. Total rules applied 2103 place count 222 transition count 1768
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 2126 place count 199 transition count 1768
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 2132 place count 193 transition count 1762
Iterating global reduction 11 with 6 rules applied. Total rules applied 2138 place count 193 transition count 1762
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 2140 place count 193 transition count 1760
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 11 with 11 rules applied. Total rules applied 2151 place count 193 transition count 1760
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2152 place count 193 transition count 1759
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2153 place count 193 transition count 1759
Applied a total of 2153 rules in 799 ms. Remains 193 /1316 variables (removed 1123) and now considering 1759/2937 (removed 1178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 799 ms. Remains : 193/1316 places, 1759/2937 transitions.
RANDOM walk for 40000 steps (1214 resets) in 852 ms. (46 steps per ms) remains 57/67 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (14 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (15 resets) in 13 ms. (285 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (13 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (14 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 25 ms. (154 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (15 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (14 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (16 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (14 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 54/54 properties
// Phase 1: matrix 1759 rows 193 cols
[2024-05-29 13:00:29] [INFO ] Computed 6 invariants in 17 ms
[2024-05-29 13:00:29] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 108/171 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/172 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 1741/1913 variables, 172/178 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1913 variables, 90/268 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 34/1947 variables, 17/285 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1947 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1947 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 5/1952 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1952 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 0/1952 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 296 constraints, problems are : Problem set: 0 solved, 54 unsolved in 7848 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 193/193 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 108/171 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/172 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-29 13:00:39] [INFO ] Deduced a trap composed of 50 places in 368 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1741/1913 variables, 172/179 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1913 variables, 90/269 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1913 variables, 16/285 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1913 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 34/1947 variables, 17/302 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1947 variables, 7/309 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1947 variables, 38/347 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1947 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 5/1952 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 351 constraints, problems are : Problem set: 0 solved, 54 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 193/193 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 1/1 constraints]
After SMT, in 53323ms problems are : Problem set: 0 solved, 54 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 1759/1759 transitions.
Graph (trivial) has 75 edges and 193 vertex of which 2 / 193 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 192 transition count 1747
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 182 transition count 1745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 181 transition count 1745
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 181 transition count 1742
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 178 transition count 1742
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 176 transition count 1740
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 176 transition count 1740
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 175 transition count 1739
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 175 transition count 1739
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 58 place count 164 transition count 1728
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 164 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 67 place count 157 transition count 1719
Iterating global reduction 4 with 7 rules applied. Total rules applied 74 place count 157 transition count 1719
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 77 place count 154 transition count 1716
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 154 transition count 1716
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 86 place count 154 transition count 1710
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 88 place count 152 transition count 1708
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 152 transition count 1708
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 95 place count 152 transition count 1703
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 6 with 2 rules applied. Total rules applied 97 place count 151 transition count 1709
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 100 place count 151 transition count 1706
Free-agglomeration rule applied 34 times.
Iterating global reduction 6 with 34 rules applied. Total rules applied 134 place count 151 transition count 1672
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 168 place count 117 transition count 1672
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 7 with 56 rules applied. Total rules applied 224 place count 117 transition count 1616
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 117 transition count 1616
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 226 place count 117 transition count 1615
Applied a total of 226 rules in 491 ms. Remains 117 /193 variables (removed 76) and now considering 1615/1759 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 117/193 places, 1615/1759 transitions.
RANDOM walk for 40000 steps (1799 resets) in 613 ms. (65 steps per ms) remains 38/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4003 steps (18 resets) in 11 ms. (333 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (19 resets) in 10 ms. (363 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (15 resets) in 10 ms. (363 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (23 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (19 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (21 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (22 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 24/25 properties
BEST_FIRST walk for 4004 steps (23 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (18 resets) in 8 ms. (444 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (21 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (17 resets) in 8 ms. (444 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 8 ms. (444 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (23 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (17 resets) in 8 ms. (444 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 6 ms. (572 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (18 resets) in 8 ms. (444 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 10/10 properties
// Phase 1: matrix 1615 rows 117 cols
[2024-05-29 13:01:23] [INFO ] Computed 6 invariants in 25 ms
[2024-05-29 13:01:23] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 79/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1596/1697 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1697 variables, 35/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1697 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 28/1725 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1725 variables, 4/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1725 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 7/1732 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1732 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/1732 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1732/1732 variables, and 164 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1194 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 79/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1596/1697 variables, 101/107 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1697 variables, 35/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1697 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1697 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 28/1725 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1725 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1725 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 7/1732 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1732 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1732 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1732 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1732/1732 variables, and 174 constraints, problems are : Problem set: 0 solved, 10 unsolved in 6990 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 8256ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 4349 steps, including 288 resets, run visited all 1 properties in 22 ms. (steps per millisecond=197 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 182 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2024-05-29 13:01:32] [INFO ] Flatten gal took : 137 ms
[2024-05-29 13:01:32] [INFO ] Flatten gal took : 146 ms
[2024-05-29 13:01:32] [INFO ] Input system was already deterministic with 2937 transitions.
Support contains 95 out of 1316 places (down from 96) after GAL structural reductions.
Computed a total of 260 stabilizing places and 272 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1316/1316 places, 2937/2937 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1292 transition count 2913
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1292 transition count 2913
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1275 transition count 2896
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1275 transition count 2896
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 97 place count 1260 transition count 2881
Iterating global reduction 0 with 15 rules applied. Total rules applied 112 place count 1260 transition count 2881
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 126 place count 1246 transition count 2867
Iterating global reduction 0 with 14 rules applied. Total rules applied 140 place count 1246 transition count 2867
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 154 place count 1232 transition count 2853
Iterating global reduction 0 with 14 rules applied. Total rules applied 168 place count 1232 transition count 2853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 169 place count 1232 transition count 2852
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 181 place count 1220 transition count 2840
Iterating global reduction 1 with 12 rules applied. Total rules applied 193 place count 1220 transition count 2840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 194 place count 1220 transition count 2839
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 1210 transition count 2829
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 1210 transition count 2829
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 216 place count 1210 transition count 2827
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 223 place count 1203 transition count 2820
Iterating global reduction 3 with 7 rules applied. Total rules applied 230 place count 1203 transition count 2820
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 233 place count 1203 transition count 2817
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 237 place count 1199 transition count 2813
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 1199 transition count 2813
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 245 place count 1195 transition count 2809
Iterating global reduction 4 with 4 rules applied. Total rules applied 249 place count 1195 transition count 2809
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 252 place count 1192 transition count 2806
Iterating global reduction 4 with 3 rules applied. Total rules applied 255 place count 1192 transition count 2806
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 258 place count 1189 transition count 2803
Iterating global reduction 4 with 3 rules applied. Total rules applied 261 place count 1189 transition count 2803
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 1186 transition count 2800
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 1186 transition count 2800
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 1183 transition count 2797
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 1183 transition count 2797
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 275 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 276 place count 1182 transition count 2794
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 278 place count 1181 transition count 2793
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1180 transition count 2792
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1179 transition count 2791
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 1178 transition count 2790
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 1178 transition count 2789
Applied a total of 286 rules in 982 ms. Remains 1178 /1316 variables (removed 138) and now considering 2789/2937 (removed 148) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-05-29 13:01:33] [INFO ] Computed 7 invariants in 40 ms
[2024-05-29 13:01:34] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-29 13:01:34] [INFO ] Invariant cache hit.
[2024-05-29 13:01:35] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1990 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:01:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 80919ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 80944ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1316 places, 2789/2937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83931 ms. Remains : 1178/1316 places, 2789/2937 transitions.
[2024-05-29 13:02:56] [INFO ] Flatten gal took : 101 ms
[2024-05-29 13:02:56] [INFO ] Flatten gal took : 108 ms
[2024-05-29 13:02:57] [INFO ] Input system was already deterministic with 2789 transitions.
[2024-05-29 13:02:57] [INFO ] Flatten gal took : 105 ms
[2024-05-29 13:02:57] [INFO ] Flatten gal took : 107 ms
[2024-05-29 13:02:57] [INFO ] Time to serialize gal into /tmp/CTLFireability18434957377975374293.gal : 83 ms
[2024-05-29 13:02:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14817501176909530646.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/CTLFireability18434957377975374293.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14817501176909530646.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 13:03:27] [INFO ] Flatten gal took : 105 ms
[2024-05-29 13:03:27] [INFO ] Applying decomposition
[2024-05-29 13:03:27] [INFO ] Flatten gal took : 106 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/graph10198958320719211397.txt' '-o' '/tmp/graph10198958320719211397.bin' '-w' '/tmp/graph10198958320719211397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10198958320719211397.bin' '-l' '-1' '-v' '-w' '/tmp/graph10198958320719211397.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:03:28] [INFO ] Decomposing Gal with order
[2024-05-29 13:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:03:28] [INFO ] Removed a total of 9310 redundant transitions.
[2024-05-29 13:03:29] [INFO ] Flatten gal took : 375 ms
[2024-05-29 13:03:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 98 ms.
[2024-05-29 13:03:29] [INFO ] Time to serialize gal into /tmp/CTLFireability402801778274376404.gal : 34 ms
[2024-05-29 13:03:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8157696754148636396.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/CTLFireability402801778274376404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8157696754148636396.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 : 1316/1316 places, 2937/2937 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1292 transition count 2913
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1292 transition count 2913
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1275 transition count 2896
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1275 transition count 2896
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 97 place count 1260 transition count 2881
Iterating global reduction 0 with 15 rules applied. Total rules applied 112 place count 1260 transition count 2881
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 126 place count 1246 transition count 2867
Iterating global reduction 0 with 14 rules applied. Total rules applied 140 place count 1246 transition count 2867
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 154 place count 1232 transition count 2853
Iterating global reduction 0 with 14 rules applied. Total rules applied 168 place count 1232 transition count 2853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 169 place count 1232 transition count 2852
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 181 place count 1220 transition count 2840
Iterating global reduction 1 with 12 rules applied. Total rules applied 193 place count 1220 transition count 2840
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 194 place count 1220 transition count 2839
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 204 place count 1210 transition count 2829
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 1210 transition count 2829
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 216 place count 1210 transition count 2827
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 223 place count 1203 transition count 2820
Iterating global reduction 3 with 7 rules applied. Total rules applied 230 place count 1203 transition count 2820
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 233 place count 1203 transition count 2817
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 237 place count 1199 transition count 2813
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 1199 transition count 2813
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 245 place count 1195 transition count 2809
Iterating global reduction 4 with 4 rules applied. Total rules applied 249 place count 1195 transition count 2809
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 252 place count 1192 transition count 2806
Iterating global reduction 4 with 3 rules applied. Total rules applied 255 place count 1192 transition count 2806
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 258 place count 1189 transition count 2803
Iterating global reduction 4 with 3 rules applied. Total rules applied 261 place count 1189 transition count 2803
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 1186 transition count 2800
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 1186 transition count 2800
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 1183 transition count 2797
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 1183 transition count 2797
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 275 place count 1183 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 276 place count 1182 transition count 2794
Iterating global reduction 5 with 1 rules applied. Total rules applied 277 place count 1182 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 278 place count 1181 transition count 2793
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 1181 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1180 transition count 2792
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1180 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1179 transition count 2791
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1179 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 1178 transition count 2790
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 1178 transition count 2790
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 286 place count 1178 transition count 2789
Applied a total of 286 rules in 866 ms. Remains 1178 /1316 variables (removed 138) and now considering 2789/2937 (removed 148) transitions.
[2024-05-29 13:04:00] [INFO ] Invariant cache hit.
[2024-05-29 13:04:00] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-29 13:04:00] [INFO ] Invariant cache hit.
[2024-05-29 13:04:01] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-05-29 13:04:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 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 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 81539ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 81576ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1316 places, 2789/2937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84056 ms. Remains : 1178/1316 places, 2789/2937 transitions.
[2024-05-29 13:05:23] [INFO ] Flatten gal took : 102 ms
[2024-05-29 13:05:23] [INFO ] Flatten gal took : 119 ms
[2024-05-29 13:05:23] [INFO ] Input system was already deterministic with 2789 transitions.
[2024-05-29 13:05:23] [INFO ] Flatten gal took : 102 ms
[2024-05-29 13:05:24] [INFO ] Flatten gal took : 108 ms
[2024-05-29 13:05:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16157994945411565273.gal : 21 ms
[2024-05-29 13:05:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6980232639345107131.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/CTLFireability16157994945411565273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6980232639345107131.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 1716987930137

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="StigmergyCommit-PT-05b"
export BK_EXAMINATION="CTLFireability"
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 StigmergyCommit-PT-05b, examination is CTLFireability"
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-171690531700146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-05b.tgz
mv StigmergyCommit-PT-05b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;