About the Execution of 2021-gold for ShieldPPPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4259.812 | 684572.00 | 778595.00 | 2627.20 | TTFTTTTFTFTTFFFT | 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-165286037400252.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 ShieldPPPt-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-165286037400252
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 13:43 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:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 29 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 29 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 29 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 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 762K 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 ShieldPPPt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1655076422818
Running Version 0
[2022-06-12 23:27:04] [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 23:27:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 23:27:04] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2022-06-12 23:27:04] [INFO ] Transformed 3123 places.
[2022-06-12 23:27:04] [INFO ] Transformed 2843 transitions.
[2022-06-12 23:27:04] [INFO ] Found NUPN structural information;
[2022-06-12 23:27:04] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 322 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 16) seen :4
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2022-06-12 23:27:05] [INFO ] Computed 441 place invariants in 42 ms
[2022-06-12 23:27:06] [INFO ] [Real]Absence check using 441 positive place invariants in 223 ms returned sat
[2022-06-12 23:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:08] [INFO ] [Real]Absence check using state equation in 2324 ms returned sat
[2022-06-12 23:27:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:09] [INFO ] [Nat]Absence check using 441 positive place invariants in 237 ms returned sat
[2022-06-12 23:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:12] [INFO ] [Nat]Absence check using state equation in 2549 ms returned sat
[2022-06-12 23:27:13] [INFO ] Deduced a trap composed of 21 places in 1069 ms of which 15 ms to minimize.
[2022-06-12 23:27:14] [INFO ] Deduced a trap composed of 22 places in 1042 ms of which 11 ms to minimize.
[2022-06-12 23:27: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 0
[2022-06-12 23:27:15] [INFO ] [Real]Absence check using 441 positive place invariants in 247 ms returned sat
[2022-06-12 23:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:18] [INFO ] [Real]Absence check using state equation in 2993 ms returned sat
[2022-06-12 23:27:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:19] [INFO ] [Nat]Absence check using 441 positive place invariants in 211 ms returned sat
[2022-06-12 23:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:22] [INFO ] [Nat]Absence check using state equation in 3207 ms returned sat
[2022-06-12 23:27:23] [INFO ] Deduced a trap composed of 22 places in 980 ms of which 12 ms to minimize.
[2022-06-12 23:27:24] [INFO ] Deduced a trap composed of 21 places in 942 ms of which 4 ms to minimize.
[2022-06-12 23:27:24] [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 23:27:25] [INFO ] [Real]Absence check using 441 positive place invariants in 247 ms returned sat
[2022-06-12 23:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:28] [INFO ] [Real]Absence check using state equation in 3428 ms returned sat
[2022-06-12 23:27:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:29] [INFO ] [Nat]Absence check using 441 positive place invariants in 248 ms returned sat
[2022-06-12 23:27:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:32] [INFO ] [Nat]Absence check using state equation in 3398 ms returned sat
[2022-06-12 23:27:33] [INFO ] Deduced a trap composed of 22 places in 918 ms of which 8 ms to minimize.
[2022-06-12 23:27:33] [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 2
[2022-06-12 23:27:34] [INFO ] [Real]Absence check using 441 positive place invariants in 197 ms returned sat
[2022-06-12 23:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:35] [INFO ] [Real]Absence check using state equation in 1421 ms returned sat
[2022-06-12 23:27:36] [INFO ] Deduced a trap composed of 24 places in 1048 ms of which 2 ms to minimize.
[2022-06-12 23:27:38] [INFO ] Deduced a trap composed of 25 places in 1050 ms of which 2 ms to minimize.
[2022-06-12 23:27:39] [INFO ] Deduced a trap composed of 32 places in 1021 ms of which 2 ms to minimize.
[2022-06-12 23:27:39] [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 23:27:39] [INFO ] [Real]Absence check using 441 positive place invariants in 218 ms returned sat
[2022-06-12 23:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:42] [INFO ] [Real]Absence check using state equation in 2554 ms returned sat
[2022-06-12 23:27:43] [INFO ] Deduced a trap composed of 23 places in 909 ms of which 2 ms to minimize.
[2022-06-12 23:27:44] [INFO ] Deduced a trap composed of 22 places in 899 ms of which 1 ms to minimize.
[2022-06-12 23:27:44] [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 23:27:45] [INFO ] [Real]Absence check using 441 positive place invariants in 193 ms returned sat
[2022-06-12 23:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:46] [INFO ] [Real]Absence check using state equation in 1629 ms returned sat
[2022-06-12 23:27:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:47] [INFO ] [Nat]Absence check using 441 positive place invariants in 203 ms returned sat
[2022-06-12 23:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:49] [INFO ] [Nat]Absence check using state equation in 1696 ms returned sat
[2022-06-12 23:27:50] [INFO ] Deduced a trap composed of 38 places in 961 ms of which 2 ms to minimize.
[2022-06-12 23:27:51] [INFO ] Deduced a trap composed of 26 places in 935 ms of which 2 ms to minimize.
[2022-06-12 23:27:52] [INFO ] Deduced a trap composed of 26 places in 952 ms of which 2 ms to minimize.
[2022-06-12 23:27:52] [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 23:27:53] [INFO ] [Real]Absence check using 441 positive place invariants in 244 ms returned sat
[2022-06-12 23:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:27:56] [INFO ] [Real]Absence check using state equation in 3513 ms returned sat
[2022-06-12 23:27:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:27:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 248 ms returned sat
[2022-06-12 23:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:01] [INFO ] [Nat]Absence check using state equation in 3554 ms returned sat
[2022-06-12 23:28:02] [INFO ] Deduced a trap composed of 25 places in 972 ms of which 2 ms to minimize.
[2022-06-12 23:28:02] [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 23:28:02] [INFO ] [Real]Absence check using 441 positive place invariants in 203 ms returned sat
[2022-06-12 23:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:04] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2022-06-12 23:28:05] [INFO ] Deduced a trap composed of 20 places in 914 ms of which 2 ms to minimize.
[2022-06-12 23:28:06] [INFO ] Deduced a trap composed of 24 places in 928 ms of which 2 ms to minimize.
[2022-06-12 23:28:07] [INFO ] Deduced a trap composed of 20 places in 873 ms of which 2 ms to minimize.
[2022-06-12 23:28:07] [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 23:28:08] [INFO ] [Real]Absence check using 441 positive place invariants in 256 ms returned sat
[2022-06-12 23:28:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:10] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2022-06-12 23:28:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:28:11] [INFO ] [Nat]Absence check using 441 positive place invariants in 254 ms returned sat
[2022-06-12 23:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:14] [INFO ] [Nat]Absence check using state equation in 2648 ms returned sat
[2022-06-12 23:28:15] [INFO ] Deduced a trap composed of 17 places in 924 ms of which 2 ms to minimize.
[2022-06-12 23:28:16] [INFO ] Deduced a trap composed of 27 places in 942 ms of which 2 ms to minimize.
[2022-06-12 23:28:16] [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 23:28:17] [INFO ] [Real]Absence check using 441 positive place invariants in 197 ms returned sat
[2022-06-12 23:28:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:18] [INFO ] [Real]Absence check using state equation in 1813 ms returned sat
[2022-06-12 23:28:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:28:19] [INFO ] [Nat]Absence check using 441 positive place invariants in 215 ms returned sat
[2022-06-12 23:28:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:21] [INFO ] [Nat]Absence check using state equation in 2104 ms returned sat
[2022-06-12 23:28:22] [INFO ] Deduced a trap composed of 20 places in 917 ms of which 2 ms to minimize.
[2022-06-12 23:28:23] [INFO ] Deduced a trap composed of 21 places in 907 ms of which 2 ms to minimize.
[2022-06-12 23:28:24] [INFO ] Deduced a trap composed of 25 places in 873 ms of which 2 ms to minimize.
[2022-06-12 23:28:24] [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 9
[2022-06-12 23:28:25] [INFO ] [Real]Absence check using 441 positive place invariants in 195 ms returned sat
[2022-06-12 23:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:27] [INFO ] [Real]Absence check using state equation in 1657 ms returned sat
[2022-06-12 23:28:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:28:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 198 ms returned sat
[2022-06-12 23:28:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:29] [INFO ] [Nat]Absence check using state equation in 1609 ms returned sat
[2022-06-12 23:28:30] [INFO ] Deduced a trap composed of 27 places in 891 ms of which 2 ms to minimize.
[2022-06-12 23:28:31] [INFO ] Deduced a trap composed of 23 places in 884 ms of which 2 ms to minimize.
[2022-06-12 23:28:32] [INFO ] Deduced a trap composed of 20 places in 932 ms of which 2 ms to minimize.
[2022-06-12 23:28:32] [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 10
[2022-06-12 23:28:33] [INFO ] [Real]Absence check using 441 positive place invariants in 322 ms returned sat
[2022-06-12 23:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:28:37] [INFO ] [Real]Absence check using state equation in 4255 ms returned unknown
Fused 12 Parikh solutions to 1 different solutions.
Support contains 361 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 487 rules applied. Total rules applied 487 place count 3123 transition count 2356
Reduce places removed 487 places and 0 transitions.
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 1 with 583 rules applied. Total rules applied 1070 place count 2636 transition count 2260
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 1167 place count 2540 transition count 2259
Performed 184 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 184 Pre rules applied. Total rules applied 1167 place count 2540 transition count 2075
Deduced a syphon composed of 184 places in 7 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 3 with 368 rules applied. Total rules applied 1535 place count 2356 transition count 2075
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 1771 place count 2120 transition count 1839
Iterating global reduction 3 with 236 rules applied. Total rules applied 2007 place count 2120 transition count 1839
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 2007 place count 2120 transition count 1775
Deduced a syphon composed of 64 places in 10 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 2135 place count 2056 transition count 1775
Performed 514 Post agglomeration using F-continuation condition.Transition count delta: 514
Deduced a syphon composed of 514 places in 4 ms
Reduce places removed 514 places and 0 transitions.
Iterating global reduction 3 with 1028 rules applied. Total rules applied 3163 place count 1542 transition count 1261
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 3295 place count 1476 transition count 1261
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 3306 place count 1476 transition count 1250
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 3317 place count 1465 transition count 1250
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 4 with 96 rules applied. Total rules applied 3413 place count 1465 transition count 1250
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 3415 place count 1465 transition count 1250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3416 place count 1464 transition count 1249
Applied a total of 3416 rules in 1325 ms. Remains 1464 /3123 variables (removed 1659) and now considering 1249/2843 (removed 1594) transitions.
Finished structural reductions, in 1 iterations. Remains : 1464/3123 places, 1249/2843 transitions.
[2022-06-12 23:28:39] [INFO ] Flatten gal took : 197 ms
[2022-06-12 23:28:39] [INFO ] Flatten gal took : 82 ms
[2022-06-12 23:28:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18016991794280045516.gal : 34 ms
[2022-06-12 23:28:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10330847099322642955.prop : 8 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/ReachabilityCardinality18016991794280045516.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10330847099322642955.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/ReachabilityCardinality18016991794280045516.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10330847099322642955.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10330847099322642955.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :9 after 14
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :14 after 15
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :15 after 94
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :94 after 166
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :166 after 2580
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :2580 after 2.08322e+11
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :2.08322e+11 after 6.81798e+24
Detected timeout of ITS tools.
[2022-06-12 23:28:54] [INFO ] Flatten gal took : 65 ms
[2022-06-12 23:28:54] [INFO ] Applying decomposition
[2022-06-12 23:28:54] [INFO ] Flatten gal took : 63 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/graph8580490183212454052.txt, -o, /tmp/graph8580490183212454052.bin, -w, /tmp/graph8580490183212454052.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/graph8580490183212454052.bin, -l, -1, -v, -w, /tmp/graph8580490183212454052.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:28:54] [INFO ] Decomposing Gal with order
[2022-06-12 23:28:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:28:55] [INFO ] Removed a total of 390 redundant transitions.
[2022-06-12 23:28:55] [INFO ] Flatten gal took : 138 ms
[2022-06-12 23:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 62 ms.
[2022-06-12 23:28:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4625089029143333717.gal : 21 ms
[2022-06-12 23:28:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14791448962579703877.prop : 2 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/ReachabilityCardinality4625089029143333717.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14791448962579703877.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/ReachabilityCardinality4625089029143333717.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14791448962579703877.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14791448962579703877.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :3 after 7
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :7 after 155635
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :155635 after 1.99302e+18
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-10 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-09 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-06 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :1.99302e+18 after 5.15265e+39
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-14 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-13 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-03 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-02 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.76657e+48 after 2.12813e+66
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1904339553469998178
[2022-06-12 23:29:10] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1904339553469998178
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/ltsmin1904339553469998178]
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/ltsmin1904339553469998178] 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/ltsmin1904339553469998178] 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 7156 ms. (steps per millisecond=139 ) properties (out of 5) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4679 ms. (steps per millisecond=213 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4312 ms. (steps per millisecond=231 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 876972 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen :{}
Interrupted Best-First random walk after 933679 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 1249 rows 1464 cols
[2022-06-12 23:29:37] [INFO ] Computed 441 place invariants in 18 ms
[2022-06-12 23:29:37] [INFO ] [Real]Absence check using 441 positive place invariants in 90 ms returned sat
[2022-06-12 23:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:29:38] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2022-06-12 23:29:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:29:38] [INFO ] [Nat]Absence check using 441 positive place invariants in 98 ms returned sat
[2022-06-12 23:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:29:39] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2022-06-12 23:29:39] [INFO ] State equation strengthened by 105 read => feed constraints.
[2022-06-12 23:29:39] [INFO ] [Nat]Added 105 Read/Feed constraints in 38 ms returned sat
[2022-06-12 23:29:39] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-06-12 23:29:39] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2022-06-12 23:29:39] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-06-12 23:29:39] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-12 23:29:39] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2022-06-12 23:29:40] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-06-12 23:29:40] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2022-06-12 23:29:40] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2022-06-12 23:29:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1134 ms
[2022-06-12 23:29:40] [INFO ] Computed and/alt/rep : 1224/3164/1224 causal constraints (skipped 0 transitions) in 71 ms.
[2022-06-12 23:30:00] [INFO ] Added : 1005 causal constraints over 201 iterations in 20047 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-12 23:30:00] [INFO ] [Real]Absence check using 441 positive place invariants in 88 ms returned sat
[2022-06-12 23:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:01] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2022-06-12 23:30:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:30:01] [INFO ] [Nat]Absence check using 441 positive place invariants in 96 ms returned sat
[2022-06-12 23:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:02] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2022-06-12 23:30:02] [INFO ] [Nat]Added 105 Read/Feed constraints in 51 ms returned sat
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2022-06-12 23:30:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-06-12 23:30:03] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:30:03] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:30:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1091 ms
[2022-06-12 23:30:03] [INFO ] Computed and/alt/rep : 1224/3164/1224 causal constraints (skipped 0 transitions) in 61 ms.
[2022-06-12 23:30:23] [INFO ] Added : 955 causal constraints over 191 iterations in 20087 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-06-12 23:30:23] [INFO ] [Real]Absence check using 441 positive place invariants in 110 ms returned sat
[2022-06-12 23:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:24] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2022-06-12 23:30:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:30:24] [INFO ] [Nat]Absence check using 441 positive place invariants in 112 ms returned sat
[2022-06-12 23:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:25] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2022-06-12 23:30:25] [INFO ] [Nat]Added 105 Read/Feed constraints in 50 ms returned sat
[2022-06-12 23:30:25] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 0 ms to minimize.
[2022-06-12 23:30:25] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-06-12 23:30:25] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-06-12 23:30:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-06-12 23:30:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-06-12 23:30:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1500 ms
[2022-06-12 23:30:26] [INFO ] Computed and/alt/rep : 1224/3164/1224 causal constraints (skipped 0 transitions) in 67 ms.
[2022-06-12 23:30:46] [INFO ] Added : 980 causal constraints over 196 iterations in 20058 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-12 23:30:47] [INFO ] [Real]Absence check using 441 positive place invariants in 117 ms returned sat
[2022-06-12 23:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:48] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2022-06-12 23:30:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:30:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 115 ms returned sat
[2022-06-12 23:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:30:49] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2022-06-12 23:30:49] [INFO ] [Nat]Added 105 Read/Feed constraints in 43 ms returned sat
[2022-06-12 23:30:49] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2022-06-12 23:30:49] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-12 23:30:49] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2022-06-12 23:30:49] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2022-06-12 23:30:49] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2022-06-12 23:30:49] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:30:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1536 ms
[2022-06-12 23:30:50] [INFO ] Computed and/alt/rep : 1224/3164/1224 causal constraints (skipped 0 transitions) in 54 ms.
[2022-06-12 23:31:10] [INFO ] Added : 955 causal constraints over 191 iterations in 20064 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 45 ms.
Incomplete Parikh walk after 185900 steps, including 747 resets, run finished after 1271 ms. (steps per millisecond=146 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 184600 steps, including 829 resets, run finished after 1214 ms. (steps per millisecond=152 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 183600 steps, including 738 resets, run finished after 1187 ms. (steps per millisecond=154 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 226400 steps, including 941 resets, run finished after 1483 ms. (steps per millisecond=152 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 161 out of 1464 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1464/1464 places, 1249/1249 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 1464 transition count 1212
Reduce places removed 37 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 42 rules applied. Total rules applied 79 place count 1427 transition count 1207
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 1422 transition count 1207
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 84 place count 1422 transition count 1161
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 176 place count 1376 transition count 1161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 1374 transition count 1159
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 1374 transition count 1159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 180 place count 1374 transition count 1158
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 1373 transition count 1158
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 435 place count 1246 transition count 1032
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 435 place count 1246 transition count 1030
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 439 place count 1244 transition count 1030
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 485 place count 1221 transition count 1030
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 487 place count 1221 transition count 1028
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 489 place count 1219 transition count 1028
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 504 place count 1219 transition count 1028
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 505 place count 1218 transition count 1027
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 506 place count 1217 transition count 1026
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 507 place count 1216 transition count 1025
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 508 place count 1215 transition count 1024
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 509 place count 1214 transition count 1023
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 510 place count 1213 transition count 1022
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 511 place count 1212 transition count 1021
Applied a total of 511 rules in 491 ms. Remains 1212 /1464 variables (removed 252) and now considering 1021/1249 (removed 228) transitions.
Finished structural reductions, in 1 iterations. Remains : 1212/1464 places, 1021/1249 transitions.
[2022-06-12 23:31:16] [INFO ] Flatten gal took : 52 ms
[2022-06-12 23:31:16] [INFO ] Flatten gal took : 46 ms
[2022-06-12 23:31:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18044776963424265498.gal : 6 ms
[2022-06-12 23:31:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1609625946972978268.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/ReachabilityCardinality18044776963424265498.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1609625946972978268.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/ReachabilityCardinality18044776963424265498.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1609625946972978268.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1609625946972978268.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 38
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :38 after 599
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :599 after 49942
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :49942 after 2.9963e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.9963e+06 after 2.14062e+13
Detected timeout of ITS tools.
[2022-06-12 23:31:31] [INFO ] Flatten gal took : 43 ms
[2022-06-12 23:31:31] [INFO ] Applying decomposition
[2022-06-12 23:31:31] [INFO ] Flatten gal took : 42 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/graph2413560082536739517.txt, -o, /tmp/graph2413560082536739517.bin, -w, /tmp/graph2413560082536739517.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/graph2413560082536739517.bin, -l, -1, -v, -w, /tmp/graph2413560082536739517.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:31:31] [INFO ] Decomposing Gal with order
[2022-06-12 23:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:31:32] [INFO ] Removed a total of 461 redundant transitions.
[2022-06-12 23:31:32] [INFO ] Flatten gal took : 125 ms
[2022-06-12 23:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 44 ms.
[2022-06-12 23:31:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12221683165348564200.gal : 22 ms
[2022-06-12 23:31:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9353822658777014987.prop : 2 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/ReachabilityCardinality12221683165348564200.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9353822658777014987.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/ReachabilityCardinality12221683165348564200.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9353822658777014987.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9353822658777014987.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 69
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :69 after 14289
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :14289 after 7.55067e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16228368585160148275
[2022-06-12 23:31:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16228368585160148275
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/ltsmin16228368585160148275]
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/ltsmin16228368585160148275] 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/ltsmin16228368585160148275] 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 6713 ms. (steps per millisecond=148 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4739 ms. (steps per millisecond=211 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4455 ms. (steps per millisecond=224 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 866404 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen :{}
Interrupted Best-First random walk after 818709 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen :{}
Interrupted probabilistic random walk after 1807384 steps, run timeout after 30001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 1807384 steps, saw 936607 distinct states, run finished after 30001 ms. (steps per millisecond=60 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 1021 rows 1212 cols
[2022-06-12 23:32:44] [INFO ] Computed 440 place invariants in 11 ms
[2022-06-12 23:32:44] [INFO ] [Real]Absence check using 440 positive place invariants in 85 ms returned sat
[2022-06-12 23:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:32:44] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-06-12 23:32:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:32:45] [INFO ] [Nat]Absence check using 440 positive place invariants in 85 ms returned sat
[2022-06-12 23:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:32:45] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2022-06-12 23:32:45] [INFO ] State equation strengthened by 152 read => feed constraints.
[2022-06-12 23:32:45] [INFO ] [Nat]Added 152 Read/Feed constraints in 33 ms returned sat
[2022-06-12 23:32:45] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:32:45] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:32:45] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:32:45] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2022-06-12 23:32:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 367 ms
[2022-06-12 23:32:46] [INFO ] Computed and/alt/rep : 994/3136/994 causal constraints (skipped 0 transitions) in 47 ms.
[2022-06-12 23:33:06] [INFO ] Added : 950 causal constraints over 190 iterations in 20094 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2022-06-12 23:33:06] [INFO ] [Real]Absence check using 440 positive place invariants in 80 ms returned sat
[2022-06-12 23:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:06] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2022-06-12 23:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:07] [INFO ] [Nat]Absence check using 440 positive place invariants in 81 ms returned sat
[2022-06-12 23:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:07] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-06-12 23:33:07] [INFO ] [Nat]Added 152 Read/Feed constraints in 34 ms returned sat
[2022-06-12 23:33:07] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2022-06-12 23:33:07] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-06-12 23:33:07] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-12 23:33:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 285 ms
[2022-06-12 23:33:07] [INFO ] Computed and/alt/rep : 994/3136/994 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 23:33:28] [INFO ] Added : 882 causal constraints over 177 iterations in 20488 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-06-12 23:33:28] [INFO ] [Real]Absence check using 440 positive place invariants in 96 ms returned sat
[2022-06-12 23:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:28] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2022-06-12 23:33:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:29] [INFO ] [Nat]Absence check using 440 positive place invariants in 98 ms returned sat
[2022-06-12 23:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:29] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-06-12 23:33:29] [INFO ] [Nat]Added 152 Read/Feed constraints in 24 ms returned sat
[2022-06-12 23:33:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2022-06-12 23:33:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2022-06-12 23:33:29] [INFO ] Computed and/alt/rep : 994/3136/994 causal constraints (skipped 0 transitions) in 46 ms.
[2022-06-12 23:33:45] [INFO ] Added : 853 causal constraints over 172 iterations in 15904 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-06-12 23:33:46] [INFO ] [Real]Absence check using 440 positive place invariants in 103 ms returned sat
[2022-06-12 23:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:46] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2022-06-12 23:33:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:33:46] [INFO ] [Nat]Absence check using 440 positive place invariants in 101 ms returned sat
[2022-06-12 23:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:33:47] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2022-06-12 23:33:47] [INFO ] [Nat]Added 152 Read/Feed constraints in 38 ms returned sat
[2022-06-12 23:33:47] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:33:47] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2022-06-12 23:33:47] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2022-06-12 23:33:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-06-12 23:33:47] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2022-06-12 23:33:48] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2022-06-12 23:33:48] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:33:48] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2022-06-12 23:33:48] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2022-06-12 23:33:48] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2022-06-12 23:33:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 886 ms
[2022-06-12 23:33:48] [INFO ] Computed and/alt/rep : 994/3136/994 causal constraints (skipped 0 transitions) in 51 ms.
[2022-06-12 23:34:08] [INFO ] Added : 906 causal constraints over 183 iterations in 20197 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 87 ms.
Incomplete Parikh walk after 190400 steps, including 1000 resets, run finished after 929 ms. (steps per millisecond=204 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 120200 steps, including 1002 resets, run finished after 740 ms. (steps per millisecond=162 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 112900 steps, including 521 resets, run finished after 630 ms. (steps per millisecond=179 ) properties (out of 4) seen :3 could not realise parikh vector
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 177100 steps, including 590 resets, run finished after 1007 ms. (steps per millisecond=175 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 76 out of 1212 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1212/1212 places, 1021/1021 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1212 transition count 1001
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 1192 transition count 1000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 1191 transition count 1000
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 42 place count 1191 transition count 979
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 84 place count 1170 transition count 979
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 1169 transition count 978
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 1169 transition count 978
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 180 place count 1122 transition count 931
Renaming transitions due to excessive name length > 1024 char.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 202 place count 1111 transition count 931
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 1111 transition count 930
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 1110 transition count 930
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 212 place count 1110 transition count 930
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 213 place count 1109 transition count 929
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 214 place count 1108 transition count 928
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 1107 transition count 927
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 216 place count 1106 transition count 926
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 217 place count 1105 transition count 925
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 218 place count 1104 transition count 924
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 1103 transition count 923
Applied a total of 219 rules in 398 ms. Remains 1103 /1212 variables (removed 109) and now considering 923/1021 (removed 98) transitions.
Finished structural reductions, in 1 iterations. Remains : 1103/1212 places, 923/1021 transitions.
[2022-06-12 23:34:12] [INFO ] Flatten gal took : 41 ms
[2022-06-12 23:34:12] [INFO ] Flatten gal took : 41 ms
[2022-06-12 23:34:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7965014255207108756.gal : 4 ms
[2022-06-12 23:34:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1123344461274690192.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/ReachabilityCardinality7965014255207108756.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1123344461274690192.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/ReachabilityCardinality7965014255207108756.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1123344461274690192.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1123344461274690192.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 57
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :57 after 220
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :220 after 1746
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1746 after 3926
Detected timeout of ITS tools.
[2022-06-12 23:34:27] [INFO ] Flatten gal took : 34 ms
[2022-06-12 23:34:27] [INFO ] Applying decomposition
[2022-06-12 23:34:27] [INFO ] Flatten gal took : 33 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/graph6650491384414419009.txt, -o, /tmp/graph6650491384414419009.bin, -w, /tmp/graph6650491384414419009.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/graph6650491384414419009.bin, -l, -1, -v, -w, /tmp/graph6650491384414419009.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:34:27] [INFO ] Decomposing Gal with order
[2022-06-12 23:34:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:34:27] [INFO ] Removed a total of 504 redundant transitions.
[2022-06-12 23:34:27] [INFO ] Flatten gal took : 58 ms
[2022-06-12 23:34:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 15 ms.
[2022-06-12 23:34:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6210097810522160149.gal : 10 ms
[2022-06-12 23:34:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5686534703028632622.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/ReachabilityCardinality6210097810522160149.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5686534703028632622.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/ReachabilityCardinality6210097810522160149.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5686534703028632622.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5686534703028632622.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 19622
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12121404731789784241
[2022-06-12 23:34:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12121404731789784241
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/ltsmin12121404731789784241]
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/ltsmin12121404731789784241] 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/ltsmin12121404731789784241] 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 5993 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 904094 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen :{}
Interrupted probabilistic random walk after 2043143 steps, run timeout after 30001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 2043143 steps, saw 1185960 distinct states, run finished after 30001 ms. (steps per millisecond=68 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 923 rows 1103 cols
[2022-06-12 23:35:24] [INFO ] Computed 440 place invariants in 16 ms
[2022-06-12 23:35:25] [INFO ] [Real]Absence check using 440 positive place invariants in 95 ms returned sat
[2022-06-12 23:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:35:25] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-06-12 23:35:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:35:25] [INFO ] [Nat]Absence check using 440 positive place invariants in 96 ms returned sat
[2022-06-12 23:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:35:26] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2022-06-12 23:35:26] [INFO ] State equation strengthened by 162 read => feed constraints.
[2022-06-12 23:35:26] [INFO ] [Nat]Added 162 Read/Feed constraints in 39 ms returned sat
[2022-06-12 23:35:26] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2022-06-12 23:35:26] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2022-06-12 23:35:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2022-06-12 23:35:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2022-06-12 23:35:26] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-06-12 23:35:26] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-06-12 23:35:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 471 ms
[2022-06-12 23:35:26] [INFO ] Computed and/alt/rep : 905/3062/905 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 23:35:39] [INFO ] Added : 743 causal constraints over 150 iterations in 12307 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
Incomplete Parikh walk after 128900 steps, including 1001 resets, run finished after 758 ms. (steps per millisecond=170 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 76 out of 1103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1103/1103 places, 923/923 transitions.
Applied a total of 0 rules in 23 ms. Remains 1103 /1103 variables (removed 0) and now considering 923/923 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1103/1103 places, 923/923 transitions.
Starting structural reductions, iteration 0 : 1103/1103 places, 923/923 transitions.
Applied a total of 0 rules in 21 ms. Remains 1103 /1103 variables (removed 0) and now considering 923/923 (removed 0) transitions.
// Phase 1: matrix 923 rows 1103 cols
[2022-06-12 23:35:40] [INFO ] Computed 440 place invariants in 8 ms
[2022-06-12 23:35:40] [INFO ] Implicit Places using invariants in 530 ms returned [1086, 1090]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 533 ms to find 2 implicit places.
[2022-06-12 23:35:40] [INFO ] Redundant transitions in 54 ms returned []
// Phase 1: matrix 923 rows 1101 cols
[2022-06-12 23:35:40] [INFO ] Computed 438 place invariants in 4 ms
[2022-06-12 23:35:41] [INFO ] Dead Transitions using invariants and state equation in 440 ms returned []
Starting structural reductions, iteration 1 : 1101/1103 places, 923/923 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1099 transition count 921
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1099 transition count 921
Applied a total of 4 rules in 38 ms. Remains 1099 /1101 variables (removed 2) and now considering 921/923 (removed 2) transitions.
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:35:41] [INFO ] Computed 438 place invariants in 7 ms
[2022-06-12 23:35:41] [INFO ] Implicit Places using invariants in 476 ms returned []
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:35:41] [INFO ] Computed 438 place invariants in 15 ms
[2022-06-12 23:35:42] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-12 23:35:44] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 3170 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1099/1103 places, 921/923 transitions.
[2022-06-12 23:35:44] [INFO ] Flatten gal took : 33 ms
[2022-06-12 23:35:44] [INFO ] Flatten gal took : 31 ms
[2022-06-12 23:35:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4376776254397133133.gal : 4 ms
[2022-06-12 23:35:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13157563403808569958.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/ReachabilityCardinality4376776254397133133.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13157563403808569958.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/ReachabilityCardinality4376776254397133133.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13157563403808569958.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13157563403808569958.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 57
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :57 after 220
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :220 after 1746
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1746 after 3926
Detected timeout of ITS tools.
[2022-06-12 23:36:04] [INFO ] Flatten gal took : 30 ms
[2022-06-12 23:36:04] [INFO ] Applying decomposition
[2022-06-12 23:36:04] [INFO ] Flatten gal took : 30 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/graph799674838124630030.txt, -o, /tmp/graph799674838124630030.bin, -w, /tmp/graph799674838124630030.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/graph799674838124630030.bin, -l, -1, -v, -w, /tmp/graph799674838124630030.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:36:04] [INFO ] Decomposing Gal with order
[2022-06-12 23:36:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:36:04] [INFO ] Removed a total of 505 redundant transitions.
[2022-06-12 23:36:04] [INFO ] Flatten gal took : 53 ms
[2022-06-12 23:36:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 11 ms.
[2022-06-12 23:36:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8960186837029584273.gal : 10 ms
[2022-06-12 23:36:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6658155264248409566.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/ReachabilityCardinality8960186837029584273.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6658155264248409566.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/ReachabilityCardinality8960186837029584273.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6658155264248409566.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6658155264248409566.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 39
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39 after 19622
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14838564473233370103
[2022-06-12 23:36:24] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14838564473233370103
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/ltsmin14838564473233370103]
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/ltsmin14838564473233370103] killed by timeout after 2 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/ltsmin14838564473233370103] killed by timeout after 2 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 6228 ms. (steps per millisecond=160 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 932923 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=186 ) properties seen :{}
Interrupted probabilistic random walk after 2048122 steps, run timeout after 30001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 2048122 steps, saw 1186833 distinct states, run finished after 30001 ms. (steps per millisecond=68 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:37:08] [INFO ] Computed 438 place invariants in 9 ms
[2022-06-12 23:37:08] [INFO ] [Real]Absence check using 438 positive place invariants in 101 ms returned sat
[2022-06-12 23:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:08] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-12 23:37:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:37:09] [INFO ] [Nat]Absence check using 438 positive place invariants in 104 ms returned sat
[2022-06-12 23:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:09] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-06-12 23:37:09] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-12 23:37:09] [INFO ] [Nat]Added 160 Read/Feed constraints in 45 ms returned sat
[2022-06-12 23:37:09] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-06-12 23:37:09] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:37:09] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2022-06-12 23:37:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 894 ms
[2022-06-12 23:37:10] [INFO ] Computed and/alt/rep : 903/3050/903 causal constraints (skipped 0 transitions) in 48 ms.
[2022-06-12 23:37:29] [INFO ] Added : 856 causal constraints over 172 iterations in 19375 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 71 ms.
Incomplete Parikh walk after 171000 steps, including 529 resets, run finished after 1115 ms. (steps per millisecond=153 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 76 out of 1099 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1099/1099 places, 921/921 transitions.
Applied a total of 0 rules in 42 ms. Remains 1099 /1099 variables (removed 0) and now considering 921/921 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1099/1099 places, 921/921 transitions.
Starting structural reductions, iteration 0 : 1099/1099 places, 921/921 transitions.
Applied a total of 0 rules in 22 ms. Remains 1099 /1099 variables (removed 0) and now considering 921/921 (removed 0) transitions.
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:37:31] [INFO ] Computed 438 place invariants in 7 ms
[2022-06-12 23:37:31] [INFO ] Implicit Places using invariants in 533 ms returned []
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:37:31] [INFO ] Computed 438 place invariants in 4 ms
[2022-06-12 23:37:32] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-12 23:37:34] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3274 ms to find 0 implicit places.
[2022-06-12 23:37:34] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:37:34] [INFO ] Computed 438 place invariants in 4 ms
[2022-06-12 23:37:34] [INFO ] Dead Transitions using invariants and state equation in 475 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1099/1099 places, 921/921 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=162 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 921 rows 1099 cols
[2022-06-12 23:37:35] [INFO ] Computed 438 place invariants in 2 ms
[2022-06-12 23:37:35] [INFO ] [Real]Absence check using 438 positive place invariants in 108 ms returned sat
[2022-06-12 23:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:36] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2022-06-12 23:37:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 23:37:36] [INFO ] [Nat]Absence check using 438 positive place invariants in 104 ms returned sat
[2022-06-12 23:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 23:37:37] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2022-06-12 23:37:37] [INFO ] State equation strengthened by 160 read => feed constraints.
[2022-06-12 23:37:37] [INFO ] [Nat]Added 160 Read/Feed constraints in 44 ms returned sat
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-12 23:37:37] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2022-06-12 23:37:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 888 ms
[2022-06-12 23:37:38] [INFO ] Computed and/alt/rep : 903/3050/903 causal constraints (skipped 0 transitions) in 53 ms.
[2022-06-12 23:37:56] [INFO ] Deduced a trap composed of 2 places in 426 ms of which 1 ms to minimize.
[2022-06-12 23:37:56] [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 23:37:56] [INFO ] Flatten gal took : 32 ms
[2022-06-12 23:37:56] [INFO ] Flatten gal took : 32 ms
[2022-06-12 23:37:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12492159903792154413.gal : 4 ms
[2022-06-12 23:37:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9462550810596429250.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/ReachabilityCardinality12492159903792154413.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9462550810596429250.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/ReachabilityCardinality12492159903792154413.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9462550810596429250.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9462550810596429250.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 57
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :57 after 220
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :220 after 1746
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1746 after 3926
Detected timeout of ITS tools.
[2022-06-12 23:38:21] [INFO ] Flatten gal took : 33 ms
[2022-06-12 23:38:21] [INFO ] Applying decomposition
[2022-06-12 23:38:22] [INFO ] Flatten gal took : 40 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/graph16797600984451185145.txt, -o, /tmp/graph16797600984451185145.bin, -w, /tmp/graph16797600984451185145.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/graph16797600984451185145.bin, -l, -1, -v, -w, /tmp/graph16797600984451185145.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 23:38:22] [INFO ] Decomposing Gal with order
[2022-06-12 23:38:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 23:38:22] [INFO ] Removed a total of 504 redundant transitions.
[2022-06-12 23:38:22] [INFO ] Flatten gal took : 66 ms
[2022-06-12 23:38:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 21 ms.
[2022-06-12 23:38:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10165423172802960837.gal : 11 ms
[2022-06-12 23:38:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16925958772516135975.prop : 4 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/ReachabilityCardinality10165423172802960837.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16925958772516135975.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/ReachabilityCardinality10165423172802960837.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16925958772516135975.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16925958772516135975.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 187
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :187 after 9812
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-15 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.10838e+63,3.3208,96452,3032,113,174109,573,2396,466338,142,1933,0
Total reachable state count : 2.108379332509985688400767661667264240826e+63
Verifying 1 reachability properties.
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-15 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityFireability-15,1.64355e+36,3.36172,96452,1192,75,174109,573,2786,466338,159,1933,0
All properties solved without resorting to model-checking.
BK_STOP 1655077107390
--------------------
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="ShieldPPPt-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 ShieldPPPt-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-165286037400252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-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 '
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 ;