Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505100070.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 CANConstruction-PT-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100070
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 20:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 12 20:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.5M May 18 16:42 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 CANConstruction-PT-080-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716230749109

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 18:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 18:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:45:50] [INFO ] Load time of PNML (sax parser for PT used): 600 ms
[2024-05-20 18:45:51] [INFO ] Transformed 13762 places.
[2024-05-20 18:45:51] [INFO ] Transformed 26240 transitions.
[2024-05-20 18:45:51] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 813 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (25 resets) in 4599 ms. (8 steps per ms) remains 12/16 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 952 ms. (41 steps per ms) remains 12/12 properties
[2024-05-20 18:45:53] [INFO ] Flatten gal took : 1376 ms
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
// Phase 1: matrix 26240 rows 13762 cols
[2024-05-20 18:45:54] [INFO ] Flatten gal took : 778 ms
[2024-05-20 18:45:54] [INFO ] Computed 161 invariants in 669 ms
[2024-05-20 18:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17231399971436571638.gal : 251 ms
[2024-05-20 18:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4006498272516724153.prop : 11 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17231399971436571638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4006498272516724153.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-20 18:45:54] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Loading property file /tmp/ReachabilityCardinality4006498272516724153.prop.
Problem CANConstruction-PT-080-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-080-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 13436/13678 variables, 77/77 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13678 variables, 1/78 constraints. Problems are: Problem set: 2 solved, 10 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 Real declared 13678/40002 variables, and 78 constraints, problems are : Problem set: 2 solved, 10 unsolved in 5239 ms.
Refiners :[Positive P Invariants (semi-flows): 77/81 constraints, Generalized P Invariants (flows): 1/80 constraints, State Equation: 0/13762 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13496/13672 variables, 71/71 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13672 variables, 1/72 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-20 18:46:41] [INFO ] Deduced a trap composed of 5 places in 39178 ms of which 590 ms to minimize.
SMT process timed out in 48077ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 176 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 537 transitions
Trivial Post-agglo rules discarded 537 transitions
Performed 537 trivial Post agglomeration. Transition count delta: 537
Iterating post reduction 0 with 537 rules applied. Total rules applied 537 place count 13762 transition count 25703
Reduce places removed 537 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 545 rules applied. Total rules applied 1082 place count 13225 transition count 25695
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1090 place count 13217 transition count 25695
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1090 place count 13217 transition count 25694
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1092 place count 13216 transition count 25694
Discarding 6162 places :
Symmetric choice reduction at 3 with 6162 rule applications. Total rules 7254 place count 7054 transition count 13370
Iterating global reduction 3 with 6162 rules applied. Total rules applied 13416 place count 7054 transition count 13370
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 5 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 13572 place count 6976 transition count 13292
Free-agglomeration rule applied 59 times.
Iterating global reduction 3 with 59 rules applied. Total rules applied 13631 place count 6976 transition count 13233
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 13690 place count 6917 transition count 13233
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 13694 place count 6917 transition count 13229
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 13698 place count 6913 transition count 13229
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 13798 place count 6913 transition count 13229
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 13799 place count 6913 transition count 13229
Applied a total of 13799 rules in 12857 ms. Remains 6913 /13762 variables (removed 6849) and now considering 13229/26240 (removed 13011) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12886 ms. Remains : 6913/13762 places, 13229/26240 transitions.
RANDOM walk for 40000 steps (68 resets) in 1783 ms. (22 steps per ms) remains 3/10 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
// Phase 1: matrix 13229 rows 6913 cols
[2024-05-20 18:46:55] [INFO ] Computed 161 invariants in 138 ms
[2024-05-20 18:46:55] [INFO ] State equation strengthened by 12843 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6720/6801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6801 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6832 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6832 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/6912 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6912 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13229/20141 variables, 6912/7073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20141 variables, 12843/19916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20141 variables, 0/19916 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/20142 variables, 1/19917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/20142 variables, 0/19917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/20142 variables, 0/19917 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20142/20142 variables, and 19917 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11659 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6913/6913 constraints, ReadFeed: 12843/12843 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6720/6801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:47:18] [INFO ] Deduced a trap composed of 2 places in 10417 ms of which 44 ms to minimize.
[2024-05-20 18:47:30] [INFO ] Deduced a trap composed of 2 places in 11775 ms of which 46 ms to minimize.
[2024-05-20 18:47:41] [INFO ] Deduced a trap composed of 2 places in 11188 ms of which 38 ms to minimize.
[2024-05-20 18:47:53] [INFO ] Deduced a trap composed of 2 places in 11800 ms of which 42 ms to minimize.
SMT process timed out in 58318ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6913 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6913/6913 places, 13229/13229 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 0 with 5 rules applied. Total rules applied 5 place count 6913 transition count 13224
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 6908 transition count 13224
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 18 place count 6900 transition count 13208
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 6900 transition count 13208
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 88 place count 6869 transition count 13177
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 102 place count 6862 transition count 13178
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 6862 transition count 13176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 6860 transition count 13176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 6859 transition count 13174
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 6859 transition count 13174
Applied a total of 108 rules in 9924 ms. Remains 6859 /6913 variables (removed 54) and now considering 13174/13229 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9925 ms. Remains : 6859/6913 places, 13174/13229 transitions.
RANDOM walk for 40000 steps (69 resets) in 1304 ms. (30 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 81821 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 3
Probabilistic random walk after 81821 steps, saw 72606 distinct states, run finished after 3008 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 13174 rows 6859 cols
[2024-05-20 18:48:07] [INFO ] Computed 161 invariants in 79 ms
[2024-05-20 18:48:07] [INFO ] State equation strengthened by 12891 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6666/6747 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6747 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6778 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6778 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/6858 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6858 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13174/20032 variables, 6858/7019 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20032 variables, 12891/19910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20032 variables, 0/19910 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/20033 variables, 1/19911 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/20033 variables, 0/19911 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/20033 variables, 0/19911 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20033/20033 variables, and 19911 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11596 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6859/6859 constraints, ReadFeed: 12891/12891 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6666/6747 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:48:30] [INFO ] Deduced a trap composed of 2 places in 10680 ms of which 44 ms to minimize.
[2024-05-20 18:48:33] [INFO ] Deduced a trap composed of 85 places in 2540 ms of which 20 ms to minimize.
[2024-05-20 18:48:35] [INFO ] Deduced a trap composed of 85 places in 2221 ms of which 20 ms to minimize.
[2024-05-20 18:48:38] [INFO ] Deduced a trap composed of 83 places in 2231 ms of which 19 ms to minimize.
[2024-05-20 18:48:40] [INFO ] Deduced a trap composed of 83 places in 2232 ms of which 19 ms to minimize.
[2024-05-20 18:48:42] [INFO ] Deduced a trap composed of 85 places in 2205 ms of which 19 ms to minimize.
[2024-05-20 18:48:45] [INFO ] Deduced a trap composed of 86 places in 2296 ms of which 19 ms to minimize.
[2024-05-20 18:48:47] [INFO ] Deduced a trap composed of 83 places in 2128 ms of which 18 ms to minimize.
[2024-05-20 18:48:49] [INFO ] Deduced a trap composed of 86 places in 1759 ms of which 16 ms to minimize.
[2024-05-20 18:48:50] [INFO ] Deduced a trap composed of 85 places in 1650 ms of which 17 ms to minimize.
[2024-05-20 18:48:52] [INFO ] Deduced a trap composed of 85 places in 1613 ms of which 16 ms to minimize.
[2024-05-20 18:48:54] [INFO ] Deduced a trap composed of 85 places in 1757 ms of which 16 ms to minimize.
[2024-05-20 18:48:56] [INFO ] Deduced a trap composed of 85 places in 1628 ms of which 16 ms to minimize.
[2024-05-20 18:48:57] [INFO ] Deduced a trap composed of 85 places in 1585 ms of which 17 ms to minimize.
[2024-05-20 18:48:59] [INFO ] Deduced a trap composed of 85 places in 1482 ms of which 16 ms to minimize.
[2024-05-20 18:49:01] [INFO ] Deduced a trap composed of 85 places in 1455 ms of which 15 ms to minimize.
[2024-05-20 18:49:02] [INFO ] Deduced a trap composed of 87 places in 1429 ms of which 15 ms to minimize.
[2024-05-20 18:49:04] [INFO ] Deduced a trap composed of 85 places in 1429 ms of which 17 ms to minimize.
[2024-05-20 18:49:05] [INFO ] Deduced a trap composed of 88 places in 1319 ms of which 14 ms to minimize.
[2024-05-20 18:49:06] [INFO ] Deduced a trap composed of 85 places in 1340 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6747 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:49:09] [INFO ] Deduced a trap composed of 83 places in 2444 ms of which 20 ms to minimize.
[2024-05-20 18:49:11] [INFO ] Deduced a trap composed of 83 places in 2356 ms of which 20 ms to minimize.
[2024-05-20 18:49:14] [INFO ] Deduced a trap composed of 86 places in 2192 ms of which 19 ms to minimize.
[2024-05-20 18:49:16] [INFO ] Deduced a trap composed of 83 places in 1891 ms of which 17 ms to minimize.
[2024-05-20 18:49:18] [INFO ] Deduced a trap composed of 83 places in 1810 ms of which 16 ms to minimize.
[2024-05-20 18:49:20] [INFO ] Deduced a trap composed of 86 places in 1799 ms of which 16 ms to minimize.
[2024-05-20 18:49:21] [INFO ] Deduced a trap composed of 85 places in 1747 ms of which 17 ms to minimize.
[2024-05-20 18:49:23] [INFO ] Deduced a trap composed of 86 places in 1462 ms of which 15 ms to minimize.
[2024-05-20 18:49:25] [INFO ] Deduced a trap composed of 86 places in 1722 ms of which 17 ms to minimize.
[2024-05-20 18:49:26] [INFO ] Deduced a trap composed of 86 places in 1491 ms of which 17 ms to minimize.
[2024-05-20 18:49:28] [INFO ] Deduced a trap composed of 83 places in 1353 ms of which 21 ms to minimize.
[2024-05-20 18:49:29] [INFO ] Deduced a trap composed of 85 places in 1448 ms of which 15 ms to minimize.
[2024-05-20 18:49:31] [INFO ] Deduced a trap composed of 86 places in 1290 ms of which 14 ms to minimize.
[2024-05-20 18:49:32] [INFO ] Deduced a trap composed of 83 places in 1647 ms of which 16 ms to minimize.
[2024-05-20 18:49:34] [INFO ] Deduced a trap composed of 86 places in 1660 ms of which 17 ms to minimize.
SMT process timed out in 87463ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6859 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6859/6859 places, 13174/13174 transitions.
Applied a total of 0 rules in 1962 ms. Remains 6859 /6859 variables (removed 0) and now considering 13174/13174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1966 ms. Remains : 6859/6859 places, 13174/13174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6859/6859 places, 13174/13174 transitions.
Applied a total of 0 rules in 1946 ms. Remains 6859 /6859 variables (removed 0) and now considering 13174/13174 (removed 0) transitions.
[2024-05-20 18:49:38] [INFO ] Invariant cache hit.
[2024-05-20 18:49:45] [INFO ] Implicit Places using invariants in 6476 ms returned [5, 12, 16, 22, 26, 32, 36, 42, 48, 54, 60, 66, 72, 77, 81, 87, 93, 99, 105, 109, 113, 119, 123, 129, 134, 138, 142, 146, 152, 158, 164, 170, 176, 182, 188, 192, 198, 204, 208, 214, 220, 226, 230, 234, 238, 244, 250, 256, 262, 266, 272, 276, 280, 284, 288, 294, 300, 304, 310, 316, 322, 328, 334, 340, 346, 354, 360, 364, 368, 374, 378, 382, 388, 394, 398, 404, 410, 416, 422, 426]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 6498 ms to find 80 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6779/6859 places, 13174/13174 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 6779 transition count 13154
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 6759 transition count 13154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 6758 transition count 13153
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 6758 transition count 13153
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 3 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 196 place count 6681 transition count 13076
Applied a total of 196 rules in 6381 ms. Remains 6681 /6779 variables (removed 98) and now considering 13076/13174 (removed 98) transitions.
// Phase 1: matrix 13076 rows 6681 cols
[2024-05-20 18:49:51] [INFO ] Computed 81 invariants in 249 ms
[2024-05-20 18:49:57] [INFO ] Implicit Places using invariants in 5986 ms returned []
Implicit Place search using SMT only with invariants took 5987 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 6681/6859 places, 13076/13174 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20815 ms. Remains : 6681/6859 places, 13076/13174 transitions.
RANDOM walk for 40000 steps (69 resets) in 1089 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 84768 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 3
Probabilistic random walk after 84768 steps, saw 73590 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-20 18:50:00] [INFO ] Invariant cache hit.
[2024-05-20 18:50:01] [INFO ] State equation strengthened by 12765 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6568/6649 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6649 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6680 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6680 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13076/19756 variables, 6680/6761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19756 variables, 12765/19526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19756 variables, 0/19526 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/19757 variables, 1/19527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19757 variables, 0/19527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/19757 variables, 0/19527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19757/19757 variables, and 19527 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11373 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 6681/6681 constraints, ReadFeed: 12765/12765 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6568/6649 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:50:24] [INFO ] Deduced a trap composed of 2 places in 11273 ms of which 38 ms to minimize.
[2024-05-20 18:50:36] [INFO ] Deduced a trap composed of 2 places in 11349 ms of which 37 ms to minimize.
[2024-05-20 18:50:47] [INFO ] Deduced a trap composed of 2 places in 11199 ms of which 42 ms to minimize.
[2024-05-20 18:50:50] [INFO ] Deduced a trap composed of 83 places in 2725 ms of which 21 ms to minimize.
[2024-05-20 18:50:52] [INFO ] Deduced a trap composed of 84 places in 2765 ms of which 21 ms to minimize.
[2024-05-20 18:50:55] [INFO ] Deduced a trap composed of 83 places in 2432 ms of which 20 ms to minimize.
[2024-05-20 18:51:12] [INFO ] Deduced a trap composed of 2 places in 17134 ms of which 48 ms to minimize.
[2024-05-20 18:51:16] [INFO ] Deduced a trap composed of 85 places in 3944 ms of which 32 ms to minimize.
[2024-05-20 18:51:20] [INFO ] Deduced a trap composed of 84 places in 3823 ms of which 38 ms to minimize.
[2024-05-20 18:51:22] [INFO ] Deduced a trap composed of 83 places in 2191 ms of which 18 ms to minimize.
[2024-05-20 18:51:25] [INFO ] Deduced a trap composed of 83 places in 2171 ms of which 19 ms to minimize.
[2024-05-20 18:51:27] [INFO ] Deduced a trap composed of 85 places in 2444 ms of which 20 ms to minimize.
[2024-05-20 18:51:30] [INFO ] Deduced a trap composed of 89 places in 2170 ms of which 18 ms to minimize.
[2024-05-20 18:51:32] [INFO ] Deduced a trap composed of 85 places in 2125 ms of which 18 ms to minimize.
[2024-05-20 18:51:34] [INFO ] Deduced a trap composed of 83 places in 2024 ms of which 18 ms to minimize.
[2024-05-20 18:51:36] [INFO ] Deduced a trap composed of 83 places in 1886 ms of which 19 ms to minimize.
[2024-05-20 18:51:38] [INFO ] Deduced a trap composed of 85 places in 1902 ms of which 30 ms to minimize.
[2024-05-20 18:51:40] [INFO ] Deduced a trap composed of 85 places in 1903 ms of which 17 ms to minimize.
[2024-05-20 18:51:42] [INFO ] Deduced a trap composed of 83 places in 1814 ms of which 19 ms to minimize.
[2024-05-20 18:51:43] [INFO ] Deduced a trap composed of 83 places in 1601 ms of which 16 ms to minimize.
SMT process timed out in 102995ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6681/6681 places, 13076/13076 transitions.
Applied a total of 0 rules in 2573 ms. Remains 6681 /6681 variables (removed 0) and now considering 13076/13076 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2573 ms. Remains : 6681/6681 places, 13076/13076 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6681/6681 places, 13076/13076 transitions.
Applied a total of 0 rules in 2403 ms. Remains 6681 /6681 variables (removed 0) and now considering 13076/13076 (removed 0) transitions.
[2024-05-20 18:51:48] [INFO ] Invariant cache hit.
[2024-05-20 18:51:54] [INFO ] Implicit Places using invariants in 6068 ms returned []
Implicit Place search using SMT only with invariants took 6069 ms to find 0 implicit places.
Running 12996 sub problems to find dead transitions.
[2024-05-20 18:51:55] [INFO ] Invariant cache hit.
[2024-05-20 18:51:55] [INFO ] State equation strengthened by 12765 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 82
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :82 after 83
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :83 after 85
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :85 after 88
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :88 after 94
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :94 after 105
At refinement iteration 0 (INCLUDED_ONLY) 0/6680 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 12996 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6680/19757 variables, and 81 constraints, problems are : Problem set: 0 solved, 12996 unsolved in 30248 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/6681 constraints, ReadFeed: 0/12765 constraints, PredecessorRefiner: 12996/12996 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12996 unsolved
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :105 after 127
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :127 after 162
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :162 after 172
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :172 after 183
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :183 after 205
At refinement iteration 0 (INCLUDED_ONLY) 0/6680 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 12996 unsolved
[2024-05-20 18:53:09] [INFO ] Deduced a trap composed of 83 places in 4462 ms of which 29 ms to minimize.
[2024-05-20 18:53:13] [INFO ] Deduced a trap composed of 83 places in 4319 ms of which 30 ms to minimize.
[2024-05-20 18:53:17] [INFO ] Deduced a trap composed of 88 places in 4163 ms of which 28 ms to minimize.
[2024-05-20 18:53:21] [INFO ] Deduced a trap composed of 86 places in 3820 ms of which 29 ms to minimize.
SMT process timed out in 86612ms, After SMT, problems are : Problem set: 0 solved, 12996 unsolved
Search for dead transitions found 0 dead transitions in 86739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95258 ms. Remains : 6681/6681 places, 13076/13076 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 12679 edges and 6681 vertex of which 6163 / 6681 are part of one of the 77 SCC in 6 ms
Free SCC test removed 6086 places
Drop transitions (Empty/Sink Transition effects.) removed 12095 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 12137 transitions.
Graph (complete) has 1215 edges and 595 vertex of which 452 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.0 ms
Discarding 143 places :
Also discarding 62 output transitions
Drop transitions (Output transitions of discarded places.) removed 62 transitions
Drop transitions (Empty/Sink Transition effects.) removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 366 rules applied. Total rules applied 368 place count 452 transition count 511
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Iterating post reduction 1 with 468 rules applied. Total rules applied 836 place count 216 transition count 279
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 836 place count 216 transition count 269
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 856 place count 206 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 857 place count 205 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 205 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 860 place count 205 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 861 place count 204 transition count 266
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 873 place count 198 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 874 place count 198 transition count 275
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 884 place count 198 transition count 265
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 894 place count 188 transition count 265
Partial Free-agglomeration rule applied 41 times.
Drop transitions (Partial Free agglomeration) removed 41 transitions
Iterating global reduction 5 with 41 rules applied. Total rules applied 935 place count 188 transition count 265
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 961 place count 162 transition count 239
Iterating global reduction 5 with 26 rules applied. Total rules applied 987 place count 162 transition count 239
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 1002 place count 147 transition count 224
Applied a total of 1002 rules in 85 ms. Remains 147 /6681 variables (removed 6534) and now considering 224/13076 (removed 12852) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 224 rows 147 cols
[2024-05-20 18:53:21] [INFO ] Computed 25 invariants in 1 ms
[2024-05-20 18:53:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:53:21] [INFO ] [Nat]Absence check using 25 positive place invariants in 2 ms returned sat
[2024-05-20 18:53:22] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 18:53:22] [INFO ] After 156ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:53:22] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:53:22] [INFO ] Flatten gal took : 23 ms
[2024-05-20 18:53:22] [INFO ] Flatten gal took : 4 ms
[2024-05-20 18:53:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10368988386167133289.gal : 1 ms
[2024-05-20 18:53:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7479744857416371652.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10368988386167133289.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7479744857416371652.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7479744857416371652.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 72
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :72 after 6912
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :6912 after 995328
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :995328 after 1.28995e+09
Reachability property CANConstruction-PT-080-ReachabilityCardinality-2024-13 is true.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1.28995e+09 after 5.34966e+16
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.47434e+24,0.560026,5044,2,512,12,4891,8,0,831,2123,0
Total reachable state count : 3474344993155524329472000

Verifying 3 reachability properties.
Reachability property CANConstruction-PT-080-ReachabilityCardinality-2024-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-080-ReachabilityCardinality-2024-05,2.93975e+21,0.629067,9320,2,16811,12,32606,8,0,935,21471,0
Reachability property CANConstruction-PT-080-ReachabilityCardinality-2024-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-080-ReachabilityCardinality-2024-09,1.01307e+22,0.640287,10112,2,2243,12,36414,8,0,980,23917,0
Reachability property CANConstruction-PT-080-ReachabilityCardinality-2024-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANConstruction-PT-080-ReachabilityCardinality-2024-13,8.95795e+06,0.64242,10112,2,182,12,36801,9,0,1010,23926,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 1137 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 18:53:23] [INFO ] Flatten gal took : 578 ms
[2024-05-20 18:53:23] [INFO ] Applying decomposition
[2024-05-20 18:53:24] [INFO ] Flatten gal took : 501 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/graph3188996977272954454.txt' '-o' '/tmp/graph3188996977272954454.bin' '-w' '/tmp/graph3188996977272954454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3188996977272954454.bin' '-l' '-1' '-v' '-w' '/tmp/graph3188996977272954454.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:53:25] [INFO ] Decomposing Gal with order
[2024-05-20 18:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:53:31] [INFO ] Removed a total of 15375 redundant transitions.
[2024-05-20 18:53:31] [INFO ] Flatten gal took : 2121 ms
[2024-05-20 18:53:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2243 labels/synchronizations in 712 ms.
[2024-05-20 18:53:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14187175808447494402.gal : 170 ms
[2024-05-20 18:53:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality124850047665239210.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14187175808447494402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality124850047665239210.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality124850047665239210.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 21
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :21 after 25
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :25 after 43
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :43 after 92
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :92 after 100
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :100 after 105
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :105 after 109
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :109 after 111
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :111 after 115
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :115 after 121
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :121 after 131
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :131 after 207
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :207 after 13479
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :13479 after 18681

BK_STOP 1716232369805

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="CANConstruction-PT-080"
export BK_EXAMINATION="ReachabilityCardinality"
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 CANConstruction-PT-080, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620505100070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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