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-167903713600495.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600495
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 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.5K 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 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 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 708K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679207503506

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=ShieldPPPs-PT-040B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-19 06:31:46] [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 06:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 06:31:46] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-19 06:31:46] [INFO ] Transformed 2723 places.
[2023-03-19 06:31:46] [INFO ] Transformed 2523 transitions.
[2023-03-19 06:31:46] [INFO ] Found NUPN structural information;
[2023-03-19 06:31:46] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 06:31:47] [INFO ] Flatten gal took : 275 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 802 ms. (steps per millisecond=12 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
[2023-03-19 06:31:47] [INFO ] Flatten gal took : 110 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
[2023-03-19 06:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5864715373088804232.gal : 78 ms
[2023-03-19 06:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11221181228064337297.prop : 1 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
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/ReachabilityCardinality5864715373088804232.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11221181228064337297.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 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Loading property file /tmp/ReachabilityCardinality11221181228064337297.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-19 06:31:47] [INFO ] Computed 441 place invariants in 67 ms
[2023-03-19 06:31:48] [INFO ] After 958ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 06:31:49] [INFO ] [Nat]Absence check using 441 positive place invariants in 234 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
Reachability property ShieldPPPs-PT-040B-ReachabilityFireability-14 is true.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :10 after 19
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :19 after 28
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :28 after 45
Reachability property ShieldPPPs-PT-040B-ReachabilityFireability-12 is true.
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :45 after 144
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :144 after 398
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :398 after 542
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :542 after 50502
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :50502 after 1.81642e+08
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :1.81642e+08 after 3.29357e+17
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :3.29357e+17 after 3.87657e+35
[2023-03-19 06:31:59] [INFO ] After 8674ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-19 06:32:00] [INFO ] Deduced a trap composed of 26 places in 1072 ms of which 11 ms to minimize.
[2023-03-19 06:32:01] [INFO ] Deduced a trap composed of 24 places in 687 ms of which 2 ms to minimize.
[2023-03-19 06:32:02] [INFO ] Deduced a trap composed of 15 places in 631 ms of which 5 ms to minimize.
[2023-03-19 06:32:03] [INFO ] Deduced a trap composed of 30 places in 674 ms of which 1 ms to minimize.
[2023-03-19 06:32:03] [INFO ] Deduced a trap composed of 21 places in 692 ms of which 2 ms to minimize.
[2023-03-19 06:32:04] [INFO ] Deduced a trap composed of 34 places in 702 ms of which 2 ms to minimize.
[2023-03-19 06:32:05] [INFO ] Deduced a trap composed of 18 places in 782 ms of which 5 ms to minimize.
[2023-03-19 06:32:06] [INFO ] Deduced a trap composed of 28 places in 875 ms of which 1 ms to minimize.
[2023-03-19 06:32:07] [INFO ] Deduced a trap composed of 32 places in 816 ms of which 1 ms to minimize.
[2023-03-19 06:32:08] [INFO ] Deduced a trap composed of 28 places in 761 ms of which 1 ms to minimize.
[2023-03-19 06:32:09] [INFO ] Deduced a trap composed of 31 places in 793 ms of which 2 ms to minimize.
[2023-03-19 06:32:10] [INFO ] Deduced a trap composed of 40 places in 750 ms of which 2 ms to minimize.
[2023-03-19 06:32:11] [INFO ] Deduced a trap composed of 46 places in 647 ms of which 1 ms to minimize.
[2023-03-19 06:32:12] [INFO ] Deduced a trap composed of 27 places in 704 ms of which 1 ms to minimize.
[2023-03-19 06:32:12] [INFO ] Deduced a trap composed of 31 places in 711 ms of which 1 ms to minimize.
[2023-03-19 06:32:13] [INFO ] Deduced a trap composed of 34 places in 606 ms of which 1 ms to minimize.
[2023-03-19 06:32:14] [INFO ] Deduced a trap composed of 46 places in 550 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 06:32:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 06:32:14] [INFO ] After 25333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 1216 ms.
Support contains 180 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 2723 transition count 2287
Reduce places removed 236 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 250 rules applied. Total rules applied 486 place count 2487 transition count 2273
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 500 place count 2473 transition count 2273
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 193 Pre rules applied. Total rules applied 500 place count 2473 transition count 2080
Deduced a syphon composed of 193 places in 8 ms
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 3 with 386 rules applied. Total rules applied 886 place count 2280 transition count 2080
Discarding 247 places :
Symmetric choice reduction at 3 with 247 rule applications. Total rules 1133 place count 2033 transition count 1833
Iterating global reduction 3 with 247 rules applied. Total rules applied 1380 place count 2033 transition count 1833
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 1380 place count 2033 transition count 1748
Deduced a syphon composed of 85 places in 8 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 1550 place count 1948 transition count 1748
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 3 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 3 with 1066 rules applied. Total rules applied 2616 place count 1415 transition count 1215
Partial Free-agglomeration rule applied 307 times.
Drop transitions removed 307 transitions
Iterating global reduction 3 with 307 rules applied. Total rules applied 2923 place count 1415 transition count 1215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2924 place count 1414 transition count 1214
Applied a total of 2924 rules in 924 ms. Remains 1414 /2723 variables (removed 1309) and now considering 1214/2523 (removed 1309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 925 ms. Remains : 1414/2723 places, 1214/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 8) seen :4
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1214 rows 1414 cols
[2023-03-19 06:32:17] [INFO ] Computed 441 place invariants in 23 ms
[2023-03-19 06:32:17] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 06:32:17] [INFO ] [Nat]Absence check using 424 positive place invariants in 173 ms returned sat
[2023-03-19 06:32:17] [INFO ] [Nat]Absence check using 424 positive and 17 generalized place invariants in 22 ms returned sat
[2023-03-19 06:32:19] [INFO ] After 1575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 06:32:20] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2023-03-19 06:32:21] [INFO ] Deduced a trap composed of 8 places in 1120 ms of which 1 ms to minimize.
[2023-03-19 06:32:21] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-19 06:32:22] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2023-03-19 06:32:22] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 0 ms to minimize.
[2023-03-19 06:32:23] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2023-03-19 06:32:23] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 0 ms to minimize.
[2023-03-19 06:32:23] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 0 ms to minimize.
[2023-03-19 06:32:24] [INFO ] Deduced a trap composed of 5 places in 420 ms of which 1 ms to minimize.
[2023-03-19 06:32:24] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 1 ms to minimize.
[2023-03-19 06:32:24] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-19 06:32:25] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 0 ms to minimize.
[2023-03-19 06:32:25] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 0 ms to minimize.
[2023-03-19 06:32:26] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 0 ms to minimize.
[2023-03-19 06:32:26] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-19 06:32:26] [INFO ] Deduced a trap composed of 7 places in 494 ms of which 1 ms to minimize.
[2023-03-19 06:32:27] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 16 ms to minimize.
[2023-03-19 06:32:27] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-19 06:32:27] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2023-03-19 06:32:28] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 0 ms to minimize.
[2023-03-19 06:32:28] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-19 06:32:28] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2023-03-19 06:32:28] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 14 ms to minimize.
[2023-03-19 06:32:29] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2023-03-19 06:32:29] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-19 06:32:29] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2023-03-19 06:32:30] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2023-03-19 06:32:30] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2023-03-19 06:32:30] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2023-03-19 06:32:31] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 0 ms to minimize.
[2023-03-19 06:32:31] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 1 ms to minimize.
[2023-03-19 06:32:31] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 0 ms to minimize.
[2023-03-19 06:32:31] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 0 ms to minimize.
[2023-03-19 06:32:32] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 4 ms to minimize.
[2023-03-19 06:32:32] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-19 06:32:32] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-19 06:32:33] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 0 ms to minimize.
[2023-03-19 06:32:33] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-19 06:32:33] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2023-03-19 06:32:34] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 0 ms to minimize.
[2023-03-19 06:32:34] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2023-03-19 06:32:34] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 1 ms to minimize.
[2023-03-19 06:32:35] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 0 ms to minimize.
[2023-03-19 06:32:35] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2023-03-19 06:32:35] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 2 ms to minimize.
[2023-03-19 06:32:35] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2023-03-19 06:32:36] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 0 ms to minimize.
[2023-03-19 06:32:36] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 0 ms to minimize.
[2023-03-19 06:32:36] [INFO ] Deduced a trap composed of 16 places in 289 ms of which 1 ms to minimize.
[2023-03-19 06:32:37] [INFO ] Deduced a trap composed of 19 places in 217 ms of which 14 ms to minimize.
[2023-03-19 06:32:37] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 26 ms to minimize.
[2023-03-19 06:32:38] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 15 ms to minimize.
[2023-03-19 06:32:38] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 18044 ms
[2023-03-19 06:32:38] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2023-03-19 06:32:39] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 1 ms to minimize.
[2023-03-19 06:32:39] [INFO ] Deduced a trap composed of 16 places in 226 ms of which 1 ms to minimize.
[2023-03-19 06:32:39] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 0 ms to minimize.
[2023-03-19 06:32:39] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2023-03-19 06:32:40] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
[2023-03-19 06:32:40] [INFO ] Deduced a trap composed of 12 places in 326 ms of which 0 ms to minimize.
[2023-03-19 06:32:41] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 2 ms to minimize.
[2023-03-19 06:32:41] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 0 ms to minimize.
[2023-03-19 06:32:41] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-03-19 06:32:42] [INFO ] Deduced a trap composed of 10 places in 396 ms of which 1 ms to minimize.
[2023-03-19 06:32:42] [INFO ] Deduced a trap composed of 5 places in 328 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 06:32:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 06:32:42] [INFO ] After 25234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 126 ms.
Support contains 96 out of 1414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1414/1414 places, 1214/1214 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1414 transition count 1197
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 1397 transition count 1196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 1396 transition count 1196
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 36 place count 1396 transition count 1182
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 64 place count 1382 transition count 1182
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 67 place count 1379 transition count 1179
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 1379 transition count 1179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 1379 transition count 1178
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 1378 transition count 1178
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 168 place count 1330 transition count 1130
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 187 place count 1330 transition count 1130
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 192 place count 1325 transition count 1125
Applied a total of 192 rules in 522 ms. Remains 1325 /1414 variables (removed 89) and now considering 1125/1214 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 522 ms. Remains : 1325/1414 places, 1125/1214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1125 rows 1325 cols
[2023-03-19 06:32:43] [INFO ] Computed 441 place invariants in 19 ms
[2023-03-19 06:32:43] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:32:44] [INFO ] [Nat]Absence check using 418 positive place invariants in 84 ms returned sat
[2023-03-19 06:32:44] [INFO ] [Nat]Absence check using 418 positive and 23 generalized place invariants in 8 ms returned sat
[2023-03-19 06:32:45] [INFO ] After 1060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:32:45] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2023-03-19 06:32:46] [INFO ] Deduced a trap composed of 7 places in 309 ms of which 0 ms to minimize.
[2023-03-19 06:32:46] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2023-03-19 06:32:46] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2023-03-19 06:32:47] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-19 06:32:47] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 0 ms to minimize.
[2023-03-19 06:32:47] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-19 06:32:48] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2023-03-19 06:32:48] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-03-19 06:32:48] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-19 06:32:48] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-19 06:32:49] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2023-03-19 06:32:49] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-19 06:32:49] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2023-03-19 06:32:49] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2023-03-19 06:32:50] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-19 06:32:50] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-19 06:32:50] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-19 06:32:50] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2023-03-19 06:32:51] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-19 06:32:51] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 0 ms to minimize.
[2023-03-19 06:32:51] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 0 ms to minimize.
[2023-03-19 06:32:51] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 0 ms to minimize.
[2023-03-19 06:32:51] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2023-03-19 06:32:52] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2023-03-19 06:32:52] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 0 ms to minimize.
[2023-03-19 06:32:52] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2023-03-19 06:32:53] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 1 ms to minimize.
[2023-03-19 06:32:53] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-19 06:32:53] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2023-03-19 06:32:53] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 0 ms to minimize.
[2023-03-19 06:32:54] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 1 ms to minimize.
[2023-03-19 06:32:54] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2023-03-19 06:32:54] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 2 ms to minimize.
[2023-03-19 06:32:54] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2023-03-19 06:32:55] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-19 06:32:55] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2023-03-19 06:32:55] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-19 06:32:55] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-19 06:32:55] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2023-03-19 06:32:56] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 10470 ms
[2023-03-19 06:32:56] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2023-03-19 06:32:56] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 39 ms to minimize.
[2023-03-19 06:32:57] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-19 06:32:57] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2023-03-19 06:32:57] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-19 06:32:58] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 2 ms to minimize.
[2023-03-19 06:32:58] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 1 ms to minimize.
[2023-03-19 06:32:58] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2023-03-19 06:32:58] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 0 ms to minimize.
[2023-03-19 06:32:59] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2023-03-19 06:33:00] [INFO ] Deduced a trap composed of 6 places in 800 ms of which 4 ms to minimize.
[2023-03-19 06:33:00] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-19 06:33:00] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 0 ms to minimize.
[2023-03-19 06:33:01] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-19 06:33:01] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-19 06:33:01] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2023-03-19 06:33:01] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-19 06:33:02] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2023-03-19 06:33:02] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5899 ms
[2023-03-19 06:33:02] [INFO ] After 17924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 619 ms.
[2023-03-19 06:33:02] [INFO ] After 19054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 77 out of 1325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1325/1325 places, 1125/1125 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 0 with 1 rules applied. Total rules applied 1 place count 1325 transition count 1124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1324 transition count 1124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1324 transition count 1122
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1322 transition count 1122
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 1307 transition count 1107
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 1307 transition count 1107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1306 transition count 1106
Applied a total of 40 rules in 155 ms. Remains 1306 /1325 variables (removed 19) and now considering 1106/1125 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 1306/1325 places, 1106/1125 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 116879 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116879 steps, saw 111425 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1106 rows 1306 cols
[2023-03-19 06:33:06] [INFO ] Computed 441 place invariants in 17 ms
[2023-03-19 06:33:06] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:33:06] [INFO ] [Nat]Absence check using 418 positive place invariants in 77 ms returned sat
[2023-03-19 06:33:06] [INFO ] [Nat]Absence check using 418 positive and 23 generalized place invariants in 6 ms returned sat
[2023-03-19 06:33:08] [INFO ] After 1266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:33:09] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
[2023-03-19 06:33:09] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 2 ms to minimize.
[2023-03-19 06:33:09] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-19 06:33:10] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-03-19 06:33:10] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 1 ms to minimize.
[2023-03-19 06:33:10] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 0 ms to minimize.
[2023-03-19 06:33:11] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2023-03-19 06:33:11] [INFO ] Deduced a trap composed of 7 places in 206 ms of which 1 ms to minimize.
[2023-03-19 06:33:11] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 0 ms to minimize.
[2023-03-19 06:33:11] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2023-03-19 06:33:12] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 1 ms to minimize.
[2023-03-19 06:33:12] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 1 ms to minimize.
[2023-03-19 06:33:13] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-19 06:33:13] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2023-03-19 06:33:13] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-19 06:33:14] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-19 06:33:14] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 0 ms to minimize.
[2023-03-19 06:33:14] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2023-03-19 06:33:14] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-19 06:33:15] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-19 06:33:15] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-19 06:33:15] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-19 06:33:15] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-19 06:33:16] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2023-03-19 06:33:16] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-19 06:33:16] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 0 ms to minimize.
[2023-03-19 06:33:17] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-19 06:33:17] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-19 06:33:17] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-19 06:33:17] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2023-03-19 06:33:18] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-19 06:33:18] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 9255 ms
[2023-03-19 06:33:18] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 1 ms to minimize.
[2023-03-19 06:33:18] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-19 06:33:19] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-19 06:33:19] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-19 06:33:19] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
[2023-03-19 06:33:20] [INFO ] Deduced a trap composed of 9 places in 481 ms of which 1 ms to minimize.
[2023-03-19 06:33:20] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2023-03-19 06:33:20] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2023-03-19 06:33:21] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 0 ms to minimize.
[2023-03-19 06:33:21] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-19 06:33:22] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 0 ms to minimize.
[2023-03-19 06:33:22] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-19 06:33:22] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 0 ms to minimize.
[2023-03-19 06:33:23] [INFO ] Deduced a trap composed of 10 places in 536 ms of which 1 ms to minimize.
[2023-03-19 06:33:23] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-19 06:33:23] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 0 ms to minimize.
[2023-03-19 06:33:24] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 1 ms to minimize.
[2023-03-19 06:33:24] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2023-03-19 06:33:24] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-19 06:33:24] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 0 ms to minimize.
[2023-03-19 06:33:25] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-19 06:33:25] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 1 ms to minimize.
[2023-03-19 06:33:25] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 ms to minimize.
[2023-03-19 06:33:26] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-19 06:33:26] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-19 06:33:26] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 1 ms to minimize.
[2023-03-19 06:33:26] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2023-03-19 06:33:27] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-19 06:33:27] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 0 ms to minimize.
[2023-03-19 06:33:27] [INFO ] Deduced a trap composed of 7 places in 388 ms of which 0 ms to minimize.
[2023-03-19 06:33:27] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-19 06:33:28] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-19 06:33:28] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 0 ms to minimize.
[2023-03-19 06:33:28] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-19 06:33:29] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 0 ms to minimize.
[2023-03-19 06:33:29] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 0 ms to minimize.
[2023-03-19 06:33:29] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 0 ms to minimize.
[2023-03-19 06:33:29] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2023-03-19 06:33:29] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-19 06:33:30] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-19 06:33:30] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11922 ms
[2023-03-19 06:33:30] [INFO ] After 23211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 847 ms.
[2023-03-19 06:33:31] [INFO ] After 24406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 70 ms.
Support contains 77 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 36 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 38 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
[2023-03-19 06:33:31] [INFO ] Invariant cache hit.
[2023-03-19 06:33:32] [INFO ] Implicit Places using invariants in 852 ms returned []
[2023-03-19 06:33:32] [INFO ] Invariant cache hit.
[2023-03-19 06:33:34] [INFO ] Implicit Places using invariants and state equation in 2161 ms returned []
Implicit Place search using SMT with State Equation took 3029 ms to find 0 implicit places.
[2023-03-19 06:33:34] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-19 06:33:34] [INFO ] Invariant cache hit.
[2023-03-19 06:33:35] [INFO ] Dead Transitions using invariants and state equation in 735 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3881 ms. Remains : 1306/1306 places, 1106/1106 transitions.
Applied a total of 0 rules in 36 ms. Remains 1306 /1306 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 06:33:35] [INFO ] Invariant cache hit.
[2023-03-19 06:33:35] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 06:33:35] [INFO ] [Nat]Absence check using 418 positive place invariants in 132 ms returned sat
[2023-03-19 06:33:35] [INFO ] [Nat]Absence check using 418 positive and 23 generalized place invariants in 4 ms returned sat
[2023-03-19 06:33:37] [INFO ] After 1410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 06:33:38] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2023-03-19 06:33:38] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2023-03-19 06:33:38] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2023-03-19 06:33:39] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-19 06:33:39] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-19 06:33:39] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-19 06:33:39] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-19 06:33:40] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 1 ms to minimize.
[2023-03-19 06:33:40] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2023-03-19 06:33:40] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-19 06:33:41] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2023-03-19 06:33:41] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-19 06:33:42] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 1 ms to minimize.
[2023-03-19 06:33:42] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-19 06:33:42] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-19 06:33:43] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-19 06:33:43] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-19 06:33:43] [INFO ] Deduced a trap composed of 8 places in 258 ms of which 0 ms to minimize.
[2023-03-19 06:33:43] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 0 ms to minimize.
[2023-03-19 06:33:44] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 2 ms to minimize.
[2023-03-19 06:33:44] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-19 06:33:44] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-19 06:33:44] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2023-03-19 06:33:44] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 0 ms to minimize.
[2023-03-19 06:33:45] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 7201 ms
[2023-03-19 06:33:45] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 0 ms to minimize.
[2023-03-19 06:33:45] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 1 ms to minimize.
[2023-03-19 06:33:46] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 1 ms to minimize.
[2023-03-19 06:33:46] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 0 ms to minimize.
[2023-03-19 06:33:46] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 0 ms to minimize.
[2023-03-19 06:33:47] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2023-03-19 06:33:47] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2023-03-19 06:33:47] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-19 06:33:47] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-19 06:33:48] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-19 06:33:48] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-19 06:33:48] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-19 06:33:48] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
[2023-03-19 06:33:49] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-19 06:33:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3933 ms
[2023-03-19 06:33:49] [INFO ] After 13565ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1866 ms.
[2023-03-19 06:33:51] [INFO ] After 15786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 06:33:51] [INFO ] Flatten gal took : 81 ms
[2023-03-19 06:33:51] [INFO ] Flatten gal took : 57 ms
[2023-03-19 06:33:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10776435121882137457.gal : 10 ms
[2023-03-19 06:33:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5959238744313725291.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/ReachabilityCardinality10776435121882137457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5959238744313725291.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
Loading property file /tmp/ReachabilityCardinality5959238744313725291.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 56
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :56 after 3901
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3901 after 140436
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :140436 after 6.06684e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.06684e+07 after 1.06576e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.06576e+09 after 1.06613e+09
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.06613e+09 after 1.06643e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.06643e+09 after 2.40866e+09
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.40866e+09 after 2.53715e+16
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.53715e+16 after 1.48025e+17
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.48025e+17 after 1.95622e+17
Detected timeout of ITS tools.
[2023-03-19 06:34:06] [INFO ] Flatten gal took : 61 ms
[2023-03-19 06:34:06] [INFO ] Applying decomposition
[2023-03-19 06:34:06] [INFO ] Flatten gal took : 62 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/graph12198152080273911296.txt' '-o' '/tmp/graph12198152080273911296.bin' '-w' '/tmp/graph12198152080273911296.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12198152080273911296.bin' '-l' '-1' '-v' '-w' '/tmp/graph12198152080273911296.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:34:06] [INFO ] Decomposing Gal with order
[2023-03-19 06:34:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:34:06] [INFO ] Removed a total of 525 redundant transitions.
[2023-03-19 06:34:07] [INFO ] Flatten gal took : 148 ms
[2023-03-19 06:34:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 948 labels/synchronizations in 145 ms.
[2023-03-19 06:34:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality457144797638400039.gal : 22 ms
[2023-03-19 06:34:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13701677376418400313.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/ReachabilityCardinality457144797638400039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13701677376418400313.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/ReachabilityCardinality13701677376418400313.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 84
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :84 after 84
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :84 after 444
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :444 after 444
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :444 after 444
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :444 after 140436
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13613185648697060476
[2023-03-19 06:34:22] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13613185648697060476
Running compilation step : cd /tmp/ltsmin13613185648697060476;'/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 2359 ms.
Running link step : cd /tmp/ltsmin13613185648697060476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 100 ms.
Running LTSmin : cd /tmp/ltsmin13613185648697060476;'/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' 'ShieldPPPsPT040BReachabilityFireability00==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 06:34:37] [INFO ] Flatten gal took : 93 ms
[2023-03-19 06:34:37] [INFO ] Applying decomposition
[2023-03-19 06:34:37] [INFO ] Flatten gal took : 75 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/graph1234005500486885073.txt' '-o' '/tmp/graph1234005500486885073.bin' '-w' '/tmp/graph1234005500486885073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1234005500486885073.bin' '-l' '-1' '-v' '-w' '/tmp/graph1234005500486885073.weights' '-q' '0' '-e' '0.001'
[2023-03-19 06:34:37] [INFO ] Decomposing Gal with order
[2023-03-19 06:34:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 06:34:38] [INFO ] Removed a total of 360 redundant transitions.
[2023-03-19 06:34:38] [INFO ] Flatten gal took : 140 ms
[2023-03-19 06:34:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-19 06:34:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1121178252688363403.gal : 28 ms
[2023-03-19 06:34:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality445325570364633300.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/ReachabilityCardinality1121178252688363403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality445325570364633300.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 ...306
Loading property file /tmp/ReachabilityCardinality445325570364633300.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 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1135
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1135 after 1.86044e+15
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.73409e+111 after 9.34478e+111
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :9.34478e+111 after 7.33646e+112
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 07:04:47] [INFO ] Flatten gal took : 3794 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10929865347432973106
[2023-03-19 07:04:47] [INFO ] Computing symmetric may disable matrix : 1106 transitions.
[2023-03-19 07:04:47] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:04:47] [INFO ] Computing symmetric may enable matrix : 1106 transitions.
[2023-03-19 07:04:47] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:04:48] [INFO ] Applying decomposition
[2023-03-19 07:04:48] [INFO ] Flatten gal took : 225 ms
[2023-03-19 07:04:49] [INFO ] Computing Do-Not-Accords matrix : 1106 transitions.
[2023-03-19 07:04:49] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:04:49] [INFO ] Built C files in 1386ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10929865347432973106
Running compilation step : cd /tmp/ltsmin10929865347432973106;'/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/graph15930866550027890932.txt' '-o' '/tmp/graph15930866550027890932.bin' '-w' '/tmp/graph15930866550027890932.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15930866550027890932.bin' '-l' '-1' '-v' '-w' '/tmp/graph15930866550027890932.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:04:49] [INFO ] Decomposing Gal with order
[2023-03-19 07:04:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:04:49] [INFO ] Removed a total of 545 redundant transitions.
[2023-03-19 07:04:50] [INFO ] Flatten gal took : 193 ms
[2023-03-19 07:04:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 915 labels/synchronizations in 127 ms.
[2023-03-19 07:04:50] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8595498111867893003.gal : 19 ms
[2023-03-19 07:04:50] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7942008206741094308.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/ReachabilityFireability8595498111867893003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7942008206741094308.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/ReachabilityFireability7942008206741094308.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 85
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :85 after 661
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :661 after 3901
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3901 after 140436
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8.93557e+13 after 2.45869e+16
Compilation finished in 6388 ms.
Running link step : cd /tmp/ltsmin10929865347432973106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin10929865347432973106;'/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' 'ShieldPPPsPT040BReachabilityFireability00==true'
Invariant property ShieldPPPs-PT-040B-ReachabilityFireability-00 does not hold.
FORMULA ShieldPPPs-PT-040B-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.45869e+16 after 4.04595e+57
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7742548 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16140964 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="ShieldPPPs-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 ShieldPPPs-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-167903713600495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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