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.r356-tall-171683760900351.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 ShieldIIPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760900351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-100B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716949522060

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-29 02:25:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 02:25:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:25:23] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2024-05-29 02:25:23] [INFO ] Transformed 7003 places.
[2024-05-29 02:25:23] [INFO ] Transformed 6503 transitions.
[2024-05-29 02:25:23] [INFO ] Found NUPN structural information;
[2024-05-29 02:25:24] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 832 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2777 ms. (14 steps per ms) remains 11/16 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 725 ms. (55 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 11/11 properties
[2024-05-29 02:25:25] [INFO ] Flatten gal took : 736 ms
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
[2024-05-29 02:25:26] [INFO ] Flatten gal took : 355 ms
// Phase 1: matrix 6503 rows 7003 cols
[2024-05-29 02:25:26] [INFO ] Computed 901 invariants in 106 ms
[2024-05-29 02:25:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5227784927205464691.gal : 118 ms
[2024-05-29 02:25:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16536293735272594805.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/ReachabilityCardinality5227784927205464691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16536293735272594805.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality16536293735272594805.prop.
At refinement iteration 2 (OVERLAPS) 4537/4722 variables, 570/755 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4722 variables, 4537/5292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4722 variables, 0/5292 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2281/7003 variables, 331/5623 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7003 variables, 2281/7904 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7003 variables, 0/7904 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 5335ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 185 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1554 transitions
Trivial Post-agglo rules discarded 1554 transitions
Performed 1554 trivial Post agglomeration. Transition count delta: 1554
Iterating post reduction 0 with 1554 rules applied. Total rules applied 1554 place count 7003 transition count 4949
Reduce places removed 1554 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 1 with 1604 rules applied. Total rules applied 3158 place count 5449 transition count 4899
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 2 with 50 rules applied. Total rules applied 3208 place count 5399 transition count 4899
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 413 Pre rules applied. Total rules applied 3208 place count 5399 transition count 4486
Deduced a syphon composed of 413 places in 21 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 826 rules applied. Total rules applied 4034 place count 4986 transition count 4486
Discarding 665 places :
Symmetric choice reduction at 3 with 665 rule applications. Total rules 4699 place count 4321 transition count 3821
Iterating global reduction 3 with 665 rules applied. Total rules applied 5364 place count 4321 transition count 3821
Performed 263 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 263 Pre rules applied. Total rules applied 5364 place count 4321 transition count 3558
Deduced a syphon composed of 263 places in 15 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 5890 place count 4058 transition count 3558
Performed 1626 Post agglomeration using F-continuation condition.Transition count delta: 1626
Deduced a syphon composed of 1626 places in 5 ms
Reduce places removed 1626 places and 0 transitions.
Iterating global reduction 3 with 3252 rules applied. Total rules applied 9142 place count 2432 transition count 1932
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9344 place count 2331 transition count 1985
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9546 place count 2230 transition count 2036
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 59 places in 6 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 9664 place count 2171 transition count 2069
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9665 place count 2171 transition count 2068
Free-agglomeration rule applied 14 times.
Iterating global reduction 4 with 14 rules applied. Total rules applied 9679 place count 2171 transition count 2054
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 9693 place count 2157 transition count 2054
Partial Free-agglomeration rule applied 95 times.
Drop transitions (Partial Free agglomeration) removed 95 transitions
Iterating global reduction 5 with 95 rules applied. Total rules applied 9788 place count 2157 transition count 2054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 9789 place count 2156 transition count 2053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 9790 place count 2155 transition count 2053
Applied a total of 9790 rules in 3122 ms. Remains 2155 /7003 variables (removed 4848) and now considering 2053/6503 (removed 4450) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3144 ms. Remains : 2155/7003 places, 2053/6503 transitions.
RANDOM walk for 40000 steps (8 resets) in 1427 ms. (28 steps per ms) remains 10/11 properties
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 678 ms. (58 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 488 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 472 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 493 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 542 ms. (73 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 120682 steps, run timeout after 6001 ms. (steps per millisecond=20 ) properties seen :0 out of 10
Probabilistic random walk after 120682 steps, saw 79922 distinct states, run finished after 6004 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 2053 rows 2155 cols
[2024-05-29 02:25:42] [INFO ] Computed 900 invariants in 8 ms
[2024-05-29 02:25:42] [INFO ] State equation strengthened by 657 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1207/1352 variables, 533/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1352 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 705/2057 variables, 322/855 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2057 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1989/4046 variables, 2057/2912 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4046 variables, 655/3567 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4046 variables, 0/3567 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 90/4136 variables, 55/3622 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4136 variables, 25/3647 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4136 variables, 1/3648 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4136 variables, 0/3648 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/4138 variables, 2/3650 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4138 variables, 2/3652 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4138 variables, 0/3652 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 4/4142 variables, 2/3654 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4142 variables, 0/3654 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 51/4193 variables, 30/3684 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4193 variables, 8/3692 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4193 variables, 1/3693 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4193 variables, 0/3693 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 5/4198 variables, 5/3698 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4198 variables, 3/3701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4198 variables, 0/3701 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 2/4200 variables, 1/3702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4200 variables, 0/3702 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 8/4208 variables, 8/3710 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4208 variables, 2/3712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4208 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 0/4208 variables, 0/3712 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4208/4208 variables, and 3712 constraints, problems are : Problem set: 0 solved, 10 unsolved in 16325 ms.
Refiners :[Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 2155/2155 constraints, ReadFeed: 657/657 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1207/1352 variables, 533/533 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 69
[2024-05-29 02:26:00] [INFO ] Deduced a trap composed of 7 places in 535 ms of which 64 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :129 after 933
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :933 after 4.45318e+08
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :4.45318e+08 after 4.68295e+19
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :4.68295e+19 after 4.47767e+40
[2024-05-29 02:26:00] [INFO ] Deduced a trap composed of 8 places in 553 ms of which 13 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :4.47767e+40 after 5.20516e+94
[2024-05-29 02:26:01] [INFO ] Deduced a trap composed of 8 places in 455 ms of which 7 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :5.20516e+94 after 6.95315e+274
[2024-05-29 02:26:02] [INFO ] Deduced a trap composed of 16 places in 914 ms of which 5 ms to minimize.
Invariant property ShieldIIPt-PT-100B-ReachabilityFireability-2024-13 does not hold.
FORMULA ShieldIIPt-PT-100B-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2024-05-29 02:26:02] [INFO ] Deduced a trap composed of 13 places in 850 ms of which 9 ms to minimize.
[2024-05-29 02:26:03] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 5 ms to minimize.
[2024-05-29 02:26:03] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 5 ms to minimize.
[2024-05-29 02:26:03] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 4 ms to minimize.
[2024-05-29 02:26:03] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-29 02:26:04] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 3 ms to minimize.
[2024-05-29 02:26:04] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-29 02:26:04] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-29 02:26:04] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-29 02:26:04] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-29 02:26:04] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1352 variables, 15/548 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1352 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 705/2057 variables, 322/870 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 02:26:05] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 2 ms to minimize.
[2024-05-29 02:26:05] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 2 ms to minimize.
[2024-05-29 02:26:05] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-29 02:26:05] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-29 02:26:05] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-29 02:26:05] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 02:26:06] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2024-05-29 02:26:06] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-29 02:26:06] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-05-29 02:26:06] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2024-05-29 02:26:06] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2057 variables, 11/881 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2057 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1989/4046 variables, 2057/2938 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4046 variables, 655/3593 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4046 variables, 5/3598 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 02:26:11] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 4 ms to minimize.
[2024-05-29 02:26:12] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 4 ms to minimize.
[2024-05-29 02:26:12] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 4 ms to minimize.
[2024-05-29 02:26:12] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 4 ms to minimize.
[2024-05-29 02:26:12] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 4 ms to minimize.
[2024-05-29 02:26:13] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 4 ms to minimize.
[2024-05-29 02:26:14] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 4 ms to minimize.
[2024-05-29 02:26:14] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/4046 variables, 8/3606 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 02:26:15] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 4 ms to minimize.
[2024-05-29 02:26:16] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4046 variables, 2/3608 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4046 variables, 0/3608 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 90/4136 variables, 55/3663 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4136 variables, 25/3688 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4136 variables, 1/3689 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4136 variables, 4/3693 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 02:26:28] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 3 ms to minimize.
[2024-05-29 02:26:28] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-29 02:26:28] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 3 ms to minimize.
[2024-05-29 02:26:29] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 3 ms to minimize.
[2024-05-29 02:26:33] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4136 variables, 5/3698 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4136 variables, 0/3698 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/4138 variables, 2/3700 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4138 variables, 2/3702 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-29 02:26:43] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4138/4208 variables, and 3703 constraints, problems are : Problem set: 1 solved, 9 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 882/900 constraints, State Equation: 2114/2155 constraints, ReadFeed: 656/657 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 42/42 constraints]
After SMT, in 61495ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 143 out of 2155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2155/2155 places, 2053/2053 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 2155 transition count 2044
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 2146 transition count 2044
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 18 place count 2146 transition count 2031
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 44 place count 2133 transition count 2031
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 88 place count 2111 transition count 2009
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 102 place count 2104 transition count 2015
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 2104 transition count 2015
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 2103 transition count 2014
Applied a total of 105 rules in 384 ms. Remains 2103 /2155 variables (removed 52) and now considering 2014/2053 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2103/2155 places, 2014/2053 transitions.
RANDOM walk for 40000 steps (8 resets) in 1173 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 661 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 454 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 520 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 514 ms. (77 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 562 ms. (71 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 458 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 566 ms. (70 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 63620 steps, run timeout after 3003 ms. (steps per millisecond=21 ) properties seen :0 out of 9
Probabilistic random walk after 63620 steps, saw 41461 distinct states, run finished after 3003 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 2014 rows 2103 cols
[2024-05-29 02:26:49] [INFO ] Computed 900 invariants in 7 ms
[2024-05-29 02:26:49] [INFO ] State equation strengthened by 689 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1186/1329 variables, 533/533 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1329 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 679/2008 variables, 322/855 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2008 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1953/3961 variables, 2008/2863 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3961 variables, 688/3551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3961 variables, 0/3551 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 90/4051 variables, 55/3606 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4051 variables, 25/3631 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4051 variables, 1/3632 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4051 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 2/4053 variables, 2/3634 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4053 variables, 2/3636 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4053 variables, 0/3636 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 4/4057 variables, 2/3638 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4057 variables, 0/3638 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 49/4106 variables, 30/3668 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4106 variables, 10/3678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4106 variables, 0/3678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/4108 variables, 3/3681 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4108 variables, 2/3683 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4108 variables, 0/3683 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 2/4110 variables, 1/3684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4110 variables, 0/3684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 7/4117 variables, 6/3690 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4117 variables, 2/3692 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4117 variables, 0/3692 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 0/4117 variables, 0/3692 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4117/4117 variables, and 3692 constraints, problems are : Problem set: 0 solved, 9 unsolved in 13074 ms.
Refiners :[Positive P Invariants (semi-flows): 900/900 constraints, State Equation: 2103/2103 constraints, ReadFeed: 689/689 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1186/1329 variables, 533/533 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:03] [INFO ] Deduced a trap composed of 8 places in 460 ms of which 7 ms to minimize.
[2024-05-29 02:27:03] [INFO ] Deduced a trap composed of 7 places in 416 ms of which 7 ms to minimize.
[2024-05-29 02:27:04] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 9 ms to minimize.
[2024-05-29 02:27:04] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 6 ms to minimize.
[2024-05-29 02:27:04] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 7 ms to minimize.
[2024-05-29 02:27:05] [INFO ] Deduced a trap composed of 8 places in 403 ms of which 6 ms to minimize.
[2024-05-29 02:27:05] [INFO ] Deduced a trap composed of 13 places in 403 ms of which 6 ms to minimize.
[2024-05-29 02:27:05] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 3 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 11 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-29 02:27:06] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1329 variables, 16/549 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:07] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1329 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1329 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 679/2008 variables, 322/872 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:08] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 2 ms to minimize.
[2024-05-29 02:27:08] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 2 ms to minimize.
[2024-05-29 02:27:08] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 2 ms to minimize.
[2024-05-29 02:27:08] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2008 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2008 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1953/3961 variables, 2008/2884 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3961 variables, 688/3572 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3961 variables, 5/3577 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:12] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 4 ms to minimize.
[2024-05-29 02:27:13] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3961 variables, 2/3579 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3961 variables, 0/3579 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 90/4051 variables, 55/3634 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4051 variables, 25/3659 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4051 variables, 1/3660 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4051 variables, 4/3664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:31] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 7 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 7 ms to minimize.
[2024-05-29 02:27:32] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 5 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 7 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 6 ms to minimize.
[2024-05-29 02:27:33] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 6 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 6 ms to minimize.
[2024-05-29 02:27:34] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 7 ms to minimize.
[2024-05-29 02:27:35] [INFO ] Deduced a trap composed of 14 places in 273 ms of which 5 ms to minimize.
[2024-05-29 02:27:42] [INFO ] Deduced a trap composed of 10 places in 6259 ms of which 3 ms to minimize.
[2024-05-29 02:27:43] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4051 variables, 11/3675 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:27:46] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 4 ms to minimize.
[2024-05-29 02:27:46] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 9 ms to minimize.
[2024-05-29 02:27:47] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4051 variables, 3/3678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4051 variables, 0/3678 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/4053 variables, 2/3680 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4053 variables, 2/3682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4053 variables, 0/3682 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 4/4057 variables, 2/3684 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 02:28:03] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/4057 variables, 1/3685 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4057 variables, 0/3685 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 49/4106 variables, 30/3715 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4106 variables, 10/3725 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4106 variables, 0/3725 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 2/4108 variables, 3/3728 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4108 variables, 2/3730 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4108/4117 variables, and 3730 constraints, problems are : Problem set: 0 solved, 9 unsolved in 75019 ms.
Refiners :[Positive P Invariants (semi-flows): 897/900 constraints, State Equation: 2097/2103 constraints, ReadFeed: 689/689 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 38/38 constraints]
After SMT, in 88158ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 143 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 2014/2014 transitions.
Applied a total of 0 rules in 102 ms. Remains 2103 /2103 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 2103/2103 places, 2014/2014 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 2014/2014 transitions.
Applied a total of 0 rules in 68 ms. Remains 2103 /2103 variables (removed 0) and now considering 2014/2014 (removed 0) transitions.
[2024-05-29 02:28:17] [INFO ] Invariant cache hit.
[2024-05-29 02:28:18] [INFO ] Implicit Places using invariants in 1148 ms returned []
[2024-05-29 02:28:18] [INFO ] Invariant cache hit.
[2024-05-29 02:28:19] [INFO ] State equation strengthened by 689 read => feed constraints.
[2024-05-29 02:28:37] [INFO ] Implicit Places using invariants and state equation in 19065 ms returned []
Implicit Place search using SMT with State Equation took 20228 ms to find 0 implicit places.
[2024-05-29 02:28:37] [INFO ] Redundant transitions in 133 ms returned []
Running 2005 sub problems to find dead transitions.
[2024-05-29 02:28:38] [INFO ] Invariant cache hit.
[2024-05-29 02:28:38] [INFO ] State equation strengthened by 689 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2097 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 2005 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2097/4117 variables, and 50 constraints, problems are : Problem set: 0 solved, 2005 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 50/900 constraints, State Equation: 0/2103 constraints, ReadFeed: 0/689 constraints, PredecessorRefiner: 2005/2005 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2005 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2097 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 2005 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 timeout
1)
(s1741 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2097/4117 variables, and 50 constraints, problems are : Problem set: 0 solved, 2005 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 50/900 constraints, State Equation: 0/2103 constraints, ReadFeed: 0/689 constraints, PredecessorRefiner: 0/2005 constraints, Known Traps: 0/0 constraints]
After SMT, in 61083ms problems are : Problem set: 0 solved, 2005 unsolved
Search for dead transitions found 0 dead transitions in 61108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81561 ms. Remains : 2103/2103 places, 2014/2014 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 385 times.
Drop transitions (Partial Free agglomeration) removed 385 transitions
Iterating global reduction 0 with 385 rules applied. Total rules applied 385 place count 2103 transition count 2014
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 392 place count 2103 transition count 2007
Applied a total of 392 rules in 209 ms. Remains 2103 /2103 variables (removed 0) and now considering 2007/2014 (removed 7) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 2007 rows 2103 cols
[2024-05-29 02:29:39] [INFO ] Computed 900 invariants in 9 ms
[2024-05-29 02:29:40] [INFO ] [Real]Absence check using 900 positive place invariants in 194 ms returned sat
[2024-05-29 02:29:40] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 02:29:40] [INFO ] [Nat]Absence check using 900 positive place invariants in 161 ms returned sat
[2024-05-29 02:29:42] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 02:29:42] [INFO ] State equation strengthened by 358 read => feed constraints.
[2024-05-29 02:29:45] [INFO ] After 2376ms SMT Verify possible using 358 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-29 02:29:45] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 3 ms to minimize.
[2024-05-29 02:29:45] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-05-29 02:29:45] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 3 ms to minimize.
[2024-05-29 02:29:46] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 3 ms to minimize.
[2024-05-29 02:29:46] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 3 ms to minimize.
[2024-05-29 02:29:46] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 3 ms to minimize.
[2024-05-29 02:29:47] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 4 ms to minimize.
[2024-05-29 02:29:47] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 4 ms to minimize.
[2024-05-29 02:29:47] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 4 ms to minimize.
[2024-05-29 02:29:47] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 3 ms to minimize.
[2024-05-29 02:29:48] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 4 ms to minimize.
[2024-05-29 02:29:48] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
[2024-05-29 02:29:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3407 ms
[2024-05-29 02:29:49] [INFO ] Deduced a trap composed of 5 places in 622 ms of which 9 ms to minimize.
[2024-05-29 02:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 813 ms
[2024-05-29 02:29:52] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 4 ms to minimize.
[2024-05-29 02:29:52] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 5 ms to minimize.
[2024-05-29 02:29:52] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 5 ms to minimize.
[2024-05-29 02:29:53] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 4 ms to minimize.
[2024-05-29 02:29:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1520 ms
[2024-05-29 02:29:53] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 5 ms to minimize.
[2024-05-29 02:29:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2024-05-29 02:29:54] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 5 ms to minimize.
[2024-05-29 02:29:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 400 ms
TRAPS : Iteration 1
[2024-05-29 02:29:58] [INFO ] Deduced a trap composed of 14 places in 256 ms of which 4 ms to minimize.
[2024-05-29 02:29:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2024-05-29 02:30:01] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 4 ms to minimize.
[2024-05-29 02:30:02] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 5 ms to minimize.
[2024-05-29 02:30:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 767 ms
TRAPS : Iteration 2
[2024-05-29 02:30:05] [INFO ] Deduced a trap composed of 7 places in 509 ms of which 6 ms to minimize.
[2024-05-29 02:30:05] [INFO ] Deduced a trap composed of 7 places in 507 ms of which 6 ms to minimize.
[2024-05-29 02:30:06] [INFO ] Deduced a trap composed of 15 places in 420 ms of which 5 ms to minimize.
[2024-05-29 02:30:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1842 ms
[2024-05-29 02:30:07] [INFO ] Deduced a trap composed of 15 places in 605 ms of which 11 ms to minimize.
[2024-05-29 02:30:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 761 ms
[2024-05-29 02:30:10] [INFO ] Deduced a trap composed of 17 places in 346 ms of which 6 ms to minimize.
[2024-05-29 02:30:10] [INFO ] Deduced a trap composed of 17 places in 345 ms of which 5 ms to minimize.
[2024-05-29 02:30:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 995 ms
TRAPS : Iteration 3
[2024-05-29 02:30:14] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 6 ms to minimize.
[2024-05-29 02:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
TRAPS : Iteration 4
[2024-05-29 02:30:17] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 5 ms to minimize.
[2024-05-29 02:30:17] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 5 ms to minimize.
[2024-05-29 02:30:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 786 ms
[2024-05-29 02:30:18] [INFO ] Deduced a trap composed of 7 places in 677 ms of which 10 ms to minimize.
[2024-05-29 02:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1706 ms
TRAPS : Iteration 5
[2024-05-29 02:30:26] [INFO ] After 44118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-29 02:30:31] [INFO ] After 51220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 52212 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-29 02:30:31] [INFO ] Flatten gal took : 178 ms
[2024-05-29 02:30:31] [INFO ] Applying decomposition
[2024-05-29 02:30:31] [INFO ] Flatten gal took : 162 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/graph11976141180785414616.txt' '-o' '/tmp/graph11976141180785414616.bin' '-w' '/tmp/graph11976141180785414616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11976141180785414616.bin' '-l' '-1' '-v' '-w' '/tmp/graph11976141180785414616.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:30:32] [INFO ] Decomposing Gal with order
[2024-05-29 02:30:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:30:35] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 02:30:35] [INFO ] Flatten gal took : 358 ms
[2024-05-29 02:30:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 27 ms.
[2024-05-29 02:30:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8205374716169425143.gal : 96 ms
[2024-05-29 02:30:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18022793229646890377.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/ReachabilityCardinality8205374716169425143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18022793229646890377.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/ReachabilityCardinality18022793229646890377.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :1 after 7266
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :7266 after 2.80758e+30
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :2.80758e+30 after 7.01887e+114
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :7.01887e+114 after 4.18229e+294
ITS-tools command line returned an error code 137
[2024-05-29 02:38:49] [INFO ] Flatten gal took : 80 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5214172845334423789
[2024-05-29 02:38:49] [INFO ] Too many transitions (2014) to apply POR reductions. Disabling POR matrices.
[2024-05-29 02:38:50] [INFO ] Applying decomposition
[2024-05-29 02:38:50] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5214172845334423789
Running compilation step : cd /tmp/ltsmin5214172845334423789;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '80' '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-29 02:38:50] [INFO ] Flatten gal took : 80 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/graph6353860573272698119.txt' '-o' '/tmp/graph6353860573272698119.bin' '-w' '/tmp/graph6353860573272698119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6353860573272698119.bin' '-l' '-1' '-v' '-w' '/tmp/graph6353860573272698119.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:38:50] [INFO ] Decomposing Gal with order
[2024-05-29 02:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:38:50] [INFO ] Removed a total of 1626 redundant transitions.
[2024-05-29 02:38:50] [INFO ] Flatten gal took : 108 ms
[2024-05-29 02:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 690 labels/synchronizations in 79 ms.
[2024-05-29 02:38:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4415037677675432361.gal : 112 ms
[2024-05-29 02:38:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15664676943837844753.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/ReachabilityFireability4415037677675432361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15664676943837844753.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/ReachabilityFireability15664676943837844753.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :3 after 91
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :91 after 171
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :171 after 8363
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :8363 after 1.99595e+06
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :1.99595e+06 after 7.83843e+10
Compilation finished in 6036 ms.
Running link step : cd /tmp/ltsmin5214172845334423789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202400==true'
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2.52611e+24 after 2.51884e+45
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202401==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202404==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202405==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202409==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202411==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202411==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202414==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202414==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202415==true'
WARNING : LTSmin timed out (>44 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202415==true'
Retrying LTSmin with larger timeout 3200 s
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202400==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202400==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202401==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202401==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202403==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202403==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202404==true'
Detected timeout of ITS tools.
[2024-05-29 03:03:20] [INFO ] Applying decomposition
[2024-05-29 03:03:20] [INFO ] Flatten gal took : 165 ms
[2024-05-29 03:03:20] [INFO ] Decomposing Gal with order
[2024-05-29 03:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:03:22] [INFO ] Removed a total of 2027 redundant transitions.
[2024-05-29 03:03:22] [INFO ] Flatten gal took : 365 ms
[2024-05-29 03:03:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 1380 labels/synchronizations in 620 ms.
[2024-05-29 03:03:28] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13832936834055134200.gal : 124 ms
[2024-05-29 03:03:28] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability573528978803454836.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13832936834055134200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability573528978803454836.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/ReachabilityFireability573528978803454836.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :12 after 12
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :12 after 119
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :119 after 9.40612e+11
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :9.40612e+11 after 1.15199e+17
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202405==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202405==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202409==true'
WARNING : LTSmin timed out (>355 s) on command cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202409==true'
Running LTSmin : cd /tmp/ltsmin5214172845334423789;'/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' 'ShieldIIPtPT100BReachabilityFireability202411==true'

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

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