Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 18:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 18:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 18:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 12 18:30 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 2.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-040-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-040-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716219319136

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-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 15:35:20] [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 15:35:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:35:20] [INFO ] Load time of PNML (sax parser for PT used): 230 ms
[2024-05-20 15:35:20] [INFO ] Transformed 3682 places.
[2024-05-20 15:35:20] [INFO ] Transformed 6720 transitions.
[2024-05-20 15:35:20] [INFO ] Parsed PT model containing 3682 places and 6720 transitions and 20000 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2024-05-20 15:35:21] [INFO ] Flatten gal took : 544 ms
RANDOM walk for 40000 steps (56 resets) in 3439 ms. (11 steps per ms) remains 4/16 properties
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 15:35:22] [INFO ] Flatten gal took : 250 ms
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
[2024-05-20 15:35:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8667590257964635685.gal : 207 ms
[2024-05-20 15:35:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15663027640663381317.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8667590257964635685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15663027640663381317.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 4/4 properties

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
// Phase 1: matrix 6720 rows 3682 cols
[2024-05-20 15:35:22] [INFO ] Computed 81 invariants in 99 ms
[2024-05-20 15:35:22] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality15663027640663381317.prop.
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-03 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-040-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-040-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 3561/3640 variables, 38/38 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3640 variables, 2/40 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3640 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/3643 variables, 3/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3643 variables, 0/43 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 38/3681 variables, 38/81 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3681 variables, 0/81 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6720/10401 variables, 3681/3762 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/10401 variables, 3160/6922 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/10401 variables, 0/6922 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/10402 variables, 1/6923 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/10402 variables, 0/6923 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10402/10402 variables, and 6923 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3490 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 3682/3682 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3595/3618 variables, 17/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3618 variables, 1/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-20 15:35:29] [INFO ] Deduced a trap composed of 5 places in 2617 ms of which 156 ms to minimize.
[2024-05-20 15:35:31] [INFO ] Deduced a trap composed of 5 places in 2272 ms of which 20 ms to minimize.
SMT process timed out in 9343ms, After SMT, problems are : Problem set: 3 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 3682 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3682/3682 places, 6720/6720 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 272 place count 3682 transition count 6448
Reduce places removed 272 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 275 rules applied. Total rules applied 547 place count 3410 transition count 6445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 550 place count 3407 transition count 6445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 550 place count 3407 transition count 6443
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 554 place count 3405 transition count 6443
Discarding 1510 places :
Symmetric choice reduction at 3 with 1510 rule applications. Total rules 2064 place count 1895 transition count 3423
Iterating global reduction 3 with 1510 rules applied. Total rules applied 3574 place count 1895 transition count 3423
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 3650 place count 1857 transition count 3385
Free-agglomeration rule applied 59 times.
Iterating global reduction 3 with 59 rules applied. Total rules applied 3709 place count 1857 transition count 3326
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 3768 place count 1798 transition count 3326
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3769 place count 1798 transition count 3325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3770 place count 1797 transition count 3325
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 3791 place count 1797 transition count 3325
Applied a total of 3791 rules in 1738 ms. Remains 1797 /3682 variables (removed 1885) and now considering 3325/6720 (removed 3395) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1749 ms. Remains : 1797/3682 places, 3325/6720 transitions.
RANDOM walk for 40000 steps (141 resets) in 886 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 42
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :42 after 43
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :43 after 45
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :45 after 48
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :48 after 54
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :54 after 65
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :65 after 82
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :82 after 92
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :92 after 101
Interrupted probabilistic random walk after 195920 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 195920 steps, saw 112860 distinct states, run finished after 3004 ms. (steps per millisecond=65 ) properties seen :0
// Phase 1: matrix 3325 rows 1797 cols
[2024-05-20 15:35:36] [INFO ] Computed 81 invariants in 21 ms
[2024-05-20 15:35:37] [INFO ] State equation strengthened by 3207 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :101 after 119
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1710/1733 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1733 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1733 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1757 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1757 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 39/1796 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1796 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3325/5121 variables, 1796/1877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5121 variables, 3207/5084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5121 variables, 0/5084 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/5122 variables, 1/5085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5122 variables, 0/5085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5122 variables, 0/5085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5122/5122 variables, and 5085 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1797/1797 constraints, ReadFeed: 3207/3207 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1710/1733 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1733 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:35:39] [INFO ] Deduced a trap composed of 2 places in 838 ms of which 11 ms to minimize.
[2024-05-20 15:35:40] [INFO ] Deduced a trap composed of 2 places in 836 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1733 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1733 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/1757 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:35:42] [INFO ] Deduced a trap composed of 43 places in 2037 ms of which 35 ms to minimize.
[2024-05-20 15:35:45] [INFO ] Deduced a trap composed of 44 places in 2507 ms of which 25 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1721 after 1760
[2024-05-20 15:35:47] [INFO ] Deduced a trap composed of 47 places in 2731 ms of which 12 ms to minimize.
[2024-05-20 15:35:49] [INFO ] Deduced a trap composed of 43 places in 1229 ms of which 12 ms to minimize.
[2024-05-20 15:35:50] [INFO ] Deduced a trap composed of 43 places in 1238 ms of which 11 ms to minimize.
[2024-05-20 15:35:51] [INFO ] Deduced a trap composed of 43 places in 1279 ms of which 11 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1760 after 1913
[2024-05-20 15:35:53] [INFO ] Deduced a trap composed of 44 places in 1238 ms of which 11 ms to minimize.
[2024-05-20 15:35:54] [INFO ] Deduced a trap composed of 44 places in 1269 ms of which 11 ms to minimize.
[2024-05-20 15:35:55] [INFO ] Deduced a trap composed of 43 places in 1232 ms of which 11 ms to minimize.
[2024-05-20 15:35:56] [INFO ] Deduced a trap composed of 43 places in 1259 ms of which 10 ms to minimize.
[2024-05-20 15:35:58] [INFO ] Deduced a trap composed of 44 places in 1299 ms of which 11 ms to minimize.
[2024-05-20 15:35:59] [INFO ] Deduced a trap composed of 43 places in 1208 ms of which 11 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :1913 after 2195
[2024-05-20 15:36:00] [INFO ] Deduced a trap composed of 43 places in 1191 ms of which 11 ms to minimize.
[2024-05-20 15:36:01] [INFO ] Deduced a trap composed of 43 places in 1189 ms of which 11 ms to minimize.
[2024-05-20 15:36:03] [INFO ] Deduced a trap composed of 47 places in 1199 ms of which 11 ms to minimize.
[2024-05-20 15:36:04] [INFO ] Deduced a trap composed of 43 places in 1207 ms of which 11 ms to minimize.
[2024-05-20 15:36:05] [INFO ] Deduced a trap composed of 43 places in 1194 ms of which 11 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :2195 after 5312
[2024-05-20 15:36:06] [INFO ] Deduced a trap composed of 43 places in 1267 ms of which 12 ms to minimize.
[2024-05-20 15:36:08] [INFO ] Deduced a trap composed of 43 places in 1263 ms of which 12 ms to minimize.
[2024-05-20 15:36:09] [INFO ] Deduced a trap composed of 43 places in 1176 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1757 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:36:10] [INFO ] Deduced a trap composed of 43 places in 1175 ms of which 11 ms to minimize.
[2024-05-20 15:36:11] [INFO ] Deduced a trap composed of 50 places in 1233 ms of which 11 ms to minimize.
[2024-05-20 15:36:13] [INFO ] Deduced a trap composed of 43 places in 1210 ms of which 11 ms to minimize.
[2024-05-20 15:36:14] [INFO ] Deduced a trap composed of 43 places in 1239 ms of which 11 ms to minimize.
[2024-05-20 15:36:15] [INFO ] Deduced a trap composed of 48 places in 1202 ms of which 10 ms to minimize.
[2024-05-20 15:36:16] [INFO ] Deduced a trap composed of 43 places in 1254 ms of which 11 ms to minimize.
[2024-05-20 15:36:18] [INFO ] Deduced a trap composed of 43 places in 1231 ms of which 10 ms to minimize.
[2024-05-20 15:36:19] [INFO ] Deduced a trap composed of 51 places in 1166 ms of which 10 ms to minimize.
[2024-05-20 15:36:20] [INFO ] Deduced a trap composed of 43 places in 1157 ms of which 10 ms to minimize.
[2024-05-20 15:36:21] [INFO ] Deduced a trap composed of 43 places in 1171 ms of which 12 ms to minimize.
[2024-05-20 15:36:22] [INFO ] Deduced a trap composed of 43 places in 1117 ms of which 18 ms to minimize.
[2024-05-20 15:36:24] [INFO ] Deduced a trap composed of 43 places in 1124 ms of which 11 ms to minimize.
SMT process timed out in 47090ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1797/1797 places, 3325/3325 transitions.
Applied a total of 0 rules in 138 ms. Remains 1797 /1797 variables (removed 0) and now considering 3325/3325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1797/1797 places, 3325/3325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1797/1797 places, 3325/3325 transitions.
Applied a total of 0 rules in 134 ms. Remains 1797 /1797 variables (removed 0) and now considering 3325/3325 (removed 0) transitions.
[2024-05-20 15:36:24] [INFO ] Invariant cache hit.
[2024-05-20 15:36:25] [INFO ] Implicit Places using invariants in 1217 ms returned [5, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 61, 65, 69, 75, 79, 83, 87, 91, 97, 101, 107, 113, 118, 122, 126, 130, 134, 138, 144, 148, 152, 163, 168, 174, 178, 186]
Discarding 39 places :
Implicit Place search using SMT only with invariants took 1227 ms to find 39 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1758/1797 places, 3325/3325 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1758 transition count 3307
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 1740 transition count 3307
Applied a total of 36 rules in 192 ms. Remains 1740 /1758 variables (removed 18) and now considering 3307/3325 (removed 18) transitions.
// Phase 1: matrix 3307 rows 1740 cols
[2024-05-20 15:36:25] [INFO ] Computed 42 invariants in 37 ms
[2024-05-20 15:36:26] [INFO ] Implicit Places using invariants in 989 ms returned []
[2024-05-20 15:36:26] [INFO ] Invariant cache hit.
[2024-05-20 15:36:27] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 15:36:52] [INFO ] Implicit Places using invariants and state equation in 25266 ms returned []
Implicit Place search using SMT with State Equation took 26261 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1740/1797 places, 3307/3325 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27816 ms. Remains : 1740/1797 places, 3307/3325 transitions.
RANDOM walk for 40000 steps (140 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 201747 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 201747 steps, saw 115994 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-20 15:36:55] [INFO ] Invariant cache hit.
[2024-05-20 15:36:55] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1715 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1715 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1715 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 24/1739 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1739 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3307/5046 variables, 1739/1781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5046 variables, 3160/4941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5046 variables, 0/4941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/5047 variables, 1/4942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5047 variables, 0/4942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/5047 variables, 0/4942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5047/5047 variables, and 4942 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1740/1740 constraints, ReadFeed: 3160/3160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1692/1715 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1715 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,4 properties remain. new max is 65536
[2024-05-20 15:36:57] [INFO ] Deduced a trap composed of 2 places in 898 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1715 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1715 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :5312 after 7379
At refinement iteration 5 (OVERLAPS) 24/1739 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:36:59] [INFO ] Deduced a trap composed of 43 places in 1283 ms of which 11 ms to minimize.
[2024-05-20 15:37:00] [INFO ] Deduced a trap composed of 43 places in 1260 ms of which 11 ms to minimize.
[2024-05-20 15:37:01] [INFO ] Deduced a trap composed of 43 places in 1240 ms of which 11 ms to minimize.
[2024-05-20 15:37:03] [INFO ] Deduced a trap composed of 43 places in 1258 ms of which 11 ms to minimize.
[2024-05-20 15:37:04] [INFO ] Deduced a trap composed of 44 places in 1253 ms of which 11 ms to minimize.
[2024-05-20 15:37:05] [INFO ] Deduced a trap composed of 43 places in 1246 ms of which 11 ms to minimize.
[2024-05-20 15:37:06] [INFO ] Deduced a trap composed of 43 places in 1220 ms of which 11 ms to minimize.
[2024-05-20 15:37:08] [INFO ] Deduced a trap composed of 43 places in 1217 ms of which 10 ms to minimize.
[2024-05-20 15:37:09] [INFO ] Deduced a trap composed of 43 places in 1209 ms of which 11 ms to minimize.
[2024-05-20 15:37:10] [INFO ] Deduced a trap composed of 43 places in 1223 ms of which 11 ms to minimize.
[2024-05-20 15:37:11] [INFO ] Deduced a trap composed of 43 places in 1213 ms of which 11 ms to minimize.
[2024-05-20 15:37:13] [INFO ] Deduced a trap composed of 44 places in 1201 ms of which 11 ms to minimize.
[2024-05-20 15:37:14] [INFO ] Deduced a trap composed of 43 places in 1229 ms of which 11 ms to minimize.
[2024-05-20 15:37:15] [INFO ] Deduced a trap composed of 44 places in 1228 ms of which 11 ms to minimize.
[2024-05-20 15:37:16] [INFO ] Deduced a trap composed of 43 places in 1205 ms of which 10 ms to minimize.
[2024-05-20 15:37:18] [INFO ] Deduced a trap composed of 43 places in 1233 ms of which 12 ms to minimize.
[2024-05-20 15:37:19] [INFO ] Deduced a trap composed of 43 places in 1239 ms of which 10 ms to minimize.
[2024-05-20 15:37:20] [INFO ] Deduced a trap composed of 44 places in 1164 ms of which 11 ms to minimize.
[2024-05-20 15:37:21] [INFO ] Deduced a trap composed of 43 places in 1193 ms of which 26 ms to minimize.
[2024-05-20 15:37:23] [INFO ] Deduced a trap composed of 43 places in 1169 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1739 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :7379 after 11123
[2024-05-20 15:37:24] [INFO ] Deduced a trap composed of 45 places in 1209 ms of which 11 ms to minimize.
[2024-05-20 15:37:25] [INFO ] Deduced a trap composed of 43 places in 1674 ms of which 11 ms to minimize.
[2024-05-20 15:37:27] [INFO ] Deduced a trap composed of 45 places in 1215 ms of which 11 ms to minimize.
[2024-05-20 15:37:28] [INFO ] Deduced a trap composed of 43 places in 1197 ms of which 11 ms to minimize.
[2024-05-20 15:37:29] [INFO ] Deduced a trap composed of 43 places in 1198 ms of which 11 ms to minimize.
[2024-05-20 15:37:30] [INFO ] Deduced a trap composed of 43 places in 1167 ms of which 12 ms to minimize.
[2024-05-20 15:37:32] [INFO ] Deduced a trap composed of 43 places in 1198 ms of which 13 ms to minimize.
[2024-05-20 15:37:33] [INFO ] Deduced a trap composed of 43 places in 1172 ms of which 11 ms to minimize.
[2024-05-20 15:37:34] [INFO ] Deduced a trap composed of 43 places in 1176 ms of which 11 ms to minimize.
[2024-05-20 15:37:35] [INFO ] Deduced a trap composed of 44 places in 1175 ms of which 12 ms to minimize.
[2024-05-20 15:37:36] [INFO ] Deduced a trap composed of 43 places in 1151 ms of which 11 ms to minimize.
[2024-05-20 15:37:38] [INFO ] Deduced a trap composed of 48 places in 1247 ms of which 14 ms to minimize.
[2024-05-20 15:37:39] [INFO ] Deduced a trap composed of 43 places in 1174 ms of which 11 ms to minimize.
[2024-05-20 15:37:40] [INFO ] Deduced a trap composed of 43 places in 1214 ms of which 11 ms to minimize.
[2024-05-20 15:37:41] [INFO ] Deduced a trap composed of 43 places in 1176 ms of which 11 ms to minimize.
[2024-05-20 15:37:43] [INFO ] Deduced a trap composed of 43 places in 1144 ms of which 12 ms to minimize.
[2024-05-20 15:37:44] [INFO ] Deduced a trap composed of 44 places in 1171 ms of which 11 ms to minimize.
[2024-05-20 15:37:45] [INFO ] Deduced a trap composed of 44 places in 1179 ms of which 11 ms to minimize.
[2024-05-20 15:37:46] [INFO ] Deduced a trap composed of 43 places in 1122 ms of which 11 ms to minimize.
[2024-05-20 15:37:47] [INFO ] Deduced a trap composed of 45 places in 1092 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1739 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:37:48] [INFO ] Deduced a trap composed of 43 places in 1013 ms of which 11 ms to minimize.
[2024-05-20 15:37:49] [INFO ] Deduced a trap composed of 43 places in 1056 ms of which 11 ms to minimize.
[2024-05-20 15:37:51] [INFO ] Deduced a trap composed of 46 places in 1167 ms of which 11 ms to minimize.
[2024-05-20 15:37:52] [INFO ] Deduced a trap composed of 45 places in 1097 ms of which 12 ms to minimize.
[2024-05-20 15:37:53] [INFO ] Deduced a trap composed of 43 places in 1035 ms of which 11 ms to minimize.
[2024-05-20 15:37:54] [INFO ] Deduced a trap composed of 43 places in 1093 ms of which 11 ms to minimize.
[2024-05-20 15:37:55] [INFO ] Deduced a trap composed of 47 places in 1043 ms of which 11 ms to minimize.
[2024-05-20 15:37:56] [INFO ] Deduced a trap composed of 52 places in 1019 ms of which 10 ms to minimize.
[2024-05-20 15:37:57] [INFO ] Deduced a trap composed of 48 places in 1081 ms of which 12 ms to minimize.
[2024-05-20 15:37:58] [INFO ] Deduced a trap composed of 46 places in 1117 ms of which 11 ms to minimize.
[2024-05-20 15:37:59] [INFO ] Deduced a trap composed of 46 places in 1123 ms of which 10 ms to minimize.
[2024-05-20 15:38:01] [INFO ] Deduced a trap composed of 45 places in 1080 ms of which 11 ms to minimize.
[2024-05-20 15:38:02] [INFO ] Deduced a trap composed of 46 places in 1175 ms of which 11 ms to minimize.
[2024-05-20 15:38:03] [INFO ] Deduced a trap composed of 45 places in 1182 ms of which 10 ms to minimize.
[2024-05-20 15:38:04] [INFO ] Deduced a trap composed of 45 places in 1162 ms of which 11 ms to minimize.
[2024-05-20 15:38:05] [INFO ] Deduced a trap composed of 43 places in 1033 ms of which 10 ms to minimize.
[2024-05-20 15:38:06] [INFO ] Deduced a trap composed of 43 places in 1026 ms of which 10 ms to minimize.
[2024-05-20 15:38:07] [INFO ] Deduced a trap composed of 43 places in 967 ms of which 10 ms to minimize.
[2024-05-20 15:38:08] [INFO ] Deduced a trap composed of 43 places in 1006 ms of which 11 ms to minimize.
[2024-05-20 15:38:09] [INFO ] Deduced a trap composed of 44 places in 1012 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1739 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 15:38:10] [INFO ] Deduced a trap composed of 43 places in 1020 ms of which 10 ms to minimize.
[2024-05-20 15:38:11] [INFO ] Deduced a trap composed of 46 places in 1034 ms of which 11 ms to minimize.
SMT process timed out in 76743ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 23 out of 1740 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1740/1740 places, 3307/3307 transitions.
Applied a total of 0 rules in 139 ms. Remains 1740 /1740 variables (removed 0) and now considering 3307/3307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 1740/1740 places, 3307/3307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1740/1740 places, 3307/3307 transitions.
Applied a total of 0 rules in 124 ms. Remains 1740 /1740 variables (removed 0) and now considering 3307/3307 (removed 0) transitions.
[2024-05-20 15:38:12] [INFO ] Invariant cache hit.
[2024-05-20 15:38:13] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-20 15:38:13] [INFO ] Invariant cache hit.
[2024-05-20 15:38:14] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-20 15:38:36] [INFO ] Implicit Places using invariants and state equation in 23660 ms returned []
Implicit Place search using SMT with State Equation took 24633 ms to find 0 implicit places.
[2024-05-20 15:38:37] [INFO ] Redundant transitions in 229 ms returned []
Running 3267 sub problems to find dead transitions.
[2024-05-20 15:38:37] [INFO ] Invariant cache hit.
[2024-05-20 15:38:37] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1739 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 3267 unsolved
SMT process timed out in 32608ms, After SMT, problems are : Problem set: 0 solved, 3267 unsolved
Search for dead transitions found 0 dead transitions in 32646ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57668 ms. Remains : 1740/1740 places, 3307/3307 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3169 edges and 1740 vertex of which 1501 / 1740 are part of one of the 37 SCC in 3 ms
Free SCC test removed 1464 places
Drop transitions (Empty/Sink Transition effects.) removed 2891 transitions
Reduce isomorphic transitions removed 2891 transitions.
Graph (complete) has 551 edges and 276 vertex of which 186 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.0 ms
Discarding 90 places :
Also discarding 49 output transitions
Drop transitions (Output transitions of discarded places.) removed 49 transitions
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 186 transition count 199
Ensure Unique test removed 1 places
Reduce places removed 115 places and 0 transitions.
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Iterating post reduction 1 with 226 rules applied. Total rules applied 396 place count 71 transition count 88
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 396 place count 71 transition count 81
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 410 place count 64 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 63 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 63 transition count 80
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 2 with 2 rules applied. Total rules applied 414 place count 62 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 62 transition count 77
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 419 place count 62 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 422 place count 59 transition count 74
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 432 place count 59 transition count 74
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 442 place count 49 transition count 64
Iterating global reduction 3 with 10 rules applied. Total rules applied 452 place count 49 transition count 64
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 456 place count 45 transition count 60
Applied a total of 456 rules in 35 ms. Remains 45 /1740 variables (removed 1695) and now considering 60/3307 (removed 3247) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 45 cols
[2024-05-20 15:39:09] [INFO ] Computed 6 invariants in 10 ms
[2024-05-20 15:39:09] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:39:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-20 15:39:09] [INFO ] [Nat]Absence check using 5 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 15:39:09] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 15:39:09] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:39:09] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:39:09] [INFO ] Flatten gal took : 2 ms
[2024-05-20 15:39:09] [INFO ] Flatten gal took : 2 ms
[2024-05-20 15:39:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11349727248748570405.gal : 2 ms
[2024-05-20 15:39:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4625083976068883604.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/ReachabilityCardinality11349727248748570405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4625083976068883604.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/ReachabilityCardinality4625083976068883604.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 972
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :972 after 653184
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,1.56764e+08,0.008536,3880,2,76,9,506,7,0,255,265,0
Total reachable state count : 156764160

Verifying 1 reachability properties.
Invariant property CANConstruction-PT-040-ReachabilityCardinality-2024-13 does not hold.

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-040-ReachabilityCardinality-2024-13,1.3122e+06,0.010262,4256,2,216,9,655,7,0,293,265,0
Over-approximation ignoring read arcs solved 0 properties in 200 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 15:39:10] [INFO ] Flatten gal took : 193 ms
[2024-05-20 15:39:10] [INFO ] Applying decomposition
[2024-05-20 15:39:10] [INFO ] Flatten gal took : 187 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/graph12000260030008526169.txt' '-o' '/tmp/graph12000260030008526169.bin' '-w' '/tmp/graph12000260030008526169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12000260030008526169.bin' '-l' '-1' '-v' '-w' '/tmp/graph12000260030008526169.weights' '-q' '0' '-e' '0.001'
[2024-05-20 15:39:11] [INFO ] Decomposing Gal with order
[2024-05-20 15:39:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 15:39:12] [INFO ] Removed a total of 3267 redundant transitions.
[2024-05-20 15:39:12] [INFO ] Flatten gal took : 670 ms
[2024-05-20 15:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 474 labels/synchronizations in 226 ms.
[2024-05-20 15:39:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6290277679273721594.gal : 66 ms
[2024-05-20 15:39:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4369062243936725843.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/ReachabilityCardinality6290277679273721594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4369062243936725843.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/ReachabilityCardinality4369062243936725843.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 47
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :47 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 57
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :57 after 67
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :67 after 73
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :73 after 114
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :114 after 159
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :159 after 2634
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2634 after 3729
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3729 after 81084
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :81084 after 96555
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :96555 after 112569
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :112569 after 1.94905e+06
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.94905e+06 after 2.22119e+06
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :2.22119e+06 after 2.92825e+07
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :2.92825e+07 after 3.39468e+07
SDD proceeding with computation,1 properties remain. new max is 4194304
SDD size :3.39468e+07 after 3.61774e+07
Detected timeout of ITS tools.
[2024-05-20 16:09:14] [INFO ] Flatten gal took : 142 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin397497125689356731
[2024-05-20 16:09:14] [INFO ] Too many transitions (3307) to apply POR reductions. Disabling POR matrices.
[2024-05-20 16:09:14] [INFO ] Applying decomposition
[2024-05-20 16:09:14] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin397497125689356731
Running compilation step : cd /tmp/ltsmin397497125689356731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 16:09:14] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7503410110649934902.txt' '-o' '/tmp/graph7503410110649934902.bin' '-w' '/tmp/graph7503410110649934902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7503410110649934902.bin' '-l' '-1' '-v' '-w' '/tmp/graph7503410110649934902.weights' '-q' '0' '-e' '0.001'
[2024-05-20 16:09:14] [INFO ] Decomposing Gal with order
[2024-05-20 16:09:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 16:09:15] [INFO ] Removed a total of 3202 redundant transitions.
[2024-05-20 16:09:15] [INFO ] Flatten gal took : 290 ms
[2024-05-20 16:09:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 3064 labels/synchronizations in 161 ms.
[2024-05-20 16:09:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9423944747657982444.gal : 28 ms
[2024-05-20 16:09:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6144070461634777064.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/ReachabilityCardinality9423944747657982444.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6144070461634777064.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/ReachabilityCardinality6144070461634777064.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1161
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1161 after 169767
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :169767 after 524269
Compilation finished in 10113 ms.
Running link step : cd /tmp/ltsmin397497125689356731;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin397497125689356731;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT040ReachabilityCardinality202413==true'
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :524269 after 8.81442e+10
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8.81442e+10 after 3.43597e+11

BK_TIME_CONFINEMENT_REACHED

--------------------
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-040"
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-040, 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-171620505000038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-040.tgz
mv CANConstruction-PT-040 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 ;