About the Execution of ITS-Tools for CANConstruction-PT-090
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 2202677.00 | 0.00 | 0.00 | TFFF?FT?FTT?TTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505100078.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-090, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100078
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 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 12M 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-090-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2023-11
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-090-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716232550251
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-090
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 19:15:51] [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 19:15:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 19:15:52] [INFO ] Load time of PNML (sax parser for PT used): 622 ms
[2024-05-20 19:15:52] [INFO ] Transformed 17282 places.
[2024-05-20 19:15:52] [INFO ] Transformed 33120 transitions.
[2024-05-20 19:15:52] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 851 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (24 resets) in 4985 ms. (8 steps per ms) remains 11/16 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 440 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 11/11 properties
// Phase 1: matrix 33120 rows 17282 cols
[2024-05-20 19:15:55] [INFO ] Flatten gal took : 1810 ms
[2024-05-20 19:15:55] [INFO ] Computed 181 invariants in 519 ms
[2024-05-20 19:15:56] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2024-05-20 19:15:56] [INFO ] Flatten gal took : 839 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-20 19:15:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1959639295400237218.gal : 392 ms
[2024-05-20 19:15:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13562283203117728415.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1959639295400237218.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13562283203117728415.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
Problem CANConstruction-PT-090-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 17020/17175 variables, 74/74 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17175 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17175 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 17/17192 variables, 17/92 constraints. Problems are: Problem set: 1 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 17192/50402 variables, and 92 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5058 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 1/90 constraints, State Equation: 0/17282 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality13562283203117728415.prop.
At refinement iteration 1 (OVERLAPS) 17035/17171 variables, 70/70 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17171 variables, 1/71 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 19:16:58] [INFO ] Deduced a trap composed of 169 places in 54610 ms of which 665 ms to minimize.
SMT process timed out in 63724ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 136 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 613 transitions
Trivial Post-agglo rules discarded 613 transitions
Performed 613 trivial Post agglomeration. Transition count delta: 613
Iterating post reduction 0 with 613 rules applied. Total rules applied 613 place count 17282 transition count 32507
Reduce places removed 613 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 620 rules applied. Total rules applied 1233 place count 16669 transition count 32500
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1240 place count 16662 transition count 32500
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1240 place count 16662 transition count 32497
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1246 place count 16659 transition count 32497
Discarding 7849 places :
Symmetric choice reduction at 3 with 7849 rule applications. Total rules 9095 place count 8810 transition count 16799
Iterating global reduction 3 with 7849 rules applied. Total rules applied 16944 place count 8810 transition count 16799
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 9 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 17112 place count 8726 transition count 16715
Free-agglomeration rule applied 75 times.
Iterating global reduction 3 with 75 rules applied. Total rules applied 17187 place count 8726 transition count 16640
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 3 with 75 rules applied. Total rules applied 17262 place count 8651 transition count 16640
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17264 place count 8651 transition count 16638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 17266 place count 8649 transition count 16638
Partial Free-agglomeration rule applied 107 times.
Drop transitions (Partial Free agglomeration) removed 107 transitions
Iterating global reduction 5 with 107 rules applied. Total rules applied 17373 place count 8649 transition count 16638
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 17375 place count 8649 transition count 16638
Applied a total of 17375 rules in 20276 ms. Remains 8649 /17282 variables (removed 8633) and now considering 16638/33120 (removed 16482) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20289 ms. Remains : 8649/17282 places, 16638/33120 transitions.
RANDOM walk for 40000 steps (60 resets) in 1635 ms. (24 steps per ms) remains 5/10 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
// Phase 1: matrix 16638 rows 8649 cols
[2024-05-20 19:17:20] [INFO ] Computed 181 invariants in 120 ms
[2024-05-20 19:17:20] [INFO ] State equation strengthened by 16243 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem CANConstruction-PT-090-ReachabilityCardinality-2024-00 is UNSAT
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 8439/8525 variables, 57/57 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8525 variables, 1/58 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8525 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/8559 variables, 34/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8559 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 89/8648 variables, 89/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8648 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16638/25286 variables, 8648/8829 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25286 variables, 16243/25072 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25286 variables, 0/25072 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/25287 variables, 1/25073 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25287 variables, 0/25073 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/25287 variables, 0/25073 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25287/25287 variables, and 25073 constraints, problems are : Problem set: 1 solved, 4 unsolved in 17761 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8649/8649 constraints, ReadFeed: 16243/16243 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8450/8515 variables, 47/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8515 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-20 19:17:56] [INFO ] Deduced a trap composed of 2 places in 17181 ms of which 53 ms to minimize.
[2024-05-20 19:17:58] [INFO ] Deduced a trap composed of 93 places in 2564 ms of which 21 ms to minimize.
[2024-05-20 19:18:01] [INFO ] Deduced a trap composed of 93 places in 2481 ms of which 21 ms to minimize.
[2024-05-20 19:18:04] [INFO ] Deduced a trap composed of 93 places in 2366 ms of which 21 ms to minimize.
[2024-05-20 19:18:06] [INFO ] Deduced a trap composed of 93 places in 2385 ms of which 19 ms to minimize.
[2024-05-20 19:18:08] [INFO ] Deduced a trap composed of 96 places in 2237 ms of which 20 ms to minimize.
[2024-05-20 19:18:11] [INFO ] Deduced a trap composed of 96 places in 2059 ms of which 19 ms to minimize.
[2024-05-20 19:18:13] [INFO ] Deduced a trap composed of 93 places in 1952 ms of which 18 ms to minimize.
[2024-05-20 19:18:15] [INFO ] Deduced a trap composed of 93 places in 1925 ms of which 19 ms to minimize.
[2024-05-20 19:18:17] [INFO ] Deduced a trap composed of 93 places in 1766 ms of which 18 ms to minimize.
[2024-05-20 19:18:18] [INFO ] Deduced a trap composed of 93 places in 1678 ms of which 18 ms to minimize.
[2024-05-20 19:18:20] [INFO ] Deduced a trap composed of 93 places in 1955 ms of which 19 ms to minimize.
[2024-05-20 19:18:22] [INFO ] Deduced a trap composed of 93 places in 1939 ms of which 19 ms to minimize.
[2024-05-20 19:18:25] [INFO ] Deduced a trap composed of 93 places in 1987 ms of which 20 ms to minimize.
SMT process timed out in 65082ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 8649 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8649/8649 places, 16638/16638 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 8642 transition count 16624
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 8642 transition count 16624
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 64 place count 8617 transition count 16599
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 8612 transition count 16600
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 8612 transition count 16598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 8610 transition count 16598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 8609 transition count 16596
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 8609 transition count 16596
Applied a total of 80 rules in 14286 ms. Remains 8609 /8649 variables (removed 40) and now considering 16596/16638 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14286 ms. Remains : 8609/8649 places, 16596/16638 transitions.
RANDOM walk for 40000 steps (60 resets) in 1847 ms. (21 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-090-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
// Phase 1: matrix 16596 rows 8609 cols
[2024-05-20 19:18:40] [INFO ] Computed 181 invariants in 119 ms
[2024-05-20 19:18:40] [INFO ] State equation strengthened by 16279 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8414/8475 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8475 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8475 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 44/8519 variables, 44/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8519 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/8608 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8608 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16596/25204 variables, 8608/8789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25204 variables, 16279/25068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25204 variables, 0/25068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/25205 variables, 1/25069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25205 variables, 0/25069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/25205 variables, 0/25069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25205/25205 variables, and 25069 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17464 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8609/8609 constraints, ReadFeed: 16279/16279 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8414/8475 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8475 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 19:19:16] [INFO ] Deduced a trap composed of 2 places in 17797 ms of which 53 ms to minimize.
[2024-05-20 19:19:19] [INFO ] Deduced a trap composed of 96 places in 2948 ms of which 22 ms to minimize.
[2024-05-20 19:19:22] [INFO ] Deduced a trap composed of 96 places in 2799 ms of which 21 ms to minimize.
[2024-05-20 19:19:25] [INFO ] Deduced a trap composed of 97 places in 2561 ms of which 21 ms to minimize.
[2024-05-20 19:19:27] [INFO ] Deduced a trap composed of 93 places in 2439 ms of which 21 ms to minimize.
[2024-05-20 19:19:30] [INFO ] Deduced a trap composed of 96 places in 2674 ms of which 22 ms to minimize.
[2024-05-20 19:19:33] [INFO ] Deduced a trap composed of 96 places in 2392 ms of which 20 ms to minimize.
[2024-05-20 19:19:35] [INFO ] Deduced a trap composed of 99 places in 2344 ms of which 18 ms to minimize.
[2024-05-20 19:19:37] [INFO ] Deduced a trap composed of 95 places in 2234 ms of which 19 ms to minimize.
[2024-05-20 19:19:40] [INFO ] Deduced a trap composed of 93 places in 2083 ms of which 18 ms to minimize.
[2024-05-20 19:19:42] [INFO ] Deduced a trap composed of 93 places in 2200 ms of which 19 ms to minimize.
[2024-05-20 19:19:44] [INFO ] Deduced a trap composed of 93 places in 1974 ms of which 18 ms to minimize.
[2024-05-20 19:19:46] [INFO ] Deduced a trap composed of 93 places in 2014 ms of which 18 ms to minimize.
[2024-05-20 19:19:48] [INFO ] Deduced a trap composed of 93 places in 1993 ms of which 18 ms to minimize.
[2024-05-20 19:19:50] [INFO ] Deduced a trap composed of 93 places in 2110 ms of which 19 ms to minimize.
[2024-05-20 19:19:52] [INFO ] Deduced a trap composed of 96 places in 1923 ms of which 18 ms to minimize.
[2024-05-20 19:19:55] [INFO ] Deduced a trap composed of 93 places in 2021 ms of which 18 ms to minimize.
[2024-05-20 19:19:57] [INFO ] Deduced a trap composed of 93 places in 1999 ms of which 19 ms to minimize.
[2024-05-20 19:19:59] [INFO ] Deduced a trap composed of 93 places in 1962 ms of which 23 ms to minimize.
[2024-05-20 19:20:01] [INFO ] Deduced a trap composed of 96 places in 1892 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8475 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 19:20:04] [INFO ] Deduced a trap composed of 93 places in 3333 ms of which 26 ms to minimize.
[2024-05-20 19:20:08] [INFO ] Deduced a trap composed of 96 places in 3311 ms of which 26 ms to minimize.
[2024-05-20 19:20:11] [INFO ] Deduced a trap composed of 96 places in 2970 ms of which 22 ms to minimize.
[2024-05-20 19:20:14] [INFO ] Deduced a trap composed of 96 places in 2988 ms of which 25 ms to minimize.
SMT process timed out in 94187ms, 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 61 out of 8609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8609/8609 places, 16596/16596 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8608 transition count 16595
Applied a total of 2 rules in 5165 ms. Remains 8608 /8609 variables (removed 1) and now considering 16595/16596 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5165 ms. Remains : 8608/8609 places, 16595/16596 transitions.
RANDOM walk for 40000 steps (61 resets) in 2216 ms. (18 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 163066 steps, run timeout after 3007 ms. (steps per millisecond=54 ) properties seen :0 out of 3
Probabilistic random walk after 163066 steps, saw 160386 distinct states, run finished after 3011 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 16595 rows 8608 cols
[2024-05-20 19:20:23] [INFO ] Computed 181 invariants in 104 ms
[2024-05-20 19:20:23] [INFO ] State equation strengthened by 16280 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8413/8474 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8474 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8474 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 44/8518 variables, 44/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8518 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 89/8607 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8607 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16595/25202 variables, 8607/8788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25202 variables, 16280/25068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25202 variables, 0/25068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/25203 variables, 1/25069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/25203 variables, 0/25069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/25203 variables, 0/25069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25203/25203 variables, and 25069 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17303 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8608/8608 constraints, ReadFeed: 16280/16280 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8413/8474 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8474 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 19:20:58] [INFO ] Deduced a trap composed of 2 places in 16286 ms of which 48 ms to minimize.
[2024-05-20 19:21:01] [INFO ] Deduced a trap composed of 96 places in 2872 ms of which 22 ms to minimize.
[2024-05-20 19:21:04] [INFO ] Deduced a trap composed of 96 places in 2745 ms of which 21 ms to minimize.
[2024-05-20 19:21:07] [INFO ] Deduced a trap composed of 96 places in 3173 ms of which 23 ms to minimize.
[2024-05-20 19:21:10] [INFO ] Deduced a trap composed of 96 places in 2988 ms of which 22 ms to minimize.
[2024-05-20 19:21:13] [INFO ] Deduced a trap composed of 96 places in 3075 ms of which 23 ms to minimize.
[2024-05-20 19:21:16] [INFO ] Deduced a trap composed of 95 places in 2592 ms of which 20 ms to minimize.
[2024-05-20 19:21:19] [INFO ] Deduced a trap composed of 95 places in 2803 ms of which 22 ms to minimize.
[2024-05-20 19:21:22] [INFO ] Deduced a trap composed of 95 places in 2838 ms of which 23 ms to minimize.
[2024-05-20 19:21:24] [INFO ] Deduced a trap composed of 96 places in 2651 ms of which 21 ms to minimize.
[2024-05-20 19:21:27] [INFO ] Deduced a trap composed of 93 places in 2392 ms of which 20 ms to minimize.
[2024-05-20 19:21:29] [INFO ] Deduced a trap composed of 93 places in 2457 ms of which 21 ms to minimize.
[2024-05-20 19:21:32] [INFO ] Deduced a trap composed of 93 places in 2175 ms of which 20 ms to minimize.
[2024-05-20 19:21:34] [INFO ] Deduced a trap composed of 93 places in 2416 ms of which 20 ms to minimize.
[2024-05-20 19:21:36] [INFO ] Deduced a trap composed of 93 places in 2060 ms of which 20 ms to minimize.
[2024-05-20 19:21:39] [INFO ] Deduced a trap composed of 93 places in 1961 ms of which 19 ms to minimize.
[2024-05-20 19:21:41] [INFO ] Deduced a trap composed of 96 places in 1905 ms of which 19 ms to minimize.
[2024-05-20 19:21:43] [INFO ] Deduced a trap composed of 93 places in 2450 ms of which 26 ms to minimize.
[2024-05-20 19:21:45] [INFO ] Deduced a trap composed of 93 places in 2034 ms of which 19 ms to minimize.
[2024-05-20 19:21:47] [INFO ] Deduced a trap composed of 95 places in 1920 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/8474 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 19:21:50] [INFO ] Deduced a trap composed of 96 places in 2840 ms of which 22 ms to minimize.
[2024-05-20 19:21:53] [INFO ] Deduced a trap composed of 101 places in 2510 ms of which 21 ms to minimize.
[2024-05-20 19:21:56] [INFO ] Deduced a trap composed of 93 places in 2890 ms of which 22 ms to minimize.
[2024-05-20 19:21:59] [INFO ] Deduced a trap composed of 103 places in 2542 ms of which 21 ms to minimize.
[2024-05-20 19:22:01] [INFO ] Deduced a trap composed of 96 places in 2420 ms of which 21 ms to minimize.
[2024-05-20 19:22:04] [INFO ] Deduced a trap composed of 93 places in 2788 ms of which 21 ms to minimize.
[2024-05-20 19:22:07] [INFO ] Deduced a trap composed of 93 places in 2802 ms of which 25 ms to minimize.
[2024-05-20 19:22:09] [INFO ] Deduced a trap composed of 96 places in 2237 ms of which 21 ms to minimize.
[2024-05-20 19:22:12] [INFO ] Deduced a trap composed of 96 places in 2222 ms of which 23 ms to minimize.
SMT process timed out in 108681ms, 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 61 out of 8608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8608/8608 places, 16595/16595 transitions.
Applied a total of 0 rules in 2977 ms. Remains 8608 /8608 variables (removed 0) and now considering 16595/16595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2977 ms. Remains : 8608/8608 places, 16595/16595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8608/8608 places, 16595/16595 transitions.
Applied a total of 0 rules in 3026 ms. Remains 8608 /8608 variables (removed 0) and now considering 16595/16595 (removed 0) transitions.
[2024-05-20 19:22:18] [INFO ] Invariant cache hit.
[2024-05-20 19:22:26] [INFO ] Implicit Places using invariants in 8725 ms returned [10, 14, 18, 24, 28, 34, 40, 48, 54, 58, 64, 68, 74, 78, 84, 88, 92, 96, 100, 104, 110, 116, 120, 124, 129, 135, 141, 147, 153, 159, 165, 171, 175, 181, 185, 189, 195, 201, 207, 215, 219, 225, 231, 239, 245, 251, 257, 263, 269, 273, 277, 283, 289, 296, 300, 306, 312, 316, 322, 328, 332, 336, 340, 344, 350, 356, 360, 364, 370, 374, 380, 384, 390, 396, 402, 406, 410, 416, 422, 428, 434, 440, 446, 450, 456, 460, 464, 470, 474]
Discarding 89 places :
Implicit Place search using SMT only with invariants took 8747 ms to find 89 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8519/8608 places, 16595/16595 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 8519 transition count 16560
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 8484 transition count 16560
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 8482 transition count 16558
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 8482 transition count 16558
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 4 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 204 place count 8417 transition count 16493
Applied a total of 204 rules in 8804 ms. Remains 8417 /8519 variables (removed 102) and now considering 16493/16595 (removed 102) transitions.
// Phase 1: matrix 16493 rows 8417 cols
[2024-05-20 19:22:35] [INFO ] Computed 92 invariants in 356 ms
[2024-05-20 19:22:43] [INFO ] Implicit Places using invariants in 7727 ms returned []
Implicit Place search using SMT only with invariants took 7737 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8417/8608 places, 16493/16595 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 28315 ms. Remains : 8417/8608 places, 16493/16595 transitions.
RANDOM walk for 40000 steps (60 resets) in 1532 ms. (26 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 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 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 96469 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 3
Probabilistic random walk after 96469 steps, saw 89614 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-20 19:22:46] [INFO ] Invariant cache hit.
[2024-05-20 19:22:47] [INFO ] State equation strengthened by 16146 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8311/8372 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8372 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8372 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 44/8416 variables, 44/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8416 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 16493/24909 variables, 8416/8508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24909 variables, 16146/24654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24909 variables, 0/24654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/24910 variables, 1/24655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/24910 variables, 0/24655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/24910 variables, 0/24655 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24910/24910 variables, and 24655 constraints, problems are : Problem set: 0 solved, 3 unsolved in 17353 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 8417/8417 constraints, ReadFeed: 16146/16146 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/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8311/8372 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8372 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 19:23:22] [INFO ] Deduced a trap composed of 94 places in 16706 ms of which 47 ms to minimize.
[2024-05-20 19:23:38] [INFO ] Deduced a trap composed of 95 places in 16119 ms of which 47 ms to minimize.
[2024-05-20 19:23:55] [INFO ] Deduced a trap composed of 2 places in 16844 ms of which 46 ms to minimize.
[2024-05-20 19:24:12] [INFO ] Deduced a trap composed of 2 places in 17178 ms of which 50 ms to minimize.
[2024-05-20 19:24:15] [INFO ] Deduced a trap composed of 93 places in 2615 ms of which 22 ms to minimize.
[2024-05-20 19:24:17] [INFO ] Deduced a trap composed of 93 places in 2402 ms of which 21 ms to minimize.
[2024-05-20 19:24:20] [INFO ] Deduced a trap composed of 93 places in 2371 ms of which 20 ms to minimize.
[2024-05-20 19:24:22] [INFO ] Deduced a trap composed of 94 places in 2260 ms of which 19 ms to minimize.
[2024-05-20 19:24:25] [INFO ] Deduced a trap composed of 93 places in 2366 ms of which 22 ms to minimize.
[2024-05-20 19:24:27] [INFO ] Deduced a trap composed of 94 places in 2169 ms of which 20 ms to minimize.
[2024-05-20 19:24:29] [INFO ] Deduced a trap composed of 93 places in 2299 ms of which 21 ms to minimize.
[2024-05-20 19:24:32] [INFO ] Deduced a trap composed of 94 places in 2135 ms of which 19 ms to minimize.
[2024-05-20 19:24:34] [INFO ] Deduced a trap composed of 93 places in 2253 ms of which 20 ms to minimize.
[2024-05-20 19:24:36] [INFO ] Deduced a trap composed of 93 places in 2059 ms of which 19 ms to minimize.
[2024-05-20 19:24:38] [INFO ] Deduced a trap composed of 94 places in 2173 ms of which 19 ms to minimize.
[2024-05-20 19:24:41] [INFO ] Deduced a trap composed of 94 places in 2462 ms of which 21 ms to minimize.
[2024-05-20 19:24:44] [INFO ] Deduced a trap composed of 94 places in 2463 ms of which 21 ms to minimize.
[2024-05-20 19:24:46] [INFO ] Deduced a trap composed of 94 places in 2075 ms of which 18 ms to minimize.
[2024-05-20 19:24:48] [INFO ] Deduced a trap composed of 93 places in 2294 ms of which 19 ms to minimize.
[2024-05-20 19:24:50] [INFO ] Deduced a trap composed of 94 places in 2224 ms of which 21 ms to minimize.
SMT process timed out in 124017ms, 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 61 out of 8417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8417/8417 places, 16493/16493 transitions.
Applied a total of 0 rules in 3278 ms. Remains 8417 /8417 variables (removed 0) and now considering 16493/16493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3279 ms. Remains : 8417/8417 places, 16493/16493 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8417/8417 places, 16493/16493 transitions.
Applied a total of 0 rules in 3271 ms. Remains 8417 /8417 variables (removed 0) and now considering 16493/16493 (removed 0) transitions.
[2024-05-20 19:24:57] [INFO ] Invariant cache hit.
[2024-05-20 19:25:04] [INFO ] Implicit Places using invariants in 7309 ms returned []
Implicit Place search using SMT only with invariants took 7326 ms to find 0 implicit places.
Running 16403 sub problems to find dead transitions.
[2024-05-20 19:25:05] [INFO ] Invariant cache hit.
[2024-05-20 19:25:05] [INFO ] State equation strengthened by 16146 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/8416 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 16403 unsolved
SMT process timed out in 67497ms, After SMT, problems are : Problem set: 0 solved, 16403 unsolved
Search for dead transitions found 0 dead transitions in 67664ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78323 ms. Remains : 8417/8417 places, 16493/16493 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 16120 edges and 8417 vertex of which 7682 / 8417 are part of one of the 85 SCC in 6 ms
Free SCC test removed 7597 places
Drop transitions (Empty/Sink Transition effects.) removed 15109 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 15144 transitions.
Graph (complete) has 1658 edges and 820 vertex of which 642 are kept as prefixes of interest. Removing 178 places using SCC suffix rule.1 ms
Discarding 178 places :
Also discarding 87 output transitions
Drop transitions (Output transitions of discarded places.) removed 87 transitions
Drop transitions (Empty/Sink Transition effects.) removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 444 transitions
Trivial Post-agglo rules discarded 444 transitions
Performed 444 trivial Post agglomeration. Transition count delta: 444
Iterating post reduction 0 with 579 rules applied. Total rules applied 581 place count 642 transition count 683
Ensure Unique test removed 1 places
Reduce places removed 445 places and 0 transitions.
Ensure Unique test removed 438 transitions
Reduce isomorphic transitions removed 438 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 885 rules applied. Total rules applied 1466 place count 197 transition count 243
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1468 place count 195 transition count 243
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1468 place count 195 transition count 224
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 1507 place count 175 transition count 224
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1511 place count 171 transition count 220
Iterating global reduction 3 with 4 rules applied. Total rules applied 1515 place count 171 transition count 220
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 3 with 2 rules applied. Total rules applied 1517 place count 171 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1518 place count 170 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1520 place count 169 transition count 217
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1528 place count 165 transition count 221
Free-agglomeration rule applied 9 times.
Iterating global reduction 5 with 9 rules applied. Total rules applied 1537 place count 165 transition count 212
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1546 place count 156 transition count 212
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 1585 place count 156 transition count 212
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 1616 place count 125 transition count 181
Iterating global reduction 6 with 31 rules applied. Total rules applied 1647 place count 125 transition count 181
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1655 place count 117 transition count 173
Applied a total of 1655 rules in 100 ms. Remains 117 /8417 variables (removed 8300) and now considering 173/16493 (removed 16320) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 173 rows 117 cols
[2024-05-20 19:26:12] [INFO ] Computed 16 invariants in 0 ms
[2024-05-20 19:26:12] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 19:26:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-20 19:26:12] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 19:26:12] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 19:26:12] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-20 19:26:12] [INFO ] Flatten gal took : 3 ms
[2024-05-20 19:26:12] [INFO ] Flatten gal took : 3 ms
[2024-05-20 19:26:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13431430545245973708.gal : 10 ms
[2024-05-20 19:26:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17947920793888890327.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/ReachabilityCardinality13431430545245973708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17947920793888890327.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 ...330
Loading property file /tmp/ReachabilityCardinality17947920793888890327.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 36
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :36 after 1296
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1296 after 139968
Detected timeout of ITS tools.
[2024-05-20 19:26:28] [INFO ] Flatten gal took : 5 ms
[2024-05-20 19:26:28] [INFO ] Applying decomposition
[2024-05-20 19:26:28] [INFO ] Flatten gal took : 3 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/graph9402771028390762627.txt' '-o' '/tmp/graph9402771028390762627.bin' '-w' '/tmp/graph9402771028390762627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9402771028390762627.bin' '-l' '-1' '-v' '-w' '/tmp/graph9402771028390762627.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:26:28] [INFO ] Decomposing Gal with order
[2024-05-20 19:26:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:26:28] [INFO ] Flatten gal took : 29 ms
[2024-05-20 19:26:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 19:26:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10233675864509934688.gal : 2 ms
[2024-05-20 19:26:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5928256116359448976.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/ReachabilityCardinality10233675864509934688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5928256116359448976.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/ReachabilityCardinality5928256116359448976.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 1296
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1296 after 839808
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30750 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 19:26:44] [INFO ] Flatten gal took : 832 ms
[2024-05-20 19:26:44] [INFO ] Applying decomposition
[2024-05-20 19:26:45] [INFO ] Flatten gal took : 659 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/graph7936600345847470377.txt' '-o' '/tmp/graph7936600345847470377.bin' '-w' '/tmp/graph7936600345847470377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7936600345847470377.bin' '-l' '-1' '-v' '-w' '/tmp/graph7936600345847470377.weights' '-q' '0' '-e' '0.001'
[2024-05-20 19:26:46] [INFO ] Decomposing Gal with order
[2024-05-20 19:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 19:26:54] [INFO ] Removed a total of 16426 redundant transitions.
[2024-05-20 19:26:54] [INFO ] Flatten gal took : 2586 ms
[2024-05-20 19:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2510 labels/synchronizations in 1217 ms.
[2024-05-20 19:27:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16950234972535775467.gal : 227 ms
[2024-05-20 19:27:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15438772999456878615.prop : 4 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/ReachabilityCardinality16950234972535775467.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15438772999456878615.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 ...330
Loading property file /tmp/ReachabilityCardinality15438772999456878615.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 16
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :16 after 31
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :31 after 45
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :45 after 76
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :76 after 120
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :120 after 125
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :125 after 137
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :137 after 159
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :159 after 161
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :161 after 246
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :246 after 255
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :255 after 270
BK_STOP 1716234752928
--------------------
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-090"
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-090, 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-171620505100078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-090.tgz
mv CANConstruction-PT-090 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 '
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 ;