fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r389-oct2-167903713800671
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ShieldPPPt-PT-040B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16220.855 3600000.00 10131525.00 64150.40 ?FT?TTTFTTTTTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800671.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
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 r389-oct2-167903713800671
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 762K Mar 5 18:23 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 1679220162052

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 10:02:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 10:02:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:02:44] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-19 10:02:44] [INFO ] Transformed 3123 places.
[2023-03-19 10:02:44] [INFO ] Transformed 2843 transitions.
[2023-03-19 10:02:44] [INFO ] Found NUPN structural information;
[2023-03-19 10:02:44] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 10:02:45] [INFO ] Flatten gal took : 289 ms
[2023-03-19 10:02:45] [INFO ] Flatten gal took : 124 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 713 ms. (steps per millisecond=14 ) properties (out of 16) seen :6
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
[2023-03-19 10:02:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1607408950147195716.gal : 62 ms
[2023-03-19 10:02:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10616052667792111880.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1607408950147195716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10616052667792111880.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Loading property file /tmp/ReachabilityCardinality10616052667792111880.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-19 10:02:46] [INFO ] Computed 441 place invariants in 27 ms
[2023-03-19 10:02:47] [INFO ] After 1025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 10:02:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 233 ms returned sat
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :10 after 19
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-13 is true.
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :19 after 36
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :36 after 47
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :47 after 64
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :64 after 873
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :873 after 303615
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :303615 after 5.34242e+08
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :5.34242e+08 after 1.12436e+16
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-02 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1.12436e+16 after 8.77745e+31
[2023-03-19 10:03:00] [INFO ] After 11063ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 10:03:01] [INFO ] Deduced a trap composed of 20 places in 1237 ms of which 16 ms to minimize.
[2023-03-19 10:03:03] [INFO ] Deduced a trap composed of 25 places in 1485 ms of which 2 ms to minimize.
[2023-03-19 10:03:04] [INFO ] Deduced a trap composed of 18 places in 1002 ms of which 3 ms to minimize.
[2023-03-19 10:03:05] [INFO ] Deduced a trap composed of 22 places in 977 ms of which 2 ms to minimize.
[2023-03-19 10:03:07] [INFO ] Deduced a trap composed of 26 places in 973 ms of which 23 ms to minimize.
[2023-03-19 10:03:08] [INFO ] Deduced a trap composed of 24 places in 882 ms of which 2 ms to minimize.
[2023-03-19 10:03:09] [INFO ] Deduced a trap composed of 35 places in 1094 ms of which 2 ms to minimize.
[2023-03-19 10:03:10] [INFO ] Deduced a trap composed of 32 places in 1090 ms of which 3 ms to minimize.
[2023-03-19 10:03:11] [INFO ] Deduced a trap composed of 28 places in 963 ms of which 2 ms to minimize.
[2023-03-19 10:03:12] [INFO ] Deduced a trap composed of 31 places in 903 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 10:03:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:03:12] [INFO ] After 25662ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2056 ms.
Support contains 207 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 3123 transition count 2258
Reduce places removed 585 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 587 rules applied. Total rules applied 1172 place count 2538 transition count 2256
Reduce places removed 1 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 2 with 70 rules applied. Total rules applied 1242 place count 2537 transition count 2187
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 3 with 69 rules applied. Total rules applied 1311 place count 2468 transition count 2187
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 170 Pre rules applied. Total rules applied 1311 place count 2468 transition count 2017
Deduced a syphon composed of 170 places in 9 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1651 place count 2298 transition count 2017
Discarding 265 places :
Symmetric choice reduction at 4 with 265 rule applications. Total rules 1916 place count 2033 transition count 1752
Iterating global reduction 4 with 265 rules applied. Total rules applied 2181 place count 2033 transition count 1752
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 2181 place count 2033 transition count 1668
Deduced a syphon composed of 84 places in 28 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 2349 place count 1949 transition count 1668
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Deduced a syphon composed of 606 places in 3 ms
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 3561 place count 1343 transition count 1062
Renaming transitions due to excessive name length > 1024 char.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 3705 place count 1271 transition count 1062
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3713 place count 1271 transition count 1054
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 3721 place count 1263 transition count 1054
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 5 with 97 rules applied. Total rules applied 3818 place count 1263 transition count 1054
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3819 place count 1262 transition count 1053
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3820 place count 1261 transition count 1053
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3820 place count 1261 transition count 1051
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3824 place count 1259 transition count 1051
Applied a total of 3824 rules in 1196 ms. Remains 1259 /3123 variables (removed 1864) and now considering 1051/2843 (removed 1792) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1197 ms. Remains : 1259/3123 places, 1051/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 71089 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71089 steps, saw 52876 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1051 rows 1259 cols
[2023-03-19 10:03:20] [INFO ] Computed 440 place invariants in 5 ms
[2023-03-19 10:03:20] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 10:03:21] [INFO ] [Nat]Absence check using 440 positive place invariants in 117 ms returned sat
[2023-03-19 10:03:23] [INFO ] After 1935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 10:03:23] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-19 10:03:25] [INFO ] After 1802ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 10:03:26] [INFO ] Deduced a trap composed of 6 places in 334 ms of which 11 ms to minimize.
[2023-03-19 10:03:26] [INFO ] Deduced a trap composed of 8 places in 367 ms of which 1 ms to minimize.
[2023-03-19 10:03:26] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 0 ms to minimize.
[2023-03-19 10:03:27] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-03-19 10:03:27] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-19 10:03:27] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 5 places in 495 ms of which 0 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2023-03-19 10:03:30] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-19 10:03:30] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 2 ms to minimize.
[2023-03-19 10:03:30] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 0 ms to minimize.
[2023-03-19 10:03:33] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-19 10:03:33] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 14 ms to minimize.
[2023-03-19 10:03:33] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 17 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 11 places in 230 ms of which 1 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8855 ms
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 1 ms to minimize.
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 1 ms to minimize.
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 2 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 1 ms to minimize.
[2023-03-19 10:03:37] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2023-03-19 10:03:37] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 14 ms to minimize.
[2023-03-19 10:03:37] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 0 ms to minimize.
[2023-03-19 10:03:38] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 5 ms to minimize.
[2023-03-19 10:03:38] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2023-03-19 10:03:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3481 ms
[2023-03-19 10:03:38] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 7 ms to minimize.
[2023-03-19 10:03:39] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 0 ms to minimize.
[2023-03-19 10:03:39] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 1 ms to minimize.
[2023-03-19 10:03:39] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 1 ms to minimize.
[2023-03-19 10:03:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1378 ms
[2023-03-19 10:03:40] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 14 ms to minimize.
[2023-03-19 10:03:40] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2023-03-19 10:03:40] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 1 ms to minimize.
[2023-03-19 10:03:40] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-19 10:03:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1020 ms
[2023-03-19 10:03:41] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 2 ms to minimize.
[2023-03-19 10:03:41] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-19 10:03:42] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 1 ms to minimize.
[2023-03-19 10:03:42] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2023-03-19 10:03:42] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 0 ms to minimize.
[2023-03-19 10:03:43] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2023-03-19 10:03:43] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2023-03-19 10:03:43] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 1 ms to minimize.
[2023-03-19 10:03:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2426 ms
[2023-03-19 10:03:44] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 2 ms to minimize.
[2023-03-19 10:03:44] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-19 10:03:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 663 ms
[2023-03-19 10:03:45] [INFO ] After 21453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-19 10:03:45] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 382 ms.
Support contains 207 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Applied a total of 0 rules in 46 ms. Remains 1259 /1259 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1259/1259 places, 1051/1051 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1051/1051 transitions.
Applied a total of 0 rules in 63 ms. Remains 1259 /1259 variables (removed 0) and now considering 1051/1051 (removed 0) transitions.
[2023-03-19 10:03:46] [INFO ] Invariant cache hit.
[2023-03-19 10:03:46] [INFO ] Implicit Places using invariants in 632 ms returned [1240, 1244]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 648 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1257/1259 places, 1051/1051 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1255 transition count 1049
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1255 transition count 1049
Applied a total of 4 rules in 82 ms. Remains 1255 /1257 variables (removed 2) and now considering 1049/1051 (removed 2) transitions.
// Phase 1: matrix 1049 rows 1255 cols
[2023-03-19 10:03:47] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-19 10:03:47] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-19 10:03:47] [INFO ] Invariant cache hit.
[2023-03-19 10:03:48] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-19 10:03:51] [INFO ] Implicit Places using invariants and state equation in 3334 ms returned []
Implicit Place search using SMT with State Equation took 4153 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1255/1259 places, 1049/1051 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4947 ms. Remains : 1255/1259 places, 1049/1051 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 10:03:52] [INFO ] Invariant cache hit.
[2023-03-19 10:03:52] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 10:03:53] [INFO ] [Nat]Absence check using 438 positive place invariants in 197 ms returned sat
[2023-03-19 10:03:54] [INFO ] After 1499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 10:03:54] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-19 10:03:56] [INFO ] After 1667ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 10:03:57] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 14 ms to minimize.
[2023-03-19 10:03:57] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 3 ms to minimize.
[2023-03-19 10:03:57] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-03-19 10:03:58] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-19 10:03:58] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 1 ms to minimize.
[2023-03-19 10:03:58] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 0 ms to minimize.
[2023-03-19 10:03:59] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-19 10:03:59] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-19 10:03:59] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 0 ms to minimize.
[2023-03-19 10:04:00] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-19 10:04:00] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2023-03-19 10:04:00] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-19 10:04:01] [INFO ] Deduced a trap composed of 11 places in 360 ms of which 1 ms to minimize.
[2023-03-19 10:04:01] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2023-03-19 10:04:01] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-19 10:04:01] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-19 10:04:02] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 0 ms to minimize.
[2023-03-19 10:04:02] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-19 10:04:02] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 1 ms to minimize.
[2023-03-19 10:04:02] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5880 ms
[2023-03-19 10:04:04] [INFO ] Deduced a trap composed of 9 places in 762 ms of which 1 ms to minimize.
[2023-03-19 10:04:04] [INFO ] Deduced a trap composed of 6 places in 492 ms of which 1 ms to minimize.
[2023-03-19 10:04:05] [INFO ] Deduced a trap composed of 10 places in 500 ms of which 1 ms to minimize.
[2023-03-19 10:04:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1966 ms
[2023-03-19 10:04:06] [INFO ] Deduced a trap composed of 7 places in 669 ms of which 0 ms to minimize.
[2023-03-19 10:04:06] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 1 ms to minimize.
[2023-03-19 10:04:06] [INFO ] Deduced a trap composed of 7 places in 284 ms of which 1 ms to minimize.
[2023-03-19 10:04:07] [INFO ] Deduced a trap composed of 8 places in 487 ms of which 1 ms to minimize.
[2023-03-19 10:04:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2151 ms
[2023-03-19 10:04:07] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-19 10:04:08] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-19 10:04:08] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 1 ms to minimize.
[2023-03-19 10:04:08] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 1 ms to minimize.
[2023-03-19 10:04:09] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2023-03-19 10:04:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1655 ms
[2023-03-19 10:04:09] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-19 10:04:10] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-19 10:04:10] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-19 10:04:10] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2023-03-19 10:04:10] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 0 ms to minimize.
[2023-03-19 10:04:11] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-19 10:04:11] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-19 10:04:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1750 ms
[2023-03-19 10:04:11] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-19 10:04:12] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2023-03-19 10:04:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
[2023-03-19 10:04:12] [INFO ] After 17507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1737 ms.
[2023-03-19 10:04:14] [INFO ] After 21629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 304 ms.
Support contains 205 out of 1255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1255/1255 places, 1049/1049 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1255 transition count 1048
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1254 transition count 1048
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1253 transition count 1047
Applied a total of 4 rules in 65 ms. Remains 1253 /1255 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1253/1255 places, 1047/1049 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 69539 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69539 steps, saw 50705 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1047 rows 1253 cols
[2023-03-19 10:04:18] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-19 10:04:19] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 10:04:19] [INFO ] [Nat]Absence check using 438 positive place invariants in 201 ms returned sat
[2023-03-19 10:04:21] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 10:04:21] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-19 10:04:22] [INFO ] After 1542ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 10:04:23] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-19 10:04:23] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2023-03-19 10:04:24] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2023-03-19 10:04:24] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-19 10:04:24] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-19 10:04:24] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-19 10:04:24] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-19 10:04:25] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-19 10:04:25] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 1 ms to minimize.
[2023-03-19 10:04:25] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-19 10:04:26] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 0 ms to minimize.
[2023-03-19 10:04:26] [INFO ] Deduced a trap composed of 6 places in 434 ms of which 0 ms to minimize.
[2023-03-19 10:04:26] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-19 10:04:27] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 1 ms to minimize.
[2023-03-19 10:04:27] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-19 10:04:27] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-19 10:04:27] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 1 ms to minimize.
[2023-03-19 10:04:28] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-19 10:04:28] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 0 ms to minimize.
[2023-03-19 10:04:28] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 1 ms to minimize.
[2023-03-19 10:04:28] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5721 ms
[2023-03-19 10:04:29] [INFO ] Deduced a trap composed of 7 places in 468 ms of which 1 ms to minimize.
[2023-03-19 10:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 613 ms
[2023-03-19 10:04:30] [INFO ] Deduced a trap composed of 6 places in 396 ms of which 1 ms to minimize.
[2023-03-19 10:04:31] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 1 ms to minimize.
[2023-03-19 10:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1017 ms
[2023-03-19 10:04:31] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 1 ms to minimize.
[2023-03-19 10:04:32] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-19 10:04:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 775 ms
[2023-03-19 10:04:32] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 0 ms to minimize.
[2023-03-19 10:04:32] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-19 10:04:33] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 2 ms to minimize.
[2023-03-19 10:04:33] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 1 ms to minimize.
[2023-03-19 10:04:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1149 ms
[2023-03-19 10:04:34] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-19 10:04:34] [INFO ] Deduced a trap composed of 15 places in 334 ms of which 0 ms to minimize.
[2023-03-19 10:04:34] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-19 10:04:35] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 1 ms to minimize.
[2023-03-19 10:04:35] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2023-03-19 10:04:35] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2023-03-19 10:04:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1924 ms
[2023-03-19 10:04:36] [INFO ] After 14668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1415 ms.
[2023-03-19 10:04:37] [INFO ] After 18446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 550 ms.
Support contains 205 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1047/1047 transitions.
Applied a total of 0 rules in 48 ms. Remains 1253 /1253 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1253/1253 places, 1047/1047 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1047/1047 transitions.
Applied a total of 0 rules in 34 ms. Remains 1253 /1253 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
[2023-03-19 10:04:38] [INFO ] Invariant cache hit.
[2023-03-19 10:04:38] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-19 10:04:38] [INFO ] Invariant cache hit.
[2023-03-19 10:04:39] [INFO ] State equation strengthened by 115 read => feed constraints.
[2023-03-19 10:04:41] [INFO ] Implicit Places using invariants and state equation in 2790 ms returned []
Implicit Place search using SMT with State Equation took 3344 ms to find 0 implicit places.
[2023-03-19 10:04:41] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-19 10:04:41] [INFO ] Invariant cache hit.
[2023-03-19 10:04:42] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4307 ms. Remains : 1253/1253 places, 1047/1047 transitions.
Partial Free-agglomeration rule applied 128 times.
Drop transitions removed 128 transitions
Iterating global reduction 0 with 128 rules applied. Total rules applied 128 place count 1253 transition count 1047
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 1253 transition count 1046
Applied a total of 129 rules in 100 ms. Remains 1253 /1253 variables (removed 0) and now considering 1046/1047 (removed 1) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1046 rows 1253 cols
[2023-03-19 10:04:42] [INFO ] Computed 438 place invariants in 3 ms
[2023-03-19 10:04:42] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 10:04:43] [INFO ] [Nat]Absence check using 438 positive place invariants in 108 ms returned sat
[2023-03-19 10:04:45] [INFO ] After 1717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 10:04:45] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-19 10:04:46] [INFO ] After 1402ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-19 10:04:47] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 1 ms to minimize.
[2023-03-19 10:04:48] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 1 ms to minimize.
[2023-03-19 10:04:48] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 1 ms to minimize.
[2023-03-19 10:04:49] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 1 ms to minimize.
[2023-03-19 10:04:49] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 0 ms to minimize.
[2023-03-19 10:04:50] [INFO ] Deduced a trap composed of 9 places in 440 ms of which 1 ms to minimize.
[2023-03-19 10:04:50] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2023-03-19 10:04:50] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 1 ms to minimize.
[2023-03-19 10:04:51] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-19 10:04:51] [INFO ] Deduced a trap composed of 13 places in 272 ms of which 1 ms to minimize.
[2023-03-19 10:04:51] [INFO ] Deduced a trap composed of 8 places in 334 ms of which 0 ms to minimize.
[2023-03-19 10:04:52] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 0 ms to minimize.
[2023-03-19 10:04:52] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 1 ms to minimize.
[2023-03-19 10:04:52] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 0 ms to minimize.
[2023-03-19 10:04:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5586 ms
[2023-03-19 10:04:53] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 0 ms to minimize.
[2023-03-19 10:04:54] [INFO ] Deduced a trap composed of 11 places in 332 ms of which 0 ms to minimize.
[2023-03-19 10:04:54] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2023-03-19 10:04:54] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 1 ms to minimize.
[2023-03-19 10:04:55] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2023-03-19 10:04:55] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 0 ms to minimize.
[2023-03-19 10:04:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2060 ms
[2023-03-19 10:04:55] [INFO ] Deduced a trap composed of 15 places in 233 ms of which 1 ms to minimize.
[2023-03-19 10:04:56] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-19 10:04:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 628 ms
[2023-03-19 10:04:56] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2023-03-19 10:04:56] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 1 ms to minimize.
[2023-03-19 10:04:57] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 1 ms to minimize.
[2023-03-19 10:04:57] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2023-03-19 10:04:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1331 ms
[2023-03-19 10:04:58] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-19 10:04:58] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2023-03-19 10:04:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 641 ms
[2023-03-19 10:04:59] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2023-03-19 10:04:59] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
[2023-03-19 10:04:59] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 1 ms to minimize.
[2023-03-19 10:04:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 915 ms
[2023-03-19 10:04:59] [INFO ] After 14868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2136 ms.
[2023-03-19 10:05:02] [INFO ] After 19389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-19 10:05:02] [INFO ] Flatten gal took : 96 ms
[2023-03-19 10:05:02] [INFO ] Flatten gal took : 49 ms
[2023-03-19 10:05:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9764437060031143270.gal : 9 ms
[2023-03-19 10:05:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6674385171962576218.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9764437060031143270.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6674385171962576218.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6674385171962576218.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :16 after 25
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :25 after 58
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :58 after 266
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :266 after 3438
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3438 after 5.75079e+06
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :5.75079e+06 after 4.86819e+16
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-10 is true.
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :9.81427e+19 after 3.52801e+20
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :3.52801e+20 after 3.52801e+20
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :3.52801e+20 after 3.52801e+20
Detected timeout of ITS tools.
[2023-03-19 10:05:17] [INFO ] Flatten gal took : 88 ms
[2023-03-19 10:05:17] [INFO ] Applying decomposition
[2023-03-19 10:05:17] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5892579858270427899.txt' '-o' '/tmp/graph5892579858270427899.bin' '-w' '/tmp/graph5892579858270427899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5892579858270427899.bin' '-l' '-1' '-v' '-w' '/tmp/graph5892579858270427899.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:05:17] [INFO ] Decomposing Gal with order
[2023-03-19 10:05:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:05:17] [INFO ] Removed a total of 306 redundant transitions.
[2023-03-19 10:05:18] [INFO ] Flatten gal took : 120 ms
[2023-03-19 10:05:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 35 ms.
[2023-03-19 10:05:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14519155571086784262.gal : 15 ms
[2023-03-19 10:05:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4418024751033418204.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14519155571086784262.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4418024751033418204.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4418024751033418204.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 11
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :11 after 2196
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :2196 after 300816
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :300816 after 4.72342e+06
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :4.72342e+06 after 1.4492e+10
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1.4492e+10 after 7.30229e+16
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-01 does not hold.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :6.91416e+22 after 4.5047e+50
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2763175388548142776
[2023-03-19 10:05:33] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2763175388548142776
Running compilation step : cd /tmp/ltsmin2763175388548142776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2676 ms.
Running link step : cd /tmp/ltsmin2763175388548142776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin2763175388548142776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPtPT040BReachabilityFireability00==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 10:05:48] [INFO ] Flatten gal took : 69 ms
[2023-03-19 10:05:48] [INFO ] Applying decomposition
[2023-03-19 10:05:48] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2950346212107157920.txt' '-o' '/tmp/graph2950346212107157920.bin' '-w' '/tmp/graph2950346212107157920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2950346212107157920.bin' '-l' '-1' '-v' '-w' '/tmp/graph2950346212107157920.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:05:48] [INFO ] Decomposing Gal with order
[2023-03-19 10:05:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:05:49] [INFO ] Removed a total of 240 redundant transitions.
[2023-03-19 10:05:49] [INFO ] Flatten gal took : 130 ms
[2023-03-19 10:05:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-19 10:05:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4701005968354542688.gal : 20 ms
[2023-03-19 10:05:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14626908031720101268.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4701005968354542688.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14626908031720101268.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14626908031720101268.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :1 after 3234
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :3234 after 1.50301e+45
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :1.50301e+45 after 9.26866e+119
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-15 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
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-07 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-05 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityFireability-04 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPt-PT-040B-ReachabilityFireability-01 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9.26866e+119 after 5.63846e+147
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 10:35:55] [INFO ] Flatten gal took : 3764 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1285551802598074118
[2023-03-19 10:35:56] [INFO ] Computing symmetric may disable matrix : 1047 transitions.
[2023-03-19 10:35:56] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:35:56] [INFO ] Computing symmetric may enable matrix : 1047 transitions.
[2023-03-19 10:35:56] [INFO ] Computation of Complete enable matrix. took 138 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:35:56] [INFO ] Applying decomposition
[2023-03-19 10:35:56] [INFO ] Flatten gal took : 417 ms
[2023-03-19 10:35:58] [INFO ] Computing Do-Not-Accords matrix : 1047 transitions.
[2023-03-19 10:35:58] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 10:35:59] [INFO ] Built C files in 3197ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1285551802598074118
Running compilation step : cd /tmp/ltsmin1285551802598074118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10602426554213193604.txt' '-o' '/tmp/graph10602426554213193604.bin' '-w' '/tmp/graph10602426554213193604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10602426554213193604.bin' '-l' '-1' '-v' '-w' '/tmp/graph10602426554213193604.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:36:00] [INFO ] Decomposing Gal with order
[2023-03-19 10:36:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:36:01] [INFO ] Removed a total of 420 redundant transitions.
[2023-03-19 10:36:01] [INFO ] Flatten gal took : 82 ms
[2023-03-19 10:36:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 50 ms.
[2023-03-19 10:36:01] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6780533169837135905.gal : 29 ms
[2023-03-19 10:36:01] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5121539576148724758.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6780533169837135905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5121539576148724758.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability5121539576148724758.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6 after 1726
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1726 after 91636
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :91636 after 1.56513e+12
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.52082e+25 after 2.61511e+42
Compilation finished in 6847 ms.
Running link step : cd /tmp/ltsmin1285551802598074118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 80 ms.
Running LTSmin : cd /tmp/ltsmin1285551802598074118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPtPT040BReachabilityFireability00==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 146348 kB
After kill :
MemTotal: 16393220 kB
MemFree: 13655736 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
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 r389-oct2-167903713800671"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;