fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r233-tall-165286037100120
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ShieldIIPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9247.407 3600000.00 12787041.00 1065.80 T?FFFTTTFT?FTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r233-tall-165286037100120.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ShieldIIPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037100120
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 18:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 18:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 29 18:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 29 18:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 29 18:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 686K May 10 09:34 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655072299175

Running Version 0
[2022-06-12 22:18:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:18:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:18:20] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-06-12 22:18:21] [INFO ] Transformed 2803 places.
[2022-06-12 22:18:21] [INFO ] Transformed 2603 transitions.
[2022-06-12 22:18:21] [INFO ] Found NUPN structural information;
[2022-06-12 22:18:21] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 301 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2022-06-12 22:18:21] [INFO ] Computed 361 place invariants in 42 ms
[2022-06-12 22:18:22] [INFO ] [Real]Absence check using 361 positive place invariants in 177 ms returned sat
[2022-06-12 22:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:23] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2022-06-12 22:18:24] [INFO ] Deduced a trap composed of 20 places in 773 ms of which 8 ms to minimize.
[2022-06-12 22:18:25] [INFO ] Deduced a trap composed of 21 places in 759 ms of which 5 ms to minimize.
[2022-06-12 22:18:26] [INFO ] Deduced a trap composed of 30 places in 725 ms of which 5 ms to minimize.
[2022-06-12 22:18:26] [INFO ] Deduced a trap composed of 24 places in 620 ms of which 2 ms to minimize.
[2022-06-12 22:18:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 22:18:27] [INFO ] [Real]Absence check using 361 positive place invariants in 211 ms returned sat
[2022-06-12 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:30] [INFO ] [Real]Absence check using state equation in 2978 ms returned sat
[2022-06-12 22:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:31] [INFO ] [Nat]Absence check using 361 positive place invariants in 225 ms returned sat
[2022-06-12 22:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:34] [INFO ] [Nat]Absence check using state equation in 3327 ms returned sat
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 21 places in 590 ms of which 2 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 29 places in 584 ms of which 1 ms to minimize.
[2022-06-12 22:18:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-12 22:18:36] [INFO ] [Real]Absence check using 361 positive place invariants in 145 ms returned unsat
[2022-06-12 22:18:37] [INFO ] [Real]Absence check using 361 positive place invariants in 157 ms returned sat
[2022-06-12 22:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:38] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2022-06-12 22:18:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 156 ms returned sat
[2022-06-12 22:18:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:42] [INFO ] [Nat]Absence check using state equation in 3817 ms returned sat
[2022-06-12 22:18:43] [INFO ] Deduced a trap composed of 28 places in 922 ms of which 3 ms to minimize.
[2022-06-12 22:18:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 22:18:44] [INFO ] [Real]Absence check using 361 positive place invariants in 150 ms returned sat
[2022-06-12 22:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:45] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2022-06-12 22:18:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:45] [INFO ] [Nat]Absence check using 361 positive place invariants in 150 ms returned sat
[2022-06-12 22:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:47] [INFO ] [Nat]Absence check using state equation in 1196 ms returned sat
[2022-06-12 22:18:47] [INFO ] Deduced a trap composed of 18 places in 731 ms of which 2 ms to minimize.
[2022-06-12 22:18:48] [INFO ] Deduced a trap composed of 20 places in 702 ms of which 2 ms to minimize.
[2022-06-12 22:18:49] [INFO ] Deduced a trap composed of 19 places in 683 ms of which 2 ms to minimize.
[2022-06-12 22:18:50] [INFO ] Deduced a trap composed of 28 places in 663 ms of which 1 ms to minimize.
[2022-06-12 22:18:50] [INFO ] Deduced a trap composed of 29 places in 675 ms of which 2 ms to minimize.
[2022-06-12 22:18:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2022-06-12 22:18:51] [INFO ] [Real]Absence check using 361 positive place invariants in 160 ms returned sat
[2022-06-12 22:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:53] [INFO ] [Real]Absence check using state equation in 2164 ms returned sat
[2022-06-12 22:18:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 159 ms returned sat
[2022-06-12 22:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:56] [INFO ] [Nat]Absence check using state equation in 1965 ms returned sat
[2022-06-12 22:18:57] [INFO ] Deduced a trap composed of 18 places in 761 ms of which 1 ms to minimize.
[2022-06-12 22:18:57] [INFO ] Deduced a trap composed of 19 places in 728 ms of which 2 ms to minimize.
[2022-06-12 22:18:58] [INFO ] Deduced a trap composed of 30 places in 724 ms of which 2 ms to minimize.
[2022-06-12 22:18:59] [INFO ] Deduced a trap composed of 21 places in 709 ms of which 2 ms to minimize.
[2022-06-12 22:18:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-12 22:19:00] [INFO ] [Real]Absence check using 361 positive place invariants in 149 ms returned sat
[2022-06-12 22:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:01] [INFO ] [Real]Absence check using state equation in 1164 ms returned sat
[2022-06-12 22:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 148 ms returned sat
[2022-06-12 22:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:04] [INFO ] [Nat]Absence check using state equation in 3073 ms returned sat
[2022-06-12 22:19:05] [INFO ] Deduced a trap composed of 24 places in 679 ms of which 2 ms to minimize.
[2022-06-12 22:19:06] [INFO ] Deduced a trap composed of 30 places in 677 ms of which 2 ms to minimize.
[2022-06-12 22:19:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-12 22:19:06] [INFO ] [Real]Absence check using 361 positive place invariants in 169 ms returned sat
[2022-06-12 22:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:09] [INFO ] [Real]Absence check using state equation in 2296 ms returned sat
[2022-06-12 22:19:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:09] [INFO ] [Nat]Absence check using 361 positive place invariants in 175 ms returned sat
[2022-06-12 22:19:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:11] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2022-06-12 22:19:12] [INFO ] Deduced a trap composed of 28 places in 700 ms of which 1 ms to minimize.
[2022-06-12 22:19:13] [INFO ] Deduced a trap composed of 35 places in 675 ms of which 1 ms to minimize.
[2022-06-12 22:19:14] [INFO ] Deduced a trap composed of 34 places in 697 ms of which 2 ms to minimize.
[2022-06-12 22:19:14] [INFO ] Deduced a trap composed of 32 places in 664 ms of which 1 ms to minimize.
[2022-06-12 22:19:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-12 22:19:15] [INFO ] [Real]Absence check using 361 positive place invariants in 158 ms returned sat
[2022-06-12 22:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:16] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2022-06-12 22:19:17] [INFO ] Deduced a trap composed of 31 places in 727 ms of which 2 ms to minimize.
[2022-06-12 22:19:18] [INFO ] Deduced a trap composed of 18 places in 696 ms of which 2 ms to minimize.
[2022-06-12 22:19:19] [INFO ] Deduced a trap composed of 22 places in 676 ms of which 2 ms to minimize.
[2022-06-12 22:19:19] [INFO ] Deduced a trap composed of 30 places in 660 ms of which 1 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 17 places in 1492 ms of which 3 ms to minimize.
[2022-06-12 22:19:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2022-06-12 22:19:21] [INFO ] [Real]Absence check using 361 positive place invariants in 234 ms returned sat
[2022-06-12 22:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:26] [INFO ] [Real]Absence check using state equation in 4461 ms returned unknown
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 201 out of 2803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 533 transitions
Trivial Post-agglo rules discarded 533 transitions
Performed 533 trivial Post agglomeration. Transition count delta: 533
Iterating post reduction 0 with 533 rules applied. Total rules applied 533 place count 2803 transition count 2070
Reduce places removed 533 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 588 rules applied. Total rules applied 1121 place count 2270 transition count 2015
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 1176 place count 2215 transition count 2015
Performed 171 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 171 Pre rules applied. Total rules applied 1176 place count 2215 transition count 1844
Deduced a syphon composed of 171 places in 8 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 3 with 342 rules applied. Total rules applied 1518 place count 2044 transition count 1844
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 1754 place count 1808 transition count 1608
Iterating global reduction 3 with 236 rules applied. Total rules applied 1990 place count 1808 transition count 1608
Performed 86 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 86 Pre rules applied. Total rules applied 1990 place count 1808 transition count 1522
Deduced a syphon composed of 86 places in 10 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 2162 place count 1722 transition count 1522
Performed 582 Post agglomeration using F-continuation condition.Transition count delta: 582
Deduced a syphon composed of 582 places in 4 ms
Reduce places removed 582 places and 0 transitions.
Iterating global reduction 3 with 1164 rules applied. Total rules applied 3326 place count 1140 transition count 940
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 92 places in 5 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 3510 place count 1048 transition count 984
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 3517 place count 1048 transition count 977
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 3524 place count 1041 transition count 977
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 4 with 32 rules applied. Total rules applied 3556 place count 1041 transition count 977
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3557 place count 1040 transition count 976
Applied a total of 3557 rules in 865 ms. Remains 1040 /2803 variables (removed 1763) and now considering 976/2603 (removed 1627) transitions.
Finished structural reductions, in 1 iterations. Remains : 1040/2803 places, 976/2603 transitions.
[2022-06-12 22:19:27] [INFO ] Flatten gal took : 139 ms
[2022-06-12 22:19:27] [INFO ] Flatten gal took : 75 ms
[2022-06-12 22:19:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3887530111830736086.gal : 40 ms
[2022-06-12 22:19:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3922199709796428971.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3887530111830736086.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3922199709796428971.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3887530111830736086.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3922199709796428971.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3922199709796428971.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 28
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :28 after 220
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :220 after 3244
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :3244 after 2.1384e+06
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2.1384e+06 after 8.08316e+11
Detected timeout of ITS tools.
[2022-06-12 22:19:42] [INFO ] Flatten gal took : 66 ms
[2022-06-12 22:19:42] [INFO ] Applying decomposition
[2022-06-12 22:19:42] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7905942794685670926.txt, -o, /tmp/graph7905942794685670926.bin, -w, /tmp/graph7905942794685670926.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7905942794685670926.bin, -l, -1, -v, -w, /tmp/graph7905942794685670926.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:19:43] [INFO ] Decomposing Gal with order
[2022-06-12 22:19:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:19:43] [INFO ] Removed a total of 533 redundant transitions.
[2022-06-12 22:19:43] [INFO ] Flatten gal took : 130 ms
[2022-06-12 22:19:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 102 ms.
[2022-06-12 22:19:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12362538269897208016.gal : 19 ms
[2022-06-12 22:19:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5112178198368806192.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12362538269897208016.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5112178198368806192.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12362538269897208016.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5112178198368806192.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5112178198368806192.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 9
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :9 after 18009
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :18009 after 3.84912e+09
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :3.84912e+09 after 2.26277e+19
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-15 does not hold.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-12 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-09 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-040B-ReachabilityFireability-00 is true.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :4.54559e+29 after 6.39911e+61
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5720089271369322163
[2022-06-12 22:19:58] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5720089271369322163
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5720089271369322163]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5720089271369322163] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5720089271369322163] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6529 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 806324 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4227 ms. (steps per millisecond=236 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4126 ms. (steps per millisecond=242 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4118 ms. (steps per millisecond=242 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4887 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 2050194 steps, run timeout after 30001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 2050194 steps, saw 1306949 distinct states, run finished after 30001 ms. (steps per millisecond=68 ) properties seen :{}
Running SMT prover for 5 properties.
// Phase 1: matrix 976 rows 1040 cols
[2022-06-12 22:20:58] [INFO ] Computed 361 place invariants in 16 ms
[2022-06-12 22:20:58] [INFO ] [Real]Absence check using 361 positive place invariants in 84 ms returned sat
[2022-06-12 22:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:59] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-06-12 22:20:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:59] [INFO ] [Nat]Absence check using 361 positive place invariants in 79 ms returned sat
[2022-06-12 22:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:59] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2022-06-12 22:20:59] [INFO ] State equation strengthened by 218 read => feed constraints.
[2022-06-12 22:21:00] [INFO ] [Nat]Added 218 Read/Feed constraints in 87 ms returned sat
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 372 ms
[2022-06-12 22:21:00] [INFO ] Computed and/alt/rep : 972/3415/972 causal constraints (skipped 0 transitions) in 50 ms.
[2022-06-12 22:21:20] [INFO ] Added : 920 causal constraints over 184 iterations in 20565 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-06-12 22:21:21] [INFO ] [Real]Absence check using 361 positive place invariants in 57 ms returned sat
[2022-06-12 22:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:21] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-06-12 22:21:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:21] [INFO ] [Nat]Absence check using 361 positive place invariants in 60 ms returned sat
[2022-06-12 22:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:22] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-06-12 22:21:22] [INFO ] [Nat]Added 218 Read/Feed constraints in 71 ms returned sat
[2022-06-12 22:21:22] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-06-12 22:21:22] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2022-06-12 22:21:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2022-06-12 22:21:22] [INFO ] Computed and/alt/rep : 972/3415/972 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 22:21:42] [INFO ] Added : 952 causal constraints over 192 iterations in 20159 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-06-12 22:21:42] [INFO ] [Real]Absence check using 361 positive place invariants in 58 ms returned sat
[2022-06-12 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:43] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Real]Added 218 Read/Feed constraints in 31 ms returned sat
[2022-06-12 22:21:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:43] [INFO ] [Nat]Absence check using 361 positive place invariants in 58 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:43] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Nat]Added 218 Read/Feed constraints in 70 ms returned sat
[2022-06-12 22:21:43] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2022-06-12 22:21:43] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-06-12 22:21:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2022-06-12 22:21:44] [INFO ] Computed and/alt/rep : 972/3415/972 causal constraints (skipped 0 transitions) in 56 ms.
[2022-06-12 22:22:04] [INFO ] Added : 961 causal constraints over 193 iterations in 20747 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-06-12 22:22:05] [INFO ] [Real]Absence check using 361 positive place invariants in 58 ms returned sat
[2022-06-12 22:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:05] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-06-12 22:22:05] [INFO ] [Real]Added 218 Read/Feed constraints in 52 ms returned sat
[2022-06-12 22:22:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:05] [INFO ] [Nat]Absence check using 361 positive place invariants in 62 ms returned sat
[2022-06-12 22:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:05] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-06-12 22:22:05] [INFO ] [Nat]Added 218 Read/Feed constraints in 72 ms returned sat
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 687 ms
[2022-06-12 22:22:06] [INFO ] Computed and/alt/rep : 972/3415/972 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 22:22:27] [INFO ] Added : 942 causal constraints over 189 iterations in 20533 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 144 ms.
[2022-06-12 22:22:27] [INFO ] [Real]Absence check using 361 positive place invariants in 67 ms returned sat
[2022-06-12 22:22:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:27] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-06-12 22:22:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:28] [INFO ] [Nat]Absence check using 361 positive place invariants in 69 ms returned sat
[2022-06-12 22:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:28] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2022-06-12 22:22:28] [INFO ] [Nat]Added 218 Read/Feed constraints in 94 ms returned sat
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 519 ms
[2022-06-12 22:22:29] [INFO ] Computed and/alt/rep : 972/3415/972 causal constraints (skipped 0 transitions) in 44 ms.
[2022-06-12 22:22:49] [INFO ] Added : 953 causal constraints over 193 iterations in 20221 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 66 ms.
Incomplete Parikh walk after 166600 steps, including 536 resets, run finished after 995 ms. (steps per millisecond=167 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 211500 steps, including 1000 resets, run finished after 1249 ms. (steps per millisecond=169 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 202400 steps, including 531 resets, run finished after 1283 ms. (steps per millisecond=157 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 123600 steps, including 877 resets, run finished after 722 ms. (steps per millisecond=171 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 227300 steps, including 912 resets, run finished after 1219 ms. (steps per millisecond=186 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 119 out of 1040 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1040/1040 places, 976/976 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1040 transition count 953
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 1017 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 1015 transition count 951
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 50 place count 1015 transition count 933
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 86 place count 997 transition count 933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 996 transition count 932
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 996 transition count 932
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 208 place count 936 transition count 872
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 211 place count 936 transition count 869
Renaming transitions due to excessive name length > 1024 char.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 233 place count 925 transition count 877
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 925 transition count 875
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 237 place count 923 transition count 875
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 242 place count 923 transition count 875
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 922 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 921 transition count 874
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 920 transition count 873
Applied a total of 245 rules in 367 ms. Remains 920 /1040 variables (removed 120) and now considering 873/976 (removed 103) transitions.
Finished structural reductions, in 1 iterations. Remains : 920/1040 places, 873/976 transitions.
[2022-06-12 22:22:55] [INFO ] Flatten gal took : 65 ms
[2022-06-12 22:22:55] [INFO ] Flatten gal took : 60 ms
[2022-06-12 22:22:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10779297187727114910.gal : 6 ms
[2022-06-12 22:22:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5085787237925873497.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10779297187727114910.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5085787237925873497.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10779297187727114910.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5085787237925873497.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5085787237925873497.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :13 after 89
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :89 after 649
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :649 after 58323
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :58323 after 2.20411e+12
Detected timeout of ITS tools.
[2022-06-12 22:23:10] [INFO ] Flatten gal took : 41 ms
[2022-06-12 22:23:10] [INFO ] Applying decomposition
[2022-06-12 22:23:10] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7650179734816215619.txt, -o, /tmp/graph7650179734816215619.bin, -w, /tmp/graph7650179734816215619.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7650179734816215619.bin, -l, -1, -v, -w, /tmp/graph7650179734816215619.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:23:10] [INFO ] Decomposing Gal with order
[2022-06-12 22:23:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:23:10] [INFO ] Removed a total of 604 redundant transitions.
[2022-06-12 22:23:10] [INFO ] Flatten gal took : 99 ms
[2022-06-12 22:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 29 ms.
[2022-06-12 22:23:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12072154771641271136.gal : 19 ms
[2022-06-12 22:23:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1581739912873219691.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality12072154771641271136.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1581739912873219691.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12072154771641271136.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1581739912873219691.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1581739912873219691.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 73
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :73 after 73
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :73 after 6481
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :6481 after 58323
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :3.81183e+21 after 1.40241e+23
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17462718857035675170
[2022-06-12 22:23:26] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17462718857035675170
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17462718857035675170]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17462718857035675170] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17462718857035675170] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6011 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted Best-First random walk after 784837 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4130 ms. (steps per millisecond=242 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4912 ms. (steps per millisecond=203 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2270938 steps, run timeout after 30001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 2270938 steps, saw 1438724 distinct states, run finished after 30001 ms. (steps per millisecond=75 ) properties seen :{}
Running SMT prover for 3 properties.
// Phase 1: matrix 873 rows 920 cols
[2022-06-12 22:24:17] [INFO ] Computed 360 place invariants in 7 ms
[2022-06-12 22:24:17] [INFO ] [Real]Absence check using 360 positive place invariants in 82 ms returned sat
[2022-06-12 22:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:17] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2022-06-12 22:24:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:24:17] [INFO ] [Nat]Absence check using 360 positive place invariants in 77 ms returned sat
[2022-06-12 22:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:18] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2022-06-12 22:24:18] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-06-12 22:24:18] [INFO ] [Nat]Added 131 Read/Feed constraints in 38 ms returned sat
[2022-06-12 22:24:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-06-12 22:24:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 9 ms to minimize.
[2022-06-12 22:24:18] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2022-06-12 22:24:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 278 ms
[2022-06-12 22:24:18] [INFO ] Computed and/alt/rep : 845/2426/845 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 22:24:33] [INFO ] Added : 812 causal constraints over 165 iterations in 14639 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-06-12 22:24:33] [INFO ] [Real]Absence check using 360 positive place invariants in 55 ms returned sat
[2022-06-12 22:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:33] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2022-06-12 22:24:33] [INFO ] [Real]Added 131 Read/Feed constraints in 29 ms returned sat
[2022-06-12 22:24:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:24:34] [INFO ] [Nat]Absence check using 360 positive place invariants in 55 ms returned sat
[2022-06-12 22:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:34] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2022-06-12 22:24:34] [INFO ] [Nat]Added 131 Read/Feed constraints in 28 ms returned sat
[2022-06-12 22:24:34] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2022-06-12 22:24:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-06-12 22:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2022-06-12 22:24:34] [INFO ] Computed and/alt/rep : 845/2426/845 causal constraints (skipped 0 transitions) in 44 ms.
[2022-06-12 22:24:56] [INFO ] Added : 811 causal constraints over 166 iterations in 21678 ms. Result :unknown
[2022-06-12 22:24:56] [INFO ] [Real]Absence check using 360 positive place invariants in 64 ms returned sat
[2022-06-12 22:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:56] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-06-12 22:24:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:24:56] [INFO ] [Nat]Absence check using 360 positive place invariants in 64 ms returned sat
[2022-06-12 22:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:57] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-12 22:24:57] [INFO ] [Nat]Added 131 Read/Feed constraints in 42 ms returned sat
[2022-06-12 22:24:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2022-06-12 22:24:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2022-06-12 22:24:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2022-06-12 22:24:57] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-06-12 22:24:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-06-12 22:24:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 398 ms
[2022-06-12 22:24:57] [INFO ] Computed and/alt/rep : 845/2426/845 causal constraints (skipped 0 transitions) in 40 ms.
[2022-06-12 22:25:14] [INFO ] Added : 825 causal constraints over 166 iterations in 17215 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
Incomplete Parikh walk after 162200 steps, including 273 resets, run finished after 992 ms. (steps per millisecond=163 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 236500 steps, including 1000 resets, run finished after 1352 ms. (steps per millisecond=174 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 164000 steps, including 768 resets, run finished after 1014 ms. (steps per millisecond=161 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 119 out of 920 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 920/920 places, 873/873 transitions.
Applied a total of 0 rules in 18 ms. Remains 920 /920 variables (removed 0) and now considering 873/873 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 920/920 places, 873/873 transitions.
Starting structural reductions, iteration 0 : 920/920 places, 873/873 transitions.
Applied a total of 0 rules in 17 ms. Remains 920 /920 variables (removed 0) and now considering 873/873 (removed 0) transitions.
// Phase 1: matrix 873 rows 920 cols
[2022-06-12 22:25:18] [INFO ] Computed 360 place invariants in 7 ms
[2022-06-12 22:25:18] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 873 rows 920 cols
[2022-06-12 22:25:18] [INFO ] Computed 360 place invariants in 6 ms
[2022-06-12 22:25:19] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-06-12 22:25:20] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 2603 ms to find 0 implicit places.
[2022-06-12 22:25:21] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 873 rows 920 cols
[2022-06-12 22:25:21] [INFO ] Computed 360 place invariants in 4 ms
[2022-06-12 22:25:21] [INFO ] Dead Transitions using invariants and state equation in 378 ms returned []
Finished structural reductions, in 1 iterations. Remains : 920/920 places, 873/873 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 668 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 873 rows 920 cols
[2022-06-12 22:25:22] [INFO ] Computed 360 place invariants in 5 ms
[2022-06-12 22:25:22] [INFO ] [Real]Absence check using 360 positive place invariants in 89 ms returned sat
[2022-06-12 22:25:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:22] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-06-12 22:25:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:25:22] [INFO ] [Nat]Absence check using 360 positive place invariants in 74 ms returned sat
[2022-06-12 22:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:23] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2022-06-12 22:25:23] [INFO ] State equation strengthened by 131 read => feed constraints.
[2022-06-12 22:25:23] [INFO ] [Nat]Added 131 Read/Feed constraints in 39 ms returned sat
[2022-06-12 22:25:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:25:23] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-06-12 22:25:23] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2022-06-12 22:25:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2022-06-12 22:25:23] [INFO ] Computed and/alt/rep : 845/2426/845 causal constraints (skipped 0 transitions) in 47 ms.
[2022-06-12 22:25:37] [INFO ] Added : 812 causal constraints over 165 iterations in 14263 ms. Result :sat
[2022-06-12 22:25:38] [INFO ] [Real]Absence check using 360 positive place invariants in 55 ms returned sat
[2022-06-12 22:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:38] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-06-12 22:25:38] [INFO ] [Real]Added 131 Read/Feed constraints in 29 ms returned sat
[2022-06-12 22:25:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:25:38] [INFO ] [Nat]Absence check using 360 positive place invariants in 49 ms returned sat
[2022-06-12 22:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:38] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-06-12 22:25:38] [INFO ] [Nat]Added 131 Read/Feed constraints in 29 ms returned sat
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-06-12 22:25:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2022-06-12 22:25:39] [INFO ] Computed and/alt/rep : 845/2426/845 causal constraints (skipped 0 transitions) in 37 ms.
[2022-06-12 22:25:58] [INFO ] Added : 811 causal constraints over 166 iterations in 19413 ms. Result :unknown
[2022-06-12 22:25:58] [INFO ] [Real]Absence check using 360 positive place invariants in 61 ms returned sat
[2022-06-12 22:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:58] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2022-06-12 22:25:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:25:59] [INFO ] [Nat]Absence check using 360 positive place invariants in 63 ms returned sat
[2022-06-12 22:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:59] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2022-06-12 22:25:59] [INFO ] [Nat]Added 131 Read/Feed constraints in 43 ms returned sat
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-06-12 22:25:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-06-12 22:25:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 406 ms
[2022-06-12 22:25:59] [INFO ] Computed and/alt/rep : 845/2426/845 causal constraints (skipped 0 transitions) in 39 ms.
[2022-06-12 22:26:16] [INFO ] Added : 825 causal constraints over 166 iterations in 16355 ms. Result :sat
[2022-06-12 22:26:16] [INFO ] Flatten gal took : 35 ms
[2022-06-12 22:26:16] [INFO ] Flatten gal took : 34 ms
[2022-06-12 22:26:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1218077955958478830.gal : 4 ms
[2022-06-12 22:26:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality624803107954640019.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1218077955958478830.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality624803107954640019.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1218077955958478830.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality624803107954640019.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality624803107954640019.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 13
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :13 after 89
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :89 after 649
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :649 after 58323
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :58323 after 2.20411e+12
Detected timeout of ITS tools.
[2022-06-12 22:26:31] [INFO ] Flatten gal took : 34 ms
[2022-06-12 22:26:31] [INFO ] Applying decomposition
[2022-06-12 22:26:31] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8255551487328466808.txt, -o, /tmp/graph8255551487328466808.bin, -w, /tmp/graph8255551487328466808.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8255551487328466808.bin, -l, -1, -v, -w, /tmp/graph8255551487328466808.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:26:31] [INFO ] Decomposing Gal with order
[2022-06-12 22:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:26:31] [INFO ] Removed a total of 604 redundant transitions.
[2022-06-12 22:26:31] [INFO ] Flatten gal took : 57 ms
[2022-06-12 22:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 10 ms.
[2022-06-12 22:26:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11527175271070880164.gal : 6 ms
[2022-06-12 22:26:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9821418301782426214.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality11527175271070880164.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9821418301782426214.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality11527175271070880164.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9821418301782426214.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9821418301782426214.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 37
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :37 after 217
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :217 after 217
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :217 after 19441
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :19441 after 1.40402e+15
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6888529999477779560
[2022-06-12 22:26:46] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6888529999477779560
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6888529999477779560]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6888529999477779560] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6888529999477779560] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Partial Free-agglomeration rule applied 105 times.
Drop transitions removed 105 transitions
Iterating global reduction 0 with 105 rules applied. Total rules applied 105 place count 920 transition count 873
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 920 transition count 871
Applied a total of 107 rules in 70 ms. Remains 920 /920 variables (removed 0) and now considering 871/873 (removed 2) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 871 rows 920 cols
[2022-06-12 22:26:47] [INFO ] Computed 360 place invariants in 2 ms
[2022-06-12 22:26:47] [INFO ] [Real]Absence check using 360 positive place invariants in 64 ms returned sat
[2022-06-12 22:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:48] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2022-06-12 22:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:48] [INFO ] [Nat]Absence check using 360 positive place invariants in 74 ms returned sat
[2022-06-12 22:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:48] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2022-06-12 22:26:48] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-06-12 22:26:48] [INFO ] [Nat]Added 92 Read/Feed constraints in 16 ms returned sat
[2022-06-12 22:26:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-06-12 22:26:48] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2022-06-12 22:26:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 759 ms
[2022-06-12 22:26:49] [INFO ] Computed and/alt/rep : 843/2443/843 causal constraints (skipped 0 transitions) in 36 ms.
[2022-06-12 22:27:02] [INFO ] Added : 755 causal constraints over 151 iterations in 12695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-12 22:27:02] [INFO ] [Real]Absence check using 360 positive place invariants in 55 ms returned sat
[2022-06-12 22:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:02] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-06-12 22:27:02] [INFO ] [Real]Added 92 Read/Feed constraints in 16 ms returned sat
[2022-06-12 22:27:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:27:02] [INFO ] [Nat]Absence check using 360 positive place invariants in 54 ms returned sat
[2022-06-12 22:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:03] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-06-12 22:27:03] [INFO ] [Nat]Added 92 Read/Feed constraints in 33 ms returned sat
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-12 22:27:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 479 ms
[2022-06-12 22:27:03] [INFO ] Computed and/alt/rep : 843/2443/843 causal constraints (skipped 0 transitions) in 38 ms.
[2022-06-12 22:27:24] [INFO ] Added : 795 causal constraints over 167 iterations in 20892 ms. Result :unknown
[2022-06-12 22:27:24] [INFO ] [Real]Absence check using 360 positive place invariants in 63 ms returned sat
[2022-06-12 22:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:25] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2022-06-12 22:27:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:27:25] [INFO ] [Nat]Absence check using 360 positive place invariants in 60 ms returned sat
[2022-06-12 22:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:25] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2022-06-12 22:27:25] [INFO ] [Nat]Added 92 Read/Feed constraints in 17 ms returned sat
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-06-12 22:27:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-06-12 22:27:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 403 ms
[2022-06-12 22:27:26] [INFO ] Computed and/alt/rep : 843/2443/843 causal constraints (skipped 0 transitions) in 38 ms.
[2022-06-12 22:27:41] [INFO ] Added : 793 causal constraints over 161 iterations in 15235 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2022-06-12 22:27:41] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
[2022-06-12 22:27:41] [INFO ] Flatten gal took : 47 ms
Built C files in :
/tmp/ltsmin12201166806798473983
[2022-06-12 22:27:41] [INFO ] Applying decomposition
[2022-06-12 22:27:41] [INFO ] Computing symmetric may disable matrix : 873 transitions.
[2022-06-12 22:27:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:27:41] [INFO ] Computing symmetric may enable matrix : 873 transitions.
[2022-06-12 22:27:41] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:27:41] [INFO ] Flatten gal took : 33 ms
[2022-06-12 22:27:41] [INFO ] Input system was already deterministic with 873 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6993447566792960293.txt, -o, /tmp/graph6993447566792960293.bin, -w, /tmp/graph6993447566792960293.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6993447566792960293.bin, -l, -1, -v, -w, /tmp/graph6993447566792960293.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:27:41] [INFO ] Decomposing Gal with order
[2022-06-12 22:27:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:27:41] [INFO ] Computing Do-Not-Accords matrix : 873 transitions.
[2022-06-12 22:27:41] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 22:27:41] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12201166806798473983
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12201166806798473983]
[2022-06-12 22:27:41] [INFO ] Removed a total of 604 redundant transitions.
[2022-06-12 22:27:41] [INFO ] Flatten gal took : 103 ms
[2022-06-12 22:27:41] [INFO ] Ran tautology test, simplified 0 / 3 in 406 ms.
[2022-06-12 22:27:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 21 ms.
[2022-06-12 22:27:41] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8412075758576320058.gal : 7 ms
[2022-06-12 22:27:41] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4097714781408236060.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability8412075758576320058.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability4097714781408236060.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability8412075758576320058.gal -t CGAL -reachable-file /tmp/ReachabilityFireability4097714781408236060.prop --nowitness
[2022-06-12 22:27:41] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=0 took 40 ms
[2022-06-12 22:27:41] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=0 took 12 ms
[2022-06-12 22:27:41] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(UNSAT) depth K=0 took 2 ms
Loading property file /tmp/ReachabilityFireability4097714781408236060.prop.
[2022-06-12 22:27:42] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=1 took 34 ms
[2022-06-12 22:27:42] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=1 took 4 ms
[2022-06-12 22:27:42] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(UNSAT) depth K=1 took 5 ms
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 37
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :37 after 217
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :217 after 217
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :217 after 6481
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 873 rows 920 cols
[2022-06-12 22:27:42] [INFO ] Computed 360 place invariants in 3 ms
inv : p30 + p130 + p132 = 1
inv : p1964 + p1968 + p1973 = 1
inv : p30 + p597 + p598 + p613 + p615 = 1
inv : p2175 + p2180 = 1
inv : p2222 + p2225 = 1
inv : p30 + p257 + p258 + p260 = 1
inv : p1429 + p1430 + p1434 + p1437 + p1438 = 1
inv : p1151 + p1171 + p1174 + p1175 + p1180 = 1
inv : p2596 + p2598 + p2599 + p2600 + p2604 + p2606 = 1
inv : p30 + p61 + p63 = 1
inv : p2062 + p2064 = 1
inv : p1986 + p1989 + p1990 = 1
inv : p1290 + p1296 + p1299 + p1300 = 1
inv : p1830 + p1835 = 1
inv : p2394 + p2395 + p2407 + p2409 = 1
inv : p30 + p337 + p339 = 1
inv : p1789 + p1791 = 1
inv : p2116 + p2117 + p2124 + p2129 + p2130 = 1
inv : p1089 + p1094 + p1095 = 1
inv : p1776 + p1778 = 1
inv : p2116 + p2152 + p2156 = 1
inv : p751 + p753 = 1
inv : p2460 + p2476 + p2477 + p2478 = 1
inv : p1705 + p1717 + p1718 + p1719 = 1
inv : p802 + p804 + p813 + p816 + p817 = 1
inv : p2394 + p2395 + p2400 + p2403 + p2404 = 1
inv : p30 + p187 + p188 + p192 + p197 + p198 = 1
inv : p1680 + p1685 = 1
inv : p1071 + p1076 = 1
inv : p30 + p547 + p549 = 1
inv : p30 + p664 + p675 + p676 + p678 + p679 = 1
inv : p795 + p800 = 1
inv : p30 + p391 + p415 + p416 + p421 = 1
inv : p30 + p54 + p57 + p58 = 1
inv : p1020 + p1023 + p1024 = 1
inv : p1266 + p1271 = 1
inv : p1841 + p1842 + p1848 + p1853 + p1854 = 1
inv : p1641 + p1644 + p1645 = 1
inv : p1807 + p1811 = 1
inv : p2796 + p2800 + p2801 = 1
inv : p30 + p664 + p685 + p687 = 1
inv : p2258 + p2259 + p2261 = 1
inv : p30 + p243 + p248 = 1
inv : p2394 + p2395 + p2400 + p2405 + p2406 = 1
inv : p1365 + p1368 + p1369 = 1
inv : p2322 + p2326 + p2328 + p2329 + p2330 = 1
inv : p1531 + p1535 = 1
inv : p1952 + p1956 + p1957 + p1961 = 1
inv : p1125 + p1128 + p1130 + p1133 = 1
inv : p948 + p950 = 1
inv : p921 + p926 = 1
inv : p2596 + p2598 + p2643 + p2648 + p2649 + p2651 = 1
inv : p2258 + p2262 + p2267 + p2268 = 1
inv : p1244 + p1249 = 1
inv : p30 + p664 + p692 + p697 = 1
inv : p1324 + p1328 = 1
inv : p2258 + p2262 + p2265 + p2266 = 1
inv : p30 + p101 + p105 + p110 = 1
inv : p2276 + p2279 + p2280 + p2281 + p2284 = 1
inv : p2322 + p2366 + p2370 + p2375 = 1
inv : p2668 + p2669 + p2676 + p2679 + p2680 = 1
inv : p30 + p554 + p559 = 1
inv : p1429 + p1441 + p1442 + p1443 = 1
inv : p802 + p804 + p823 + p825 = 1
inv : p2052 + p2054 = 1
inv : p2055 + p2058 + p2059 = 1
inv : p1089 + p1092 + p1093 = 1
inv : p1542 + p1547 = 1
inv : p30 + p391 + p406 + p408 = 1
inv : p1779 + p1781 + p1782 + p1783 = 1
inv : p2596 + p2598 + p2599 + p2600 + p2614 + p2616 = 1
inv : p1444 + p1446 = 1
inv : p30 + p133 + p135 = 1
inv : p2740 + p2741 + p2745 + p2748 + p2749 = 1
inv : p1586 + p1589 + p1592 + p1594 = 1
inv : p1058 + p1059 + p1064 = 1
inv : p882 + p885 + p886 = 1
inv : p1887 + p1892 = 1
inv : p30 + p664 + p672 + p674 = 1
inv : p1794 + p1796 + p1801 = 1
inv : p2116 + p2117 + p2124 + p2127 + p2128 = 1
inv : p30 + p457 + p464 + p465 + p466 + p467 = 1
inv : p1705 + p1710 + p1713 + p1714 = 1
inv : p30 + p174 + p179 = 1
inv : p30 + p391 + p399 + p402 + p403 = 1
inv : p1151 + p1165 + p1167 = 1
inv : p30 + p457 + p496 + p500 = 1
inv : p1253 + p1258 + p1259 = 1
inv : p2163 + p2168 = 1
inv : p802 + p864 + p869 = 1
inv : p2451 + p2456 = 1
inv : p882 + p887 + p888 = 1
inv : p2322 + p2326 + p2331 + p2336 + p2337 = 1
inv : p30 + p664 + p675 + p676 + p680 + p681 = 1
inv : p2460 + p2469 + p2474 + p2475 = 1
inv : p30 + p187 + p188 + p189 + p191 = 1
inv : p2529 + p2530 + p2538 + p2543 + p2544 = 1
inv : p1910 + p1927 + p1928 + p1929 = 1
inv : p1151 + p1155 + p1157 = 1
inv : p30 + p54 + p59 + p60 = 1
inv : p2394 + p2395 + p2397 + p2399 = 1
inv : p30 + p187 + p188 + p192 + p195 + p196 = 1
inv : p1692 + p1697 = 1
inv : p2596 + p2598 + p2599 + p2600 + p2607 + p2612 + p2613 = 1
inv : p1910 + p1913 + p1917 + p1919 + p1922 + p1923 = 1
inv : p951 + p956 + p957 = 1
inv : p1895 + p1899 = 1
inv : p30 + p457 + p485 + p489 + p490 = 1
inv : p30 + p231 + p236 = 1
inv : p2065 + p2067 = 1
inv : p2740 + p2741 + p2745 + p2750 + p2751 = 1
inv : p1600 + p1604 = 1
inv : p2116 + p2117 + p2121 + p2123 = 1
inv : p30 + p51 + p53 = 1
inv : p1572 + p1575 + p1576 = 1
inv : p30 + p64 + p66 = 1
inv : p1365 + p1370 + p1371 = 1
inv : p30 + p597 + p598 + p603 + p605 = 1
inv : p30 + p271 + p273 = 1
inv : p1762 + p1766 = 1
inv : p2596 + p2598 + p2599 + p2635 + p2639 = 1
inv : p30 + p457 + p515 + p516 + p519 + p520 + p524 = 1
inv : p30 + p220 + p223 + p224 = 1
inv : p2668 + p2669 + p2693 + p2698 = 1
inv : p1290 + p1296 + p1301 + p1302 = 1
inv : p2759 + p2767 = 1
inv : p2668 + p2669 + p2676 + p2681 + p2682 = 1
inv : p30 + p457 + p478 + p479 + p480 = 1
inv : p30 + p340 + p342 = 1
inv : p2589 + p2594 = 1
inv : p2596 + p2658 + p2663 = 1
inv : p30 + p347 + p352 = 1
inv : p802 + p804 + p813 + p818 + p819 = 1
inv : p1814 + p1818 + p1823 = 1
inv : p2529 + p2530 + p2535 + p2536 + p2537 = 1
inv : p2460 + p2466 + p2468 = 1
inv : p979 + p983 = 1
inv : p1750 + p1754 = 1
inv : p1372 + p1374 = 1
inv : p1705 + p1710 + p1715 + p1716 = 1
inv : p2436 + p2439 + p2442 + p2444 = 1
inv : p2394 + p2410 + p2412 = 1
inv : p30 + p457 + p475 + p477 = 1
inv : p30 + p162 + p167 = 1
inv : p30 + p457 + p507 + p512 = 1
inv : p1375 + p1377 = 1
inv : p30 + p79 + p82 + p86 + p87 = 1
inv : p1290 + p1306 + p1307 + p1308 = 1
inv : p1416 + p1421 = 1
inv : p2668 + p2704 + p2708 = 1
inv : p2460 + p2479 + p2481 = 1
inv : p2003 + p2008 = 1
inv : p30 + p187 + p199 + p201 = 1
inv : p1520 + p1525 = 1
inv : p1841 + p1842 + p1848 + p1851 + p1852 = 1
inv : p30 + p123 + p126 + p127 = 1
inv : p30 + p210 + p214 = 1
inv : p30 + p330 + p335 + p336 = 1
inv : p30 + p664 + p703 + p707 = 1
inv : p2210 + p2215 = 1
inv : p802 + p804 + p841 + p845 = 1
inv : p2322 + p2356 + p2359 + p2361 + p2362 + p2363 + p2364 = 1
inv : p2668 + p2669 + p2673 + p2674 + p2675 = 1
inv : p1106 + p1111 = 1
inv : p1786 + p1788 = 1
inv : p754 + p756 = 1
inv : p1227 + p1230 + p1231 = 1
inv : p30 + p568 + p569 = 1
inv : p1393 + p1397 = 1
inv : p2460 + p2469 + p2472 + p2473 = 1
inv : p30 + p268 + p270 = 1
inv : p2310 + p2313 + p2316 + p2318 = 1
inv : p30 + p366 + p369 + p371 + p374 = 1
inv : p30 + p664 + p714 + p719 = 1
inv : p987 + p990 + p992 + p995 = 1
inv : p1572 + p1577 + p1578 = 1
inv : p1224 + p1226 = 1
inv : p1186 + p1190 = 1
inv : p2116 + p2117 + p2131 + p2133 = 1
inv : p30 + p330 + p333 + p334 = 1
inv : p1347 + p1352 = 1
inv : p1099 + p1101 = 1
inv : p2116 + p2117 + p2141 + p2146 = 1
inv : p30 + p537 + p542 + p543 = 1
inv : p1513 + p1515 = 1
inv : p2460 + p2504 + p2508 + p2513 = 1
inv : p1227 + p1232 + p1233 = 1
inv : p2460 + p2497 + p2499 + p2500 + p2501 = 1
inv : p889 + p891 = 1
inv : p772 + p776 = 1
inv : p1275 + p1278 + p1279 + p1283 = 1
inv : p1841 + p1842 + p1858 + p1859 + p1860 = 1
inv : p1705 + p1707 + p1709 = 1
inv : p2529 + p2530 + p2548 + p2550 = 1
inv : p1485 + p1486 + p1490 = 1
inv : p30 + p148 + p151 + p155 + p157 = 1
inv : p1429 + p1430 + p1431 + p1432 + p1433 = 1
inv : p30 + p576 + p581 = 1
inv : p1550 + p1551 + p1554 + p1559 + p1560 = 1
inv : p1910 + p1913 + p1917 + p1919 + p1920 + p1921 = 1
inv : p910 + p912 + p913 + p914 = 1
inv : p930 + p933 + p938 = 1
inv : p2193 + p2198 + p2199 = 1
inv : p30 + p597 + p598 + p606 + p611 + p612 = 1
inv : p2322 + p2326 + p2331 + p2334 + p2335 = 1
inv : p1993 + p1995 = 1
inv : p1197 + p1199 + p1200 + p1202 = 1
inv : p2203 + p2205 = 1
inv : p30 + p449 + p450 + p455 = 1
inv : p1910 + p1913 + p1914 + p1916 = 1
inv : p30 + p202 + p204 = 1
inv : p2529 + p2530 + p2538 + p2541 + p2542 = 1
inv : p1469 + p1473 + p1478 + p1480 = 1
inv : p2715 + p2719 + p2720 = 1
inv : p30 + p391 + p424 + p428 + p431 = 1
inv : p2596 + p2598 + p2599 + p2600 + p2624 + p2629 = 1
inv : p2091 + p2094 + p2096 + p2099 = 1
inv : p2037 + p2042 = 1
inv : p2596 + p2598 + p2599 + p2600 + p2607 + p2610 + p2611 = 1
inv : p1611 + p1616 = 1
inv : p30 + p534 + p536 = 1
inv : p2740 + p2752 + p2754 = 1
inv : p30 + p137 + p140 + p145 = 1
inv : p2193 + p2196 + p2197 = 1
inv : p1382 + p1383 + p1387 = 1
inv : p30 + p391 + p409 + p410 + p411 = 1
inv : p2382 + p2387 = 1
inv : p30 + p391 + p396 + p398 = 1
inv : p30 + p300 + p305 = 1
inv : p30 + p597 + p598 + p606 + p609 + p610 = 1
inv : p1290 + p1293 + p1295 = 1
inv : p2668 + p2669 + p2686 + p2688 = 1
inv : p30 + p278 + p283 = 1
inv : p802 + p804 + p830 + p835 = 1
inv : p1309 + p1310 + p1313 + p1316 + p1318 + p1319 = 1
inv : p1638 + p1639 + p1640 = 1
inv : p802 + p804 + p849 + p852 + p857 = 1
inv : p758 + p766 = 1
inv : p1996 + p1998 = 1
inv : p1582 + p1584 = 1
inv : p2011 + p2017 + p2018 + p2020 = 1
inv : p958 + p960 = 1
inv : p30 + p40 + p42 = 1
inv : p30 + p123 + p128 + p129 = 1
inv : p2322 + p2326 + p2338 + p2339 + p2340 = 1
inv : p2200 + p2202 = 1
inv : p1362 + p1364 = 1
inv : p2428 + p2432 = 1
inv : p1738 + p1742 = 1
inv : p30 + p537 + p540 + p541 = 1
inv : p1910 + p1930 + p1934 + p1939 = 1
inv : p2784 + p2789 = 1
inv : p30 + p361 + p362 = 1
inv : p1205 + p1209 + p1214 + p1215 = 1
inv : p2116 + p2117 + p2134 + p2135 + p2136 = 1
inv : p879 + p881 = 1
inv : p2727 + p2732 = 1
inv : p965 + p968 + p970 + p973 = 1
inv : p1017 + p1019 = 1
inv : p30 + p597 + p645 + p650 = 1
inv : p2529 + p2530 + p2566 + p2570 = 1
inv : p2529 + p2573 + p2577 + p2582 + p2583 = 1
inv : p30 + p597 + p598 + p634 + p638 = 1
inv : p30 + p289 + p290 + p293 = 1
inv : p1462 + p1466 = 1
inv : p899 + p904 = 1
inv : p951 + p954 + p955 = 1
inv : p2072 + p2077 = 1
inv : p30 + p588 + p593 = 1
inv : p30 + p544 + p546 = 1
inv : p1727 + p1732 = 1
inv : p2520 + p2525 = 1
inv : p783 + p788 = 1
inv : p741 + p743 = 1
inv : p2290 + p2291 + p2294 = 1
inv : p1569 + p1571 = 1
inv : p744 + p749 + p750 = 1
inv : p1658 + p1659 + p1663 = 1
inv : p2529 + p2530 + p2552 + p2555 + p2560 = 1
inv : p1641 + p1646 + p1647 = 1
inv : p802 + p804 + p810 + p812 = 1
inv : p1986 + p1991 + p1992 = 1
inv : p1910 + p1924 + p1926 = 1
inv : p30 + p597 + p598 + p616 + p618 = 1
inv : p30 + p664 + p726 + p731 = 1
inv : p892 + p893 + p894 = 1
inv : p30 + p391 + p399 + p404 + p405 = 1
inv : p1096 + p1098 = 1
inv : p1876 + p1880 = 1
inv : p2322 + p2341 + p2343 = 1
inv : p2190 + p2192 = 1
inv : p1503 + p1508 + p1509 = 1
inv : p30 + p93 + p98 = 1
inv : p30 + p457 + p464 + p468 + p473 + p474 = 1
inv : p1648 + p1650 = 1
inv : p30 + p327 + p329 = 1
inv : p30 + p657 + p662 = 1
inv : p1027 + p1029 = 1
inv : p1841 + p1842 + p1845 + p1847 = 1
inv : p2529 + p2530 + p2545 + p2547 = 1
inv : p30 + p257 + p261 + p266 + p267 = 1
inv : p1151 + p1158 + p1161 + p1162 = 1
inv : p1510 + p1512 = 1
inv : p30 + p438 + p443 = 1
inv : p2228 + p2232 = 1
inv : p1234 + p1236 = 1
inv : p1151 + p1168 + p1170 = 1
inv : p999 + p1000 + p1007 = 1
inv : p1945 + p1946 + p1949 = 1
inv : p1448 + p1451 + p1453 + p1456 = 1
inv : p2240 + p2244 = 1
inv : p2055 + p2060 + p2061 = 1
inv : p1020 + p1025 + p1026 = 1
inv : p30 + p597 + p598 + p623 + p628 = 1
inv : p2269 + p2271 = 1
inv : p1779 + p1781 + p1784 + p1785 = 1
inv : p1404 + p1405 + p1409 = 1
inv : p1623 + p1628 = 1
inv : p1503 + p1506 + p1507 = 1
inv : p2272 + p2274 = 1
inv : p1237 + p1239 = 1
inv : p1034 + p1035 + p1042 = 1
inv : p2322 + p2348 + p2352 + p2353 = 1
inv : p2772 + p2773 + p2777 = 1
inv : p30 + p312 + p317 = 1
inv : p30 + p457 + p464 + p468 + p471 + p472 = 1
inv : p1651 + p1653 = 1
inv : p2417 + p2422 = 1
inv : p2302 + p2306 = 1
inv : p1086 + p1088 = 1
inv : p2596 + p2598 + p2599 + p2600 + p2617 + p2619 = 1
inv : p1137 + p1140 + p1145 = 1
inv : p1151 + p1158 + p1163 + p1164 = 1
inv : p1841 + p1861 + p1865 = 1
inv : p1500 + p1502 = 1
inv : p2460 + p2482 + p2486 + p2491 + p2493 = 1
inv : p30 + p120 + p122 = 1
inv : p30 + p257 + p261 + p264 + p265 = 1
inv : p1429 + p1430 + p1434 + p1439 + p1440 = 1
inv : p30 + p664 + p682 + p684 = 1
inv : p1720 + p1722 = 1
inv : p2082 + p2083 + p2087 = 1
inv : p1051 + p1052 = 1
inv : p1030 + p1032 = 1
inv : p1290 + p1303 + p1305 = 1
inv : p2106 + p2111 = 1
inv : p2668 + p2669 + p2683 + p2685 = 1
inv : p2025 + p2030 = 1
inv : p2740 + p2741 + p2742 + p2744 = 1
inv : p1335 + p1340 = 1
inv : p1983 + p1985 = 1
inv : p961 + p963 = 1
inv : p744 + p747 + p748 = 1
inv : p1841 + p1842 + p1855 + p1857 = 1
inv : p1579 + p1581 = 1
inv : p802 + p804 + p820 + p822 = 1
inv : p30 + p380 + p381 + p386 = 1
inv : p1117 + p1120 + p1121 = 1
inv : p30 + p67 + p68 + p71 + p73 + p76 = 1
inv : p1669 + p1673 = 1
Total of 360 invariants.
[2022-06-12 22:27:42] [INFO ] Computed 360 place invariants in 6 ms
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :6481 after 7.02008e+15
[2022-06-12 22:27:44] [INFO ] Proved 920 variables to be positive in 1818 ms
[2022-06-12 22:27:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-12 22:27:44] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=0 took 128 ms
[2022-06-12 22:27:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-12 22:27:44] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=0 took 141 ms
[2022-06-12 22:27:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-11
[2022-06-12 22:27:44] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(SAT) depth K=0 took 60 ms
[2022-06-12 22:27:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-12 22:27:45] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=1 took 828 ms
[2022-06-12 22:27:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-12 22:27:45] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=1 took 749 ms
[2022-06-12 22:27:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-11
[2022-06-12 22:27:46] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(SAT) depth K=1 took 649 ms
Compilation finished in 6787 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12201166806798473983]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability01==true], workingDir=/tmp/ltsmin12201166806798473983]
[2022-06-12 22:28:13] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=2 took 31322 ms
[2022-06-12 22:29:09] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=2 took 56018 ms
[2022-06-12 22:29:37] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-11(UNSAT) depth K=2 took 28566 ms
[2022-06-12 22:31:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-12 22:31:24] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=2 took 218118 ms
Invariant property ShieldIIPt-PT-040B-ReachabilityFireability-11 does not hold.
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
[2022-06-12 22:45:28] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(UNSAT) depth K=3 took 950838 ms
WARNING : LTSmin timed out (>1200 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability01==true], workingDir=/tmp/ltsmin12201166806798473983]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability10==true], workingDir=/tmp/ltsmin12201166806798473983]
[2022-06-12 22:49:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-10
[2022-06-12 22:49:59] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(SAT) depth K=2 took 1114393 ms
Detected timeout of ITS tools.
[2022-06-12 22:50:48] [INFO ] Applying decomposition
[2022-06-12 22:50:48] [INFO ] Flatten gal took : 103 ms
[2022-06-12 22:50:48] [INFO ] Decomposing Gal with order
[2022-06-12 22:50:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:50:48] [INFO ] Removed a total of 604 redundant transitions.
[2022-06-12 22:50:48] [INFO ] Flatten gal took : 164 ms
[2022-06-12 22:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 39 ms.
[2022-06-12 22:50:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10723046548755963731.gal : 8 ms
[2022-06-12 22:50:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11097171736178216412.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability10723046548755963731.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability11097171736178216412.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability10723046548755963731.gal -t CGAL -reachable-file /tmp/ReachabilityFireability11097171736178216412.prop --nowitness
Loading property file /tmp/ReachabilityFireability11097171736178216412.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 217
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :217 after 217
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :217 after 6481
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6481 after 1.40402e+15
[2022-06-12 22:59:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldIIPt-PT-040B-ReachabilityFireability-01
[2022-06-12 22:59:27] [INFO ] KInduction solution for property ShieldIIPt-PT-040B-ReachabilityFireability-01(SAT) depth K=3 took 567974 ms
WARNING : LTSmin timed out (>1200 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability10==true], workingDir=/tmp/ltsmin12201166806798473983]
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldIIPtPT040BReachabilityFireability01==true], workingDir=/tmp/ltsmin12201166806798473983]
[2022-06-12 23:10:50] [INFO ] BMC solution for property ShieldIIPt-PT-040B-ReachabilityFireability-10(UNSAT) depth K=3 took 1521933 ms
Detected timeout of ITS tools.
[2022-06-12 23:13:55] [INFO ] Flatten gal took : 141 ms
[2022-06-12 23:13:55] [INFO ] Input system was already deterministic with 873 transitions.
[2022-06-12 23:13:55] [INFO ] Transformed 920 places.
[2022-06-12 23:13:55] [INFO ] Transformed 873 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 23:13:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18033170609556423125.gal : 16 ms
[2022-06-12 23:13:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability148016183154453141.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability18033170609556423125.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability148016183154453141.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability18033170609556423125.gal -t CGAL -reachable-file /tmp/ReachabilityFireability148016183154453141.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability148016183154453141.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 15
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :15 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 34
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :34 after 208
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :208 after 1466
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1466 after 175632
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :175632 after 1.73874e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.73874e+07 after 5.73974e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5.73974e+08 after 5.40944e+14
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :5.40944e+14 after 6.72275e+20
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :6.72275e+20 after 5.88204e+25
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :5.88204e+25 after 1.90458e+37
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :1.90458e+37 after 2.79883e+50
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.79883e+50 after 1.01711e+70
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :1.01711e+70 after 1.07126e+96

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is ShieldIIPt-PT-040B, 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 r233-tall-165286037100120"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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