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.r004-smll-171620118400382.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 Anderson-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620118400382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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.2K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 Anderson-PT-12-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2023-01
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716466072848

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-23 12:07:55] [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-23 12:07:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:07:56] [INFO ] Load time of PNML (sax parser for PT used): 594 ms
[2024-05-23 12:07:56] [INFO ] Transformed 889 places.
[2024-05-23 12:07:56] [INFO ] Transformed 4152 transitions.
[2024-05-23 12:07:56] [INFO ] Found NUPN structural information;
[2024-05-23 12:07:56] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 869 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4394 ms. (9 steps per ms) remains 5/9 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 1113 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1531 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 555 ms. (71 steps per ms) remains 5/5 properties
[2024-05-23 12:07:58] [INFO ] Flatten gal took : 1464 ms
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/5 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 4152 rows 889 cols
[2024-05-23 12:07:59] [INFO ] Flatten gal took : 373 ms
[2024-05-23 12:07:59] [INFO ] Computed 27 invariants in 142 ms
[2024-05-23 12:07:59] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:07:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2883459942959710651.gal : 185 ms
[2024-05-23 12:07:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9539462212005266221.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/ReachabilityCardinality2883459942959710651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9539462212005266221.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Loading property file /tmp/ReachabilityCardinality9539462212005266221.prop.
At refinement iteration 2 (OVERLAPS) 746/866 variables, 13/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/866 variables, 746/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/889 variables, 14/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 23/916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/889 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4152/5041 variables, 889/1805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :8 after 9
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :9 after 13
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :13 after 50
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :50 after 63
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :63 after 73
At refinement iteration 9 (INCLUDED_ONLY) 0/5041 variables, 132/1937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :73 after 328
At refinement iteration 10 (INCLUDED_ONLY) 0/5041 variables, 0/1937 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :328 after 534
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5041/5041 variables, and 1937 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5063 ms.
Refiners :[Domain max(s): 889/889 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 889/889 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 746/866 variables, 13/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/866 variables, 746/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/866 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 23/889 variables, 14/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/889 variables, 23/916 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :534 after 3610
[2024-05-23 12:08:08] [INFO ] Deduced a trap composed of 399 places in 1947 ms of which 92 ms to minimize.
[2024-05-23 12:08:10] [INFO ] Deduced a trap composed of 393 places in 1740 ms of which 26 ms to minimize.
SMT process timed out in 11139ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 120 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 87 Pre rules applied. Total rules applied 0 place count 889 transition count 4065
Deduced a syphon composed of 87 places in 5 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 0 with 174 rules applied. Total rules applied 174 place count 802 transition count 4065
Discarding 224 places :
Symmetric choice reduction at 0 with 224 rule applications. Total rules 398 place count 578 transition count 1179
Iterating global reduction 0 with 224 rules applied. Total rules applied 622 place count 578 transition count 1179
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 4 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 666 place count 556 transition count 1157
Applied a total of 666 rules in 507 ms. Remains 556 /889 variables (removed 333) and now considering 1157/4152 (removed 2995) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 556/889 places, 1157/4152 transitions.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3610 after 9038
RANDOM walk for 40000 steps (8 resets) in 625 ms. (63 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 417 ms. (95 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 366 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 335 ms. (119 steps per ms) remains 3/4 properties
FORMULA Anderson-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
// Phase 1: matrix 1157 rows 556 cols
[2024-05-23 12:08:11] [INFO ] Computed 27 invariants in 38 ms
[2024-05-23 12:08:11] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 449/544 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/556 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1157/1713 variables, 556/583 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1713 variables, 132/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1713 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1713 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1713/1713 variables, and 715 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 556/556 constraints, ReadFeed: 132/132 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/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 449/544 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/556 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 12:08:15] [INFO ] Deduced a trap composed of 235 places in 605 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 12:08:15] [INFO ] Deduced a trap composed of 110 places in 441 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1157/1713 variables, 556/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1713 variables, 132/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1713 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1713 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1713 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1713/1713 variables, and 720 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6281 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 556/556 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 8805ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 964 ms.
Support contains 95 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1157/1157 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 556 transition count 1154
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 553 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 552 transition count 1131
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 552 transition count 1131
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 26 place count 543 transition count 1122
Applied a total of 26 rules in 152 ms. Remains 543 /556 variables (removed 13) and now considering 1122/1157 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 543/556 places, 1122/1157 transitions.
RANDOM walk for 40000 steps (8 resets) in 387 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 345 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 220062 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 3
Probabilistic random walk after 220062 steps, saw 173650 distinct states, run finished after 3009 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1122 rows 543 cols
[2024-05-23 12:08:25] [INFO ] Computed 27 invariants in 18 ms
[2024-05-23 12:08:25] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 436/531 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/543 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1122/1665 variables, 543/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 132/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1665 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1665 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1665/1665 variables, and 702 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 543/543 constraints, ReadFeed: 132/132 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/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 436/531 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/543 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1122/1665 variables, 543/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1665 variables, 132/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1665 variables, 3/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
[2024-05-23 12:08:29] [INFO ] Deduced a trap composed of 163 places in 512 ms of which 6 ms to minimize.
SDD size :9038 after 60038
At refinement iteration 9 (INCLUDED_ONLY) 0/1665 variables, 1/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1665 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1665 variables, 0/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1665/1665 variables, and 706 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4913 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 543/543 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 6906ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 580 ms.
Support contains 95 out of 543 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 1122/1122 transitions.
Applied a total of 0 rules in 50 ms. Remains 543 /543 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 543/543 places, 1122/1122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 543/543 places, 1122/1122 transitions.
Applied a total of 0 rules in 80 ms. Remains 543 /543 variables (removed 0) and now considering 1122/1122 (removed 0) transitions.
[2024-05-23 12:08:32] [INFO ] Invariant cache hit.
[2024-05-23 12:08:34] [INFO ] Implicit Places using invariants in 1479 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1508 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/543 places, 1122/1122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 542 transition count 1037
Reduce places removed 85 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 108 rules applied. Total rules applied 193 place count 457 transition count 1014
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 216 place count 434 transition count 1014
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 233 place count 434 transition count 997
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 250 place count 417 transition count 997
Applied a total of 250 rules in 108 ms. Remains 417 /542 variables (removed 125) and now considering 997/1122 (removed 125) transitions.
// Phase 1: matrix 997 rows 417 cols
[2024-05-23 12:08:34] [INFO ] Computed 26 invariants in 29 ms
[2024-05-23 12:08:35] [INFO ] Implicit Places using invariants in 787 ms returned []
[2024-05-23 12:08:35] [INFO ] Invariant cache hit.
[2024-05-23 12:08:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:08:38] [INFO ] Implicit Places using invariants and state equation in 3426 ms returned []
Implicit Place search using SMT with State Equation took 4216 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 417/543 places, 997/1122 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5917 ms. Remains : 417/543 places, 997/1122 transitions.
RANDOM walk for 40000 steps (8 resets) in 389 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 362 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 218623 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 218623 steps, saw 170593 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-23 12:08:41] [INFO ] Invariant cache hit.
[2024-05-23 12:08:41] [INFO ] State equation strengthened by 132 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 311/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/417 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 997/1414 variables, 417/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 132/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1414 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1414/1414 variables, and 575 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1263 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 417/417 constraints, ReadFeed: 132/132 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/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 311/406 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/417 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 997/1414 variables, 417/443 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1414 variables, 132/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1414 variables, 3/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1414 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1414 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1414/1414 variables, and 578 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5321 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 417/417 constraints, ReadFeed: 132/132 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6642ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1489 ms.
Support contains 95 out of 417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 997/997 transitions.
Applied a total of 0 rules in 24 ms. Remains 417 /417 variables (removed 0) and now considering 997/997 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 417/417 places, 997/997 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 417/417 places, 997/997 transitions.
Applied a total of 0 rules in 23 ms. Remains 417 /417 variables (removed 0) and now considering 997/997 (removed 0) transitions.
[2024-05-23 12:08:50] [INFO ] Invariant cache hit.
[2024-05-23 12:08:50] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-05-23 12:08:50] [INFO ] Invariant cache hit.
[2024-05-23 12:08:51] [INFO ] State equation strengthened by 132 read => feed constraints.
[2024-05-23 12:08:53] [INFO ] Implicit Places using invariants and state equation in 3182 ms returned []
Implicit Place search using SMT with State Equation took 3757 ms to find 0 implicit places.
[2024-05-23 12:08:53] [INFO ] Redundant transitions in 73 ms returned []
Running 985 sub problems to find dead transitions.
[2024-05-23 12:08:53] [INFO ] Invariant cache hit.
[2024-05-23 12:08:54] [INFO ] State equation strengthened by 132 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 985 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/417 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 985 unsolved
[2024-05-23 12:09:09] [INFO ] Deduced a trap composed of 147 places in 556 ms of which 8 ms to minimize.
[2024-05-23 12:09:09] [INFO ] Deduced a trap composed of 129 places in 468 ms of which 6 ms to minimize.
[2024-05-23 12:09:10] [INFO ] Deduced a trap composed of 117 places in 448 ms of which 6 ms to minimize.
[2024-05-23 12:09:10] [INFO ] Deduced a trap composed of 118 places in 499 ms of which 7 ms to minimize.
[2024-05-23 12:09:11] [INFO ] Deduced a trap composed of 112 places in 478 ms of which 6 ms to minimize.
[2024-05-23 12:09:11] [INFO ] Deduced a trap composed of 100 places in 459 ms of which 5 ms to minimize.
[2024-05-23 12:09:12] [INFO ] Deduced a trap composed of 97 places in 384 ms of which 4 ms to minimize.
[2024-05-23 12:09:12] [INFO ] Deduced a trap composed of 104 places in 379 ms of which 4 ms to minimize.
[2024-05-23 12:09:12] [INFO ] Deduced a trap composed of 105 places in 357 ms of which 5 ms to minimize.
[2024-05-23 12:09:13] [INFO ] Deduced a trap composed of 115 places in 354 ms of which 4 ms to minimize.
[2024-05-23 12:09:13] [INFO ] Deduced a trap composed of 106 places in 314 ms of which 4 ms to minimize.
[2024-05-23 12:09:14] [INFO ] Deduced a trap composed of 121 places in 321 ms of which 4 ms to minimize.
[2024-05-23 12:09:14] [INFO ] Deduced a trap composed of 136 places in 315 ms of which 4 ms to minimize.
[2024-05-23 12:09:14] [INFO ] Deduced a trap composed of 128 places in 320 ms of which 4 ms to minimize.
[2024-05-23 12:09:15] [INFO ] Deduced a trap composed of 169 places in 317 ms of which 4 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :60038 after 379282
[2024-05-23 12:09:15] [INFO ] Deduced a trap composed of 152 places in 329 ms of which 4 ms to minimize.
[2024-05-23 12:09:15] [INFO ] Deduced a trap composed of 159 places in 390 ms of which 4 ms to minimize.
[2024-05-23 12:09:16] [INFO ] Deduced a trap composed of 126 places in 381 ms of which 4 ms to minimize.
[2024-05-23 12:09:16] [INFO ] Deduced a trap composed of 130 places in 465 ms of which 6 ms to minimize.
[2024-05-23 12:09:17] [INFO ] Deduced a trap composed of 130 places in 393 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 985 unsolved
[2024-05-23 12:09:19] [INFO ] Deduced a trap composed of 184 places in 492 ms of which 6 ms to minimize.
[2024-05-23 12:09:20] [INFO ] Deduced a trap composed of 56 places in 501 ms of which 7 ms to minimize.
[2024-05-23 12:09:20] [INFO ] Deduced a trap composed of 160 places in 445 ms of which 6 ms to minimize.
[2024-05-23 12:09:21] [INFO ] Deduced a trap composed of 95 places in 505 ms of which 7 ms to minimize.
[2024-05-23 12:09:21] [INFO ] Deduced a trap composed of 84 places in 485 ms of which 6 ms to minimize.
[2024-05-23 12:09:22] [INFO ] Deduced a trap composed of 116 places in 492 ms of which 7 ms to minimize.
[2024-05-23 12:09:22] [INFO ] Deduced a trap composed of 75 places in 458 ms of which 6 ms to minimize.
[2024-05-23 12:09:23] [INFO ] Deduced a trap composed of 109 places in 484 ms of which 6 ms to minimize.
[2024-05-23 12:09:23] [INFO ] Deduced a trap composed of 98 places in 493 ms of which 7 ms to minimize.
[2024-05-23 12:09:24] [INFO ] Deduced a trap composed of 120 places in 520 ms of which 17 ms to minimize.
[2024-05-23 12:09:24] [INFO ] Deduced a trap composed of 130 places in 496 ms of which 7 ms to minimize.
[2024-05-23 12:09:25] [INFO ] Deduced a trap composed of 75 places in 492 ms of which 6 ms to minimize.
[2024-05-23 12:09:25] [INFO ] Deduced a trap composed of 116 places in 439 ms of which 7 ms to minimize.
SMT process timed out in 31626ms, After SMT, problems are : Problem set: 0 solved, 985 unsolved
Search for dead transitions found 0 dead transitions in 31644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35517 ms. Remains : 417/417 places, 997/997 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 109 Pre rules applied. Total rules applied 0 place count 417 transition count 888
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 0 with 218 rules applied. Total rules applied 218 place count 308 transition count 888
Applied a total of 218 rules in 51 ms. Remains 308 /417 variables (removed 109) and now considering 888/997 (removed 109) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 888 rows 308 cols
[2024-05-23 12:09:25] [INFO ] Computed 26 invariants in 11 ms
[2024-05-23 12:09:25] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 12:09:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2024-05-23 12:09:26] [INFO ] [Nat]Absence check using 14 positive and 12 generalized place invariants in 15 ms returned sat
[2024-05-23 12:09:27] [INFO ] After 1482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 12:09:28] [INFO ] After 2180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 12:09:28] [INFO ] After 3032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-23 12:09:29] [INFO ] Flatten gal took : 67 ms
[2024-05-23 12:09:29] [INFO ] Flatten gal took : 65 ms
[2024-05-23 12:09:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9036322363871033547.gal : 19 ms
[2024-05-23 12:09:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality478547820121188207.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/ReachabilityCardinality9036322363871033547.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality478547820121188207.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 ...327
Loading property file /tmp/ReachabilityCardinality478547820121188207.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14 after 34
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :34 after 40
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :40 after 59
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :59 after 141
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :141 after 406
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :406 after 769
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :769 after 2337
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2337 after 6908
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :6908 after 19206
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :19206 after 53240
Detected timeout of ITS tools.
[2024-05-23 12:09:44] [INFO ] Flatten gal took : 36 ms
[2024-05-23 12:09:44] [INFO ] Applying decomposition
[2024-05-23 12:09:44] [INFO ] Flatten gal took : 37 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/graph16272338439800979506.txt' '-o' '/tmp/graph16272338439800979506.bin' '-w' '/tmp/graph16272338439800979506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16272338439800979506.bin' '-l' '-1' '-v' '-w' '/tmp/graph16272338439800979506.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:09:44] [INFO ] Decomposing Gal with order
[2024-05-23 12:09:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:09:45] [INFO ] Removed a total of 1750 redundant transitions.
[2024-05-23 12:09:45] [INFO ] Flatten gal took : 203 ms
[2024-05-23 12:09:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 83 ms.
[2024-05-23 12:09:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11926881350292427815.gal : 18 ms
[2024-05-23 12:09:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14605744951077160178.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/ReachabilityCardinality11926881350292427815.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14605744951077160178.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality14605744951077160178.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 314
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :314 after 1245
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1245 after 10412
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 34672 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-23 12:10:00] [INFO ] Flatten gal took : 206 ms
[2024-05-23 12:10:00] [INFO ] Applying decomposition
[2024-05-23 12:10:00] [INFO ] Flatten gal took : 190 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/graph9180850503653242699.txt' '-o' '/tmp/graph9180850503653242699.bin' '-w' '/tmp/graph9180850503653242699.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9180850503653242699.bin' '-l' '-1' '-v' '-w' '/tmp/graph9180850503653242699.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:10:01] [INFO ] Decomposing Gal with order
[2024-05-23 12:10:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:10:02] [INFO ] Removed a total of 7314 redundant transitions.
[2024-05-23 12:10:02] [INFO ] Flatten gal took : 590 ms
[2024-05-23 12:10:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 890 labels/synchronizations in 177 ms.
[2024-05-23 12:10:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11273101768239374101.gal : 32 ms
[2024-05-23 12:10:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2737312813749615042.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/ReachabilityCardinality11273101768239374101.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2737312813749615042.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality2737312813749615042.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :6 after 8
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8 after 29
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :29 after 488
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :488 after 1024
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :1024 after 6.29412e+06
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.29412e+06 after 1.44299e+07
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.44299e+07 after 1.56595e+07
ITS-tools command line returned an error code 137
[2024-05-23 12:27:36] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6674308994478590488
[2024-05-23 12:27:36] [INFO ] Applying decomposition
[2024-05-23 12:27:36] [INFO ] Computing symmetric may disable matrix : 997 transitions.
[2024-05-23 12:27:36] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:27:36] [INFO ] Computing symmetric may enable matrix : 997 transitions.
[2024-05-23 12:27:36] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:27:36] [INFO ] Flatten gal took : 114 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/graph16192281624570380149.txt' '-o' '/tmp/graph16192281624570380149.bin' '-w' '/tmp/graph16192281624570380149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16192281624570380149.bin' '-l' '-1' '-v' '-w' '/tmp/graph16192281624570380149.weights' '-q' '0' '-e' '0.001'
[2024-05-23 12:27:36] [INFO ] Decomposing Gal with order
[2024-05-23 12:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:27:37] [INFO ] Computing Do-Not-Accords matrix : 997 transitions.
[2024-05-23 12:27:37] [INFO ] Removed a total of 1750 redundant transitions.
[2024-05-23 12:27:37] [INFO ] Computation of Completed DNA matrix. took 92 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 12:27:37] [INFO ] Flatten gal took : 107 ms
[2024-05-23 12:27:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 413 labels/synchronizations in 41 ms.
[2024-05-23 12:27:37] [INFO ] Built C files in 716ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6674308994478590488
Running compilation step : cd /tmp/ltsmin6674308994478590488;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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-23 12:27:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality840274267429261234.gal : 27 ms
[2024-05-23 12:27:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17982535999732783086.prop : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality840274267429261234.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17982535999732783086.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality17982535999732783086.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 12
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :12 after 4257
Compilation finished in 6433 ms.
Running link step : cd /tmp/ltsmin6674308994478590488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 84 ms.
Running LTSmin : cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202301==true'
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :4257 after 3.58319e+06
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202301==true'
Running LTSmin : cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202408==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202412==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202412==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin6674308994478590488;'/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' 'AndersonPT12ReachabilityCardinality202301==true'
Detected timeout of ITS tools.
[2024-05-23 12:54:11] [INFO ] Applying decomposition
[2024-05-23 12:54:11] [INFO ] Flatten gal took : 149 ms
[2024-05-23 12:54:11] [INFO ] Decomposing Gal with order
[2024-05-23 12:54:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 12:54:11] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to p3_0_2 in partition [ncs_1_0, p1_1_1, p1_1_2, p1_1_4, p1_1_5, p1_1_6, p1_1_7, p1_1_9],[p1_1_11, p2_1_11, p3_1_11],[p1_1_3, p2_1_3, p3_1_3],[p1_1_8, p3_1_8, cs_1_8],[p1_1_10, p2_1_10, p3_1_10],[slot_F.F.F.F.F.F.F.F.F.F.F.T, slot_F.F.F.F.F.F.F.F.F.F.T.F, slot_F.F.F.F.F.F.F.F.F.T.F.F, cs_1_10, cs_2_10, cs_5_9],[slot_F.F.F.F.F.F.F.F.T.F.F.F, slot_F.F.F.F.F.F.F.T.F.F.F.F, slot_F.F.F.F.F.F.T.F.F.F.F.F, cs_2_7, cs_6_7],[ncs_3_0, p1_3_0, p1_3_2, p1_3_6, p1_3_8, p1_3_9, p1_3_10, cs_3_10],[p1_3_4, p2_3_4],[p1_3_17, p2_3_5, p3_3_5],[p1_3_1, p3_3_1],[p1_3_3, p2_3_3, p3_3_3],[p1_3_7, p3_3_7],[slot_F.F.F.F.F.T.F.F.F.F.F.F, slot_F.F.F.F.T.F.F.F.F.F.F.F, slot_F.F.F.T.F.F.F.F.F.F.F.F, slot_F.F.T.F.F.F.F.F.F.F.F.F, cs_7_4, cs_8_4],[slot_F.T.F.F.F.F.F.F.F.F.F.F, slot_T.F.F.F.F.F.F.F.F.F.F.F, p1_1_0, cs_1_0],[ncs_8_0, p1_8_0, p1_8_1, p1_8_2, p1_8_3, p1_8_5, p1_8_7, p1_8_9, p1_8_10, p2_8_6],[p1_8_8, p2_8_8],[p1_8_16, p2_8_4],[next_0, next_1, next_2],[next_13, next_14],[p1_3_11, p2_3_11],[next_3, next_4],[next_15, next_16],[p1_7_4, p2_7_4, p3_7_4],[next_5, next_6],[next_17, next_18],[p1_7_5, p2_7_5, p3_7_5],[next_7, next_8],[next_19, next_20],[ncs_7_0, ncs_7_8, p1_7_2, p1_7_6, p1_7_7, p1_7_8],[p1_7_11, p2_7_11],[p1_7_0, p2_7_0, p3_7_0],[p1_7_1, p2_7_1, p3_7_1, cs_7_1],[p1_7_9, p2_7_9, p3_7_9],[p1_7_3, p3_7_3],[p1_7_10, p2_7_10, p3_7_10],[next_9, next_10],[next_11, next_12],[next_21, next_22, next_23],[p1_8_11, p2_8_11],[p1_10_11, p2_10_11],[p1_5_11, p2_5_11],[p1_6_11, p2_6_11],[p1_11_11, p2_11_11],[ncs_0_0, ncs_0_3, ncs_0_8, p1_0_0, p1_0_1, p1_0_2, p1_0_3, p1_0_5, p1_0_6, p1_0_9, p3_0_0],[p1_0_10, p1_0_22, p2_0_10],[p1_0_11, p2_0_11, p3_0_11, cs_0_11],[p1_0_4, p1_0_16, p2_0_4, p3_0_4],[p1_0_19, p2_0_7],[p1_0_8, p1_0_20, p2_0_8, p3_0_8],[p2_0_1, p3_0_1, cs_0_1],[ncs_4_0, ncs_4_8, p1_4_0, p1_4_1, p1_4_3, p1_4_6, p1_4_8, p1_4_9],[p1_4_5, p2_4_5],[p1_4_19, p2_4_7],[p1_4_11, p2_4_11, p3_4_11, cs_4_11],[p1_4_2, p3_4_2],[p1_4_4, p3_4_4],[p1_4_10, p3_4_10],[ncs_6_0, ncs_6_9, p1_6_0, p1_6_3, p1_6_5, p1_6_7, p1_6_9, p1_6_10, p2_6_1, cs_6_5],[p1_6_2, p3_6_2],[p1_6_6, p2_6_6],[p1_6_4, p2_6_4, p3_6_4],[p1_6_8, p2_6_8, p3_6_8],[ncs_9_0, ncs_9_2, p1_9_0, p1_9_1, p1_9_3, p1_9_4, p1_9_5, p1_9_6, p1_9_7, p1_9_8, p1_9_9, p1_9_10],[p1_9_11, p2_9_11, p3_9_11, cs_9_11],[p1_9_14, p2_9_2],[ncs_5_0, ncs_5_3, p1_5_0, p1_5_1, p1_5_2, p1_5_3, p1_5_4, p1_5_5, p1_5_6, p1_5_10],[p1_5_8, p3_5_8],[p1_5_9, p2_5_9],[p1_5_19, p2_5_7],[ncs_10_0, ncs_10_8, p1_10_0, p1_10_1, p1_10_2, p1_10_3, p1_10_4, p1_10_6, p1_10_9, p2_10_7],[p1_10_20, p2_10_8, cs_10_8],[p1_10_5, p2_10_5, p3_10_5],[p1_10_10, p2_10_10, p3_10_10],[ncs_11_0, ncs_11_6, p1_11_1, p1_11_2, p1_11_6, p1_11_7, p1_11_8, p1_11_10, p2_11_3, p2_11_9],[p1_11_16, p2_11_4],[p1_11_17, p2_11_5, cs_11_5],[p1_11_12, p2_11_0],[p1_2_3, p3_2_3],[p1_2_20, p2_2_8],[p1_2_18, p2_2_6],[p1_2_7, p1_2_19, p2_2_7],[p1_2_11, p2_2_11, p3_2_11, cs_2_11],[p1_2_0, p2_2_0, p3_2_0],[ncs_2_0, ncs_2_4, p1_2_1, p1_2_2, p1_2_4, p1_2_5, p1_2_9, p2_2_10, p3_2_10],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1234)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 12:54:11] [INFO ] Flatten gal took : 102 ms
[2024-05-23 12:54:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2276831818788735958.gal : 9 ms
[2024-05-23 12:54:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14460716974595804025.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/ReachabilityCardinality2276831818788735958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14460716974595804025.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/ReachabilityCardinality14460716974595804025.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :14 after 17
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :17 after 35
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :35 after 40
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :40 after 56
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :56 after 136
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :136 after 471
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :471 after 768
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :768 after 2455
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :2455 after 6478
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :6478 after 17704
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :17704 after 51056
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :51056 after 124844
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :124844 after 253532
SDD proceeding with computation,3 properties remain. new max is 524288
SDD size :253532 after 2.53185e+09

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="Anderson-PT-12"
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 Anderson-PT-12, 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 r004-smll-171620118400382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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