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-167903713700526.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 ShieldPPPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713700526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 1.8M 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 ShieldPPPs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679212120669

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 07:48:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 07:48:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:48:43] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2023-03-19 07:48:43] [INFO ] Transformed 6803 places.
[2023-03-19 07:48:43] [INFO ] Transformed 6303 transitions.
[2023-03-19 07:48:43] [INFO ] Found NUPN structural information;
[2023-03-19 07:48:43] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 621 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 07:48:44] [INFO ] Flatten gal took : 460 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 870 ms. (steps per millisecond=11 ) properties (out of 13) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) 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 11) seen :0
[2023-03-19 07:48:44] [INFO ] Flatten gal took : 266 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
[2023-03-19 07:48:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18411328904437818985.gal : 106 ms
[2023-03-19 07:48:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17616582110158324540.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18411328904437818985.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17616582110158324540.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) 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 11) seen :0

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 ...330
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-19 07:48:45] [INFO ] Computed 1101 place invariants in 58 ms
Loading property file /tmp/ReachabilityCardinality17616582110158324540.prop.
[2023-03-19 07:48:47] [INFO ] After 2399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 07:48:50] [INFO ] [Nat]Absence check using 1101 positive place invariants in 943 ms returned sat
[2023-03-19 07:49:02] [INFO ] After 9952ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 07:49:08] [INFO ] Deduced a trap composed of 23 places in 5073 ms of which 50 ms to minimize.
[2023-03-19 07:49:11] [INFO ] Deduced a trap composed of 11 places in 3427 ms of which 30 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :69 after 204
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :204 after 634
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :634 after 1.60471e+06
Reachability property ShieldPPPs-PT-100B-ReachabilityCardinality-14 is true.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :1.60471e+06 after 5.81902e+13
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :5.81902e+13 after 6.85824e+23
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :6.85824e+23 after 1.96343e+41
[2023-03-19 07:49:16] [INFO ] Deduced a trap composed of 24 places in 3804 ms of which 34 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 07:49:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:49:16] [INFO ] After 28371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Invariant property ShieldPPPs-PT-100B-ReachabilityCardinality-03 does not hold.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.96343e+41 after 2.69077e+79
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2.69077e+79 after 4.15966e+116
Invariant property ShieldPPPs-PT-100B-ReachabilityCardinality-07 does not hold.
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :4.15966e+116 after 6.55141e+199
Invariant property ShieldPPPs-PT-100B-ReachabilityCardinality-11 does not hold.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :6.55141e+199 after 5.25371e+275
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :5.25371e+275 after 5.25371e+275
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :5.25371e+275 after 5.25371e+275
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :5.25371e+275 after 5.25371e+275
Parikh walk visited 2 properties in 4285 ms.
Support contains 54 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 684 rules applied. Total rules applied 684 place count 6803 transition count 5619
Reduce places removed 684 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 694 rules applied. Total rules applied 1378 place count 6119 transition count 5609
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1388 place count 6109 transition count 5609
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1388 place count 6109 transition count 5109
Deduced a syphon composed of 500 places in 32 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2388 place count 5609 transition count 5109
Discarding 685 places :
Symmetric choice reduction at 3 with 685 rule applications. Total rules 3073 place count 4924 transition count 4424
Iterating global reduction 3 with 685 rules applied. Total rules applied 3758 place count 4924 transition count 4424
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 3758 place count 4924 transition count 4137
Deduced a syphon composed of 287 places in 57 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 4332 place count 4637 transition count 4137
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :5.25371e+275 after 5.25371e+275
Performed 1483 Post agglomeration using F-continuation condition.Transition count delta: 1483
Deduced a syphon composed of 1483 places in 9 ms
Reduce places removed 1483 places and 0 transitions.
Iterating global reduction 3 with 2966 rules applied. Total rules applied 7298 place count 3154 transition count 2654
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 880 times.
Drop transitions removed 880 transitions
Iterating global reduction 3 with 880 rules applied. Total rules applied 8178 place count 3154 transition count 2654
Applied a total of 8178 rules in 2777 ms. Remains 3154 /6803 variables (removed 3649) and now considering 2654/6303 (removed 3649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2778 ms. Remains : 3154/6803 places, 2654/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 8) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2654 rows 3154 cols
[2023-03-19 07:49:24] [INFO ] Computed 1101 place invariants in 190 ms
[2023-03-19 07:49:25] [INFO ] After 805ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 07:49:26] [INFO ] [Nat]Absence check using 1043 positive place invariants in 331 ms returned sat
[2023-03-19 07:49:26] [INFO ] [Nat]Absence check using 1043 positive and 58 generalized place invariants in 31 ms returned sat
SDD proceeding with computation,9 properties remain. new max is 131072
SDD size :5.25371e+275 after 5.25371e+275
SDD proceeding with computation,9 properties remain. new max is 262144
SDD size :5.25371e+275 after 5.25371e+275
[2023-03-19 07:49:38] [INFO ] After 11630ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 07:49:39] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 2 ms to minimize.
[2023-03-19 07:49:40] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 0 ms to minimize.
[2023-03-19 07:49:42] [INFO ] Deduced a trap composed of 7 places in 1914 ms of which 3 ms to minimize.
[2023-03-19 07:49:42] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 1 ms to minimize.
[2023-03-19 07:49:43] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2023-03-19 07:49:43] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2023-03-19 07:49:43] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-19 07:49:44] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-19 07:49:44] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-19 07:49:44] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 0 ms to minimize.
[2023-03-19 07:49:45] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-19 07:49:45] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 0 ms to minimize.
[2023-03-19 07:49:46] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 1 ms to minimize.
[2023-03-19 07:49:46] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-19 07:49:47] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 0 ms to minimize.
[2023-03-19 07:49:47] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2023-03-19 07:49:47] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-19 07:49:48] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 9450 ms
[2023-03-19 07:49:49] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2023-03-19 07:49:50] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2023-03-19 07:49:50] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2023-03-19 07:49:53] [INFO ] Deduced a trap composed of 3 places in 3260 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 07:49:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:49:53] [INFO ] After 28354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 730 ms.
Support contains 48 out of 3154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3154/3154 places, 2654/2654 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3151 transition count 2651
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 3150 transition count 2650
Applied a total of 7 rules in 456 ms. Remains 3150 /3154 variables (removed 4) and now considering 2650/2654 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 3150/3154 places, 2650/2654 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2650 rows 3150 cols
[2023-03-19 07:49:56] [INFO ] Computed 1101 place invariants in 49 ms
[2023-03-19 07:49:56] [INFO ] After 749ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 07:49:58] [INFO ] [Nat]Absence check using 1056 positive place invariants in 317 ms returned sat
[2023-03-19 07:49:58] [INFO ] [Nat]Absence check using 1056 positive and 45 generalized place invariants in 22 ms returned sat
[2023-03-19 07:50:10] [INFO ] After 11770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 07:50:10] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
[2023-03-19 07:50:11] [INFO ] Deduced a trap composed of 6 places in 276 ms of which 1 ms to minimize.
[2023-03-19 07:50:11] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 1 ms to minimize.
[2023-03-19 07:50:12] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 1 ms to minimize.
[2023-03-19 07:50:12] [INFO ] Deduced a trap composed of 6 places in 389 ms of which 1 ms to minimize.
[2023-03-19 07:50:13] [INFO ] Deduced a trap composed of 6 places in 442 ms of which 1 ms to minimize.
SDD proceeding with computation,9 properties remain. new max is 524288
[2023-03-19 07:50:14] [INFO ] Deduced a trap composed of 7 places in 439 ms of which 1 ms to minimize.
SDD size :5.25371e+275 after 5.25371e+275
[2023-03-19 07:50:14] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 1 ms to minimize.
[2023-03-19 07:50:15] [INFO ] Deduced a trap composed of 6 places in 495 ms of which 2 ms to minimize.
[2023-03-19 07:50:16] [INFO ] Deduced a trap composed of 10 places in 458 ms of which 2 ms to minimize.
[2023-03-19 07:50:16] [INFO ] Deduced a trap composed of 9 places in 503 ms of which 0 ms to minimize.
[2023-03-19 07:50:17] [INFO ] Deduced a trap composed of 7 places in 400 ms of which 1 ms to minimize.
[2023-03-19 07:50:18] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 2 ms to minimize.
[2023-03-19 07:50:18] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-19 07:50:19] [INFO ] Deduced a trap composed of 6 places in 422 ms of which 1 ms to minimize.
[2023-03-19 07:50:19] [INFO ] Deduced a trap composed of 5 places in 407 ms of which 1 ms to minimize.
[2023-03-19 07:50:20] [INFO ] Deduced a trap composed of 8 places in 705 ms of which 1 ms to minimize.
[2023-03-19 07:50:21] [INFO ] Deduced a trap composed of 7 places in 535 ms of which 1 ms to minimize.
[2023-03-19 07:50:21] [INFO ] Deduced a trap composed of 7 places in 449 ms of which 2 ms to minimize.
[2023-03-19 07:50:22] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 1 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 07:50:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:50:22] [INFO ] After 25425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 971 ms.
Support contains 47 out of 3150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3149 transition count 2649
Applied a total of 2 rules in 403 ms. Remains 3149 /3150 variables (removed 1) and now considering 2649/2650 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 3149/3150 places, 2649/2650 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 59638 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59638 steps, saw 56710 distinct states, run finished after 3006 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2649 rows 3149 cols
[2023-03-19 07:50:27] [INFO ] Computed 1101 place invariants in 27 ms
[2023-03-19 07:50:28] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 07:50:30] [INFO ] [Nat]Absence check using 1041 positive place invariants in 704 ms returned sat
[2023-03-19 07:50:30] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 12 ms returned sat
[2023-03-19 07:50:43] [INFO ] After 13165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:50:45] [INFO ] Deduced a trap composed of 6 places in 535 ms of which 1 ms to minimize.
[2023-03-19 07:50:46] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 1 ms to minimize.
[2023-03-19 07:50:46] [INFO ] Deduced a trap composed of 5 places in 412 ms of which 1 ms to minimize.
[2023-03-19 07:50:47] [INFO ] Deduced a trap composed of 3 places in 495 ms of which 14 ms to minimize.
[2023-03-19 07:50:48] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 1 ms to minimize.
[2023-03-19 07:50:49] [INFO ] Deduced a trap composed of 8 places in 411 ms of which 1 ms to minimize.
[2023-03-19 07:50:49] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 1 ms to minimize.
[2023-03-19 07:50:50] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 0 ms to minimize.
[2023-03-19 07:50:50] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 2 ms to minimize.
[2023-03-19 07:50:51] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 1 ms to minimize.
[2023-03-19 07:50:51] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 0 ms to minimize.
[2023-03-19 07:50:52] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 0 ms to minimize.
[2023-03-19 07:50:52] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 1 ms to minimize.
[2023-03-19 07:50:53] [INFO ] Deduced a trap composed of 7 places in 442 ms of which 8 ms to minimize.
[2023-03-19 07:50:53] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-19 07:50:53] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 8547 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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 07:50:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:50:53] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 1082 ms.
Support contains 47 out of 3149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3149/3149 places, 2649/2649 transitions.
Applied a total of 0 rules in 174 ms. Remains 3149 /3149 variables (removed 0) and now considering 2649/2649 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 3149/3149 places, 2649/2649 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3149/3149 places, 2649/2649 transitions.
Applied a total of 0 rules in 180 ms. Remains 3149 /3149 variables (removed 0) and now considering 2649/2649 (removed 0) transitions.
[2023-03-19 07:50:55] [INFO ] Invariant cache hit.
[2023-03-19 07:50:58] [INFO ] Implicit Places using invariants in 3474 ms returned []
[2023-03-19 07:50:58] [INFO ] Invariant cache hit.
[2023-03-19 07:51:01] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 6046 ms to find 0 implicit places.
[2023-03-19 07:51:01] [INFO ] Redundant transitions in 223 ms returned []
[2023-03-19 07:51:01] [INFO ] Invariant cache hit.
[2023-03-19 07:51:04] [INFO ] Dead Transitions using invariants and state equation in 2756 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9230 ms. Remains : 3149/3149 places, 2649/2649 transitions.
Applied a total of 0 rules in 207 ms. Remains 3149 /3149 variables (removed 0) and now considering 2649/2649 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-19 07:51:04] [INFO ] Invariant cache hit.
[2023-03-19 07:51:04] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 07:51:06] [INFO ] [Nat]Absence check using 1041 positive place invariants in 294 ms returned sat
[2023-03-19 07:51:06] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 163 ms returned sat
SDD proceeding with computation,9 properties remain. new max is 1048576
SDD size :5.25371e+275 after 5.25371e+275
[2023-03-19 07:51:18] [INFO ] After 12231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:51:20] [INFO ] Deduced a trap composed of 3 places in 570 ms of which 1 ms to minimize.
[2023-03-19 07:51:21] [INFO ] Deduced a trap composed of 10 places in 432 ms of which 10 ms to minimize.
[2023-03-19 07:51:21] [INFO ] Deduced a trap composed of 7 places in 386 ms of which 1 ms to minimize.
[2023-03-19 07:51:22] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 1 ms to minimize.
[2023-03-19 07:51:22] [INFO ] Deduced a trap composed of 10 places in 579 ms of which 14 ms to minimize.
[2023-03-19 07:51:23] [INFO ] Deduced a trap composed of 6 places in 576 ms of which 35 ms to minimize.
[2023-03-19 07:51:25] [INFO ] Deduced a trap composed of 15 places in 1278 ms of which 1 ms to minimize.
[2023-03-19 07:51:26] [INFO ] Deduced a trap composed of 12 places in 1146 ms of which 2 ms to minimize.
[2023-03-19 07:51:26] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 2 ms to minimize.
[2023-03-19 07:51:27] [INFO ] Deduced a trap composed of 21 places in 426 ms of which 1 ms to minimize.
[2023-03-19 07:51:28] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 2 ms to minimize.
[2023-03-19 07:51:28] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 1 ms to minimize.
[2023-03-19 07:51:29] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2023-03-19 07:51:29] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-19 07:51:30] [INFO ] Deduced a trap composed of 6 places in 561 ms of which 1 ms to minimize.
[2023-03-19 07:51:30] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 1 ms to minimize.
[2023-03-19 07:51:31] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 1 ms to minimize.
[2023-03-19 07:51:31] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 0 ms to minimize.
[2023-03-19 07:51:32] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2023-03-19 07:51:32] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 0 ms to minimize.
[2023-03-19 07:51:32] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 12751 ms
[2023-03-19 07:51:33] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
[2023-03-19 07:51:33] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 1 ms to minimize.
[2023-03-19 07:51:34] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-19 07:51:34] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 0 ms to minimize.
[2023-03-19 07:51:35] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 0 ms to minimize.
[2023-03-19 07:51:35] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-19 07:51:36] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 1 ms to minimize.
[2023-03-19 07:51:36] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2023-03-19 07:51:37] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 1 ms to minimize.
[2023-03-19 07:51:37] [INFO ] Deduced a trap composed of 20 places in 307 ms of which 1 ms to minimize.
[2023-03-19 07:51:37] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2023-03-19 07:51:39] [INFO ] Deduced a trap composed of 11 places in 994 ms of which 3 ms to minimize.
[2023-03-19 07:51:39] [INFO ] Deduced a trap composed of 31 places in 244 ms of which 0 ms to minimize.
[2023-03-19 07:51:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6797 ms
[2023-03-19 07:51:40] [INFO ] Deduced a trap composed of 9 places in 613 ms of which 0 ms to minimize.
[2023-03-19 07:51:41] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 1 ms to minimize.
[2023-03-19 07:51:41] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 1 ms to minimize.
[2023-03-19 07:51:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1821 ms
[2023-03-19 07:51:42] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-19 07:51:42] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 0 ms to minimize.
[2023-03-19 07:51:43] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 1 ms to minimize.
[2023-03-19 07:51:43] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2023-03-19 07:51:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1709 ms
[2023-03-19 07:51:43] [INFO ] After 37099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 626 ms.
[2023-03-19 07:51:44] [INFO ] After 39409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
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 07:51:44] [INFO ] Flatten gal took : 291 ms
[2023-03-19 07:51:44] [INFO ] Applying decomposition
[2023-03-19 07:51:45] [INFO ] Flatten gal took : 223 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/graph12366116462182585967.txt' '-o' '/tmp/graph12366116462182585967.bin' '-w' '/tmp/graph12366116462182585967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12366116462182585967.bin' '-l' '-1' '-v' '-w' '/tmp/graph12366116462182585967.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:51:45] [INFO ] Decomposing Gal with order
[2023-03-19 07:51:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:51:47] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 07:51:48] [INFO ] Flatten gal took : 438 ms
[2023-03-19 07:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 34 ms.
[2023-03-19 07:51:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8337872701918455225.gal : 70 ms
[2023-03-19 07:51:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11443583208962336868.prop : 0 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/ReachabilityCardinality8337872701918455225.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11443583208962336868.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/ReachabilityCardinality11443583208962336868.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :1 after 2007
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :2007 after 1.64907e+08
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.64907e+08 after 7.1768e+93
SDD proceeding with computation,9 properties remain. new max is 2097152
SDD size :5.25371e+275 after 5.25371e+275
Reachability property ShieldPPPs-PT-100B-ReachabilityCardinality-09 is true.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPs-PT-100B-ReachabilityCardinality-08 does not hold.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPs-PT-100B-ReachabilityCardinality-05 is true.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldPPPs-PT-100B-ReachabilityCardinality-04 does not hold.
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.27089e+280 after 6.09093e+366
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :6.09093e+366 after 6.09093e+366
SDD proceeding with computation,9 properties remain. new max is 4194304
SDD size :5.25371e+275 after 5.25371e+275
ITS-tools command line returned an error code 137
[2023-03-19 08:08:45] [INFO ] Flatten gal took : 1537 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17074840900496608926
[2023-03-19 08:08:45] [INFO ] Too many transitions (2649) to apply POR reductions. Disabling POR matrices.
[2023-03-19 08:08:46] [INFO ] Applying decomposition
[2023-03-19 08:08:46] [INFO ] Built C files in 993ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17074840900496608926
Running compilation step : cd /tmp/ltsmin17074840900496608926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' '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'
[2023-03-19 08:08:47] [INFO ] Flatten gal took : 1096 ms
Compilation finished in 7446 ms.
Running link step : cd /tmp/ltsmin17074840900496608926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin17074840900496608926;'/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' 'ShieldPPPsPT100BReachabilityCardinality10==true'
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/graph12441056072516846147.txt' '-o' '/tmp/graph12441056072516846147.bin' '-w' '/tmp/graph12441056072516846147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12441056072516846147.bin' '-l' '-1' '-v' '-w' '/tmp/graph12441056072516846147.weights' '-q' '0' '-e' '0.001'
[2023-03-19 08:08:55] [INFO ] Decomposing Gal with order
[2023-03-19 08:08:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:08:57] [INFO ] Removed a total of 1339 redundant transitions.
[2023-03-19 08:08:57] [INFO ] Flatten gal took : 624 ms
[2023-03-19 08:08:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2306 labels/synchronizations in 589 ms.
[2023-03-19 08:08:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14656784909800315742.gal : 84 ms
[2023-03-19 08:08:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10020013106773568907.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/ReachabilityCardinality14656784909800315742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10020013106773568907.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 ...309
Loading property file /tmp/ReachabilityCardinality10020013106773568907.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 2
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 39
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39 after 50
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 08:35:39] [INFO ] Applying decomposition
[2023-03-19 08:35:40] [INFO ] Flatten gal took : 369 ms
[2023-03-19 08:35:40] [INFO ] Decomposing Gal with order
[2023-03-19 08:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 08:35:43] [INFO ] Removed a total of 2250 redundant transitions.
[2023-03-19 08:35:43] [INFO ] Flatten gal took : 645 ms
[2023-03-19 08:35:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3281 labels/synchronizations in 1240 ms.
[2023-03-19 08:35:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7461524553973632265.gal : 172 ms
[2023-03-19 08:35:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14421042880105274409.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7461524553973632265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14421042880105274409.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/ReachabilityCardinality14421042880105274409.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1.56836e+09 after 1.81742e+126
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5152900 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16065844 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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713700526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;