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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 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:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 503K 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 ShieldIIPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679175486634

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=ShieldIIPs-PT-030B
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-18 21:38:09] [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-18 21:38:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:38:09] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-18 21:38:09] [INFO ] Transformed 1803 places.
[2023-03-18 21:38:09] [INFO ] Transformed 1773 transitions.
[2023-03-18 21:38:09] [INFO ] Found NUPN structural information;
[2023-03-18 21:38:09] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 21:38:10] [INFO ] Flatten gal took : 222 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-18 21:38:10] [INFO ] Flatten gal took : 109 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) 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 6) seen :0
[2023-03-18 21:38:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15343820637813977179.gal : 46 ms
[2023-03-18 21:38:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8614049576157038108.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/ReachabilityCardinality15343820637813977179.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8614049576157038108.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1773 rows 1803 cols
[2023-03-18 21:38:10] [INFO ] Computed 271 place invariants in 18 ms
Loading property file /tmp/ReachabilityCardinality8614049576157038108.prop.
[2023-03-18 21:38:11] [INFO ] [Real]Absence check using 271 positive place invariants in 87 ms returned sat
[2023-03-18 21:38:11] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:38:11] [INFO ] [Nat]Absence check using 271 positive place invariants in 74 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 ShieldIIPs-PT-030B-ReachabilityFireability-15 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 46
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :46 after 384
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :384 after 496
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :496 after 18173
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :18173 after 1.45699e+08
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1.45699e+08 after 5.81902e+13
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :5.81902e+13 after 1.21008e+30
Invariant property ShieldIIPs-PT-030B-ReachabilityFireability-05 does not hold.
Reachability property ShieldIIPs-PT-030B-ReachabilityFireability-03 is true.
Reachability property ShieldIIPs-PT-030B-ReachabilityFireability-00 is true.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :1.21008e+30 after 1.97531e+60
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :1.97531e+60 after 6.86889e+82
[2023-03-18 21:38:16] [INFO ] After 4286ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:38:16] [INFO ] Deduced a trap composed of 28 places in 515 ms of which 14 ms to minimize.
[2023-03-18 21:38:17] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 1 ms to minimize.
[2023-03-18 21:38:17] [INFO ] Deduced a trap composed of 23 places in 407 ms of which 17 ms to minimize.
[2023-03-18 21:38:18] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 3 ms to minimize.
[2023-03-18 21:38:18] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:38:19] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 1 ms to minimize.
[2023-03-18 21:38:19] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 1 ms to minimize.
[2023-03-18 21:38:20] [INFO ] Deduced a trap composed of 25 places in 519 ms of which 1 ms to minimize.
[2023-03-18 21:38:20] [INFO ] Deduced a trap composed of 24 places in 392 ms of which 1 ms to minimize.
[2023-03-18 21:38:21] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 2 ms to minimize.
[2023-03-18 21:38:21] [INFO ] Deduced a trap composed of 28 places in 490 ms of which 3 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 52 places in 494 ms of which 1 ms to minimize.
[2023-03-18 21:38:22] [INFO ] Deduced a trap composed of 42 places in 417 ms of which 1 ms to minimize.
[2023-03-18 21:38:23] [INFO ] Deduced a trap composed of 20 places in 635 ms of which 3 ms to minimize.
[2023-03-18 21:38:23] [INFO ] Deduced a trap composed of 19 places in 414 ms of which 1 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 26 places in 635 ms of which 1 ms to minimize.
[2023-03-18 21:38:25] [INFO ] Deduced a trap composed of 22 places in 451 ms of which 1 ms to minimize.
[2023-03-18 21:38:26] [INFO ] Deduced a trap composed of 23 places in 472 ms of which 3 ms to minimize.
[2023-03-18 21:38:27] [INFO ] Deduced a trap composed of 19 places in 632 ms of which 4 ms to minimize.
[2023-03-18 21:38:27] [INFO ] Deduced a trap composed of 25 places in 572 ms of which 1 ms to minimize.
[2023-03-18 21:38:28] [INFO ] Deduced a trap composed of 15 places in 567 ms of which 1 ms to minimize.
[2023-03-18 21:38:29] [INFO ] Deduced a trap composed of 24 places in 594 ms of which 12 ms to minimize.
[2023-03-18 21:38:30] [INFO ] Deduced a trap composed of 12 places in 970 ms of which 2 ms to minimize.
[2023-03-18 21:38:30] [INFO ] Deduced a trap composed of 16 places in 553 ms of which 4 ms to minimize.
[2023-03-18 21:38:32] [INFO ] Deduced a trap composed of 21 places in 1362 ms of which 32 ms to minimize.
[2023-03-18 21:38:32] [INFO ] Deduced a trap composed of 19 places in 595 ms of which 4 ms to minimize.
[2023-03-18 21:38:34] [INFO ] Deduced a trap composed of 41 places in 1607 ms of which 3 ms to minimize.
[2023-03-18 21:38:36] [INFO ] Deduced a trap composed of 20 places in 1469 ms of which 1 ms to minimize.
[2023-03-18 21:38:37] [INFO ] Deduced a trap composed of 43 places in 1525 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-18 21:38:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:38:37] [INFO ] After 26477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 380 ms.
Support contains 111 out of 1803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 1803 transition count 1645
Reduce places removed 128 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 264 place count 1675 transition count 1637
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 1667 transition count 1637
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 146 Pre rules applied. Total rules applied 272 place count 1667 transition count 1491
Deduced a syphon composed of 146 places in 11 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 292 rules applied. Total rules applied 564 place count 1521 transition count 1491
Discarding 187 places :
Symmetric choice reduction at 3 with 187 rule applications. Total rules 751 place count 1334 transition count 1304
Iterating global reduction 3 with 187 rules applied. Total rules applied 938 place count 1334 transition count 1304
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 938 place count 1334 transition count 1239
Deduced a syphon composed of 65 places in 6 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1068 place count 1269 transition count 1239
Performed 421 Post agglomeration using F-continuation condition.Transition count delta: 421
Deduced a syphon composed of 421 places in 4 ms
Reduce places removed 421 places and 0 transitions.
Iterating global reduction 3 with 842 rules applied. Total rules applied 1910 place count 848 transition count 818
Partial Free-agglomeration rule applied 188 times.
Drop transitions removed 188 transitions
Iterating global reduction 3 with 188 rules applied. Total rules applied 2098 place count 848 transition count 818
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2099 place count 847 transition count 817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2100 place count 846 transition count 817
Applied a total of 2100 rules in 619 ms. Remains 846 /1803 variables (removed 957) and now considering 817/1773 (removed 956) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 846/1803 places, 817/1773 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 817 rows 846 cols
[2023-03-18 21:38:39] [INFO ] Computed 270 place invariants in 14 ms
[2023-03-18 21:38:39] [INFO ] [Real]Absence check using 265 positive place invariants in 68 ms returned sat
[2023-03-18 21:38:39] [INFO ] [Real]Absence check using 265 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-18 21:38:39] [INFO ] After 272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 21:38:40] [INFO ] [Nat]Absence check using 265 positive place invariants in 400 ms returned sat
[2023-03-18 21:38:40] [INFO ] [Nat]Absence check using 265 positive and 5 generalized place invariants in 27 ms returned sat
[2023-03-18 21:38:42] [INFO ] After 2320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 21:38:43] [INFO ] Deduced a trap composed of 6 places in 385 ms of which 1 ms to minimize.
[2023-03-18 21:38:44] [INFO ] Deduced a trap composed of 7 places in 613 ms of which 1 ms to minimize.
[2023-03-18 21:38:44] [INFO ] Deduced a trap composed of 6 places in 550 ms of which 1 ms to minimize.
[2023-03-18 21:38:45] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-18 21:38:45] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 3 ms to minimize.
[2023-03-18 21:38:46] [INFO ] Deduced a trap composed of 10 places in 761 ms of which 1 ms to minimize.
[2023-03-18 21:38:46] [INFO ] Deduced a trap composed of 13 places in 577 ms of which 2 ms to minimize.
[2023-03-18 21:38:47] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 0 ms to minimize.
[2023-03-18 21:38:48] [INFO ] Deduced a trap composed of 5 places in 713 ms of which 1 ms to minimize.
[2023-03-18 21:38:48] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 0 ms to minimize.
[2023-03-18 21:38:48] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 2 ms to minimize.
[2023-03-18 21:38:49] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:38:49] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 14 ms to minimize.
[2023-03-18 21:38:49] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 2 ms to minimize.
[2023-03-18 21:38:49] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2023-03-18 21:38:50] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2023-03-18 21:38:50] [INFO ] Deduced a trap composed of 12 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:38:50] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 0 ms to minimize.
[2023-03-18 21:38:50] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7859 ms
[2023-03-18 21:38:51] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 2 ms to minimize.
[2023-03-18 21:38:51] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-18 21:38:51] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2023-03-18 21:38:52] [INFO ] Deduced a trap composed of 7 places in 441 ms of which 38 ms to minimize.
[2023-03-18 21:38:52] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 0 ms to minimize.
[2023-03-18 21:38:52] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-18 21:38:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2069 ms
[2023-03-18 21:38:53] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2023-03-18 21:38:54] [INFO ] Deduced a trap composed of 9 places in 770 ms of which 27 ms to minimize.
[2023-03-18 21:38:54] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 23 ms to minimize.
[2023-03-18 21:38:54] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-18 21:38:55] [INFO ] Deduced a trap composed of 12 places in 580 ms of which 1 ms to minimize.
[2023-03-18 21:38:55] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 0 ms to minimize.
[2023-03-18 21:38:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2540 ms
[2023-03-18 21:38:56] [INFO ] Deduced a trap composed of 7 places in 770 ms of which 5 ms to minimize.
[2023-03-18 21:38:56] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2023-03-18 21:38:57] [INFO ] Deduced a trap composed of 5 places in 425 ms of which 1 ms to minimize.
[2023-03-18 21:38:57] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 38 ms to minimize.
[2023-03-18 21:38:57] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 14 ms to minimize.
[2023-03-18 21:38:58] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2023-03-18 21:38:58] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 0 ms to minimize.
[2023-03-18 21:38:58] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-18 21:38:59] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 29 ms to minimize.
[2023-03-18 21:38:59] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 14 ms to minimize.
[2023-03-18 21:39:00] [INFO ] Deduced a trap composed of 18 places in 1152 ms of which 0 ms to minimize.
[2023-03-18 21:39:00] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-18 21:39:01] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:39:01] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-18 21:39:01] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 1 ms to minimize.
[2023-03-18 21:39:02] [INFO ] Deduced a trap composed of 10 places in 622 ms of which 2 ms to minimize.
[2023-03-18 21:39:02] [INFO ] Deduced a trap composed of 12 places in 472 ms of which 1 ms to minimize.
[2023-03-18 21:39:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7272 ms
[2023-03-18 21:39:03] [INFO ] Deduced a trap composed of 7 places in 474 ms of which 1 ms to minimize.
[2023-03-18 21:39:04] [INFO ] Deduced a trap composed of 6 places in 490 ms of which 1 ms to minimize.
[2023-03-18 21:39:04] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 1 ms to minimize.
[2023-03-18 21:39:04] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 0 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-18 21:39:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:39:04] [INFO ] After 25172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 147 ms.
Support contains 110 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 846 transition count 817
Applied a total of 1 rules in 76 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 846/846 places, 817/817 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 133209 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133209 steps, saw 69901 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 817 rows 846 cols
[2023-03-18 21:39:08] [INFO ] Computed 270 place invariants in 12 ms
[2023-03-18 21:39:08] [INFO ] [Real]Absence check using 267 positive place invariants in 151 ms returned sat
[2023-03-18 21:39:08] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 21:39:09] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 21:39:09] [INFO ] [Nat]Absence check using 267 positive place invariants in 76 ms returned sat
[2023-03-18 21:39:09] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 21:39:10] [INFO ] After 1179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 21:39:10] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-18 21:39:10] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-18 21:39:11] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-18 21:39:11] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 1 ms to minimize.
[2023-03-18 21:39:11] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-18 21:39:11] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-18 21:39:12] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-18 21:39:12] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2023-03-18 21:39:12] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 1 ms to minimize.
[2023-03-18 21:39:12] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 0 ms to minimize.
[2023-03-18 21:39:12] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2023-03-18 21:39:13] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-18 21:39:13] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-18 21:39:13] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-18 21:39:13] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2023-03-18 21:39:14] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 0 ms to minimize.
[2023-03-18 21:39:14] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-18 21:39:14] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-18 21:39:14] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-18 21:39:14] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 0 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 0 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-18 21:39:15] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5346 ms
[2023-03-18 21:39:16] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 1 ms to minimize.
[2023-03-18 21:39:16] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-18 21:39:16] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2023-03-18 21:39:16] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2023-03-18 21:39:17] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2023-03-18 21:39:17] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-18 21:39:17] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 1 ms to minimize.
[2023-03-18 21:39:17] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-18 21:39:18] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2023-03-18 21:39:18] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2313 ms
[2023-03-18 21:39:18] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2023-03-18 21:39:18] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2023-03-18 21:39:18] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2023-03-18 21:39:19] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 0 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-18 21:39:20] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2473 ms
[2023-03-18 21:39:21] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-18 21:39:21] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-18 21:39:21] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-18 21:39:21] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2023-03-18 21:39:22] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 0 ms to minimize.
[2023-03-18 21:39:22] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-18 21:39:22] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-18 21:39:22] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-18 21:39:22] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-18 21:39:22] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-18 21:39:23] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 2 ms to minimize.
[2023-03-18 21:39:23] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2023-03-18 21:39:23] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2023-03-18 21:39:23] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-18 21:39:23] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 0 ms to minimize.
[2023-03-18 21:39:24] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2023-03-18 21:39:24] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2023-03-18 21:39:24] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:39:24] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-18 21:39:24] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-18 21:39:25] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 0 ms to minimize.
[2023-03-18 21:39:25] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-18 21:39:25] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-18 21:39:25] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2023-03-18 21:39:25] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-18 21:39:26] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-18 21:39:26] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5170 ms
[2023-03-18 21:39:26] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2023-03-18 21:39:26] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-18 21:39:26] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-18 21:39:27] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-18 21:39:27] [INFO ] Deduced a trap composed of 8 places in 496 ms of which 0 ms to minimize.
[2023-03-18 21:39:27] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-18 21:39:28] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 0 ms to minimize.
[2023-03-18 21:39:28] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2023-03-18 21:39:28] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 0 ms to minimize.
[2023-03-18 21:39:28] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 0 ms to minimize.
[2023-03-18 21:39:29] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 0 ms to minimize.
[2023-03-18 21:39:29] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 1 ms to minimize.
[2023-03-18 21:39:29] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2023-03-18 21:39:29] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-18 21:39:30] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2023-03-18 21:39:30] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
[2023-03-18 21:39:30] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2023-03-18 21:39:30] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 0 ms to minimize.
[2023-03-18 21:39:30] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-18 21:39:30] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2023-03-18 21:39:31] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2023-03-18 21:39:31] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-18 21:39:31] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-18 21:39:31] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-18 21:39:31] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2023-03-18 21:39:31] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5732 ms
[2023-03-18 21:39:32] [INFO ] After 22726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 535 ms.
[2023-03-18 21:39:32] [INFO ] After 23561ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 124 ms.
Support contains 110 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 19 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 846/846 places, 817/817 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 44 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
[2023-03-18 21:39:32] [INFO ] Invariant cache hit.
[2023-03-18 21:39:33] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-18 21:39:33] [INFO ] Invariant cache hit.
[2023-03-18 21:39:34] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2023-03-18 21:39:34] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-18 21:39:34] [INFO ] Invariant cache hit.
[2023-03-18 21:39:34] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2068 ms. Remains : 846/846 places, 817/817 transitions.
Applied a total of 0 rules in 30 ms. Remains 846 /846 variables (removed 0) and now considering 817/817 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-18 21:39:34] [INFO ] Invariant cache hit.
[2023-03-18 21:39:35] [INFO ] [Real]Absence check using 267 positive place invariants in 33 ms returned sat
[2023-03-18 21:39:35] [INFO ] [Real]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 21:39:35] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 21:39:35] [INFO ] [Nat]Absence check using 267 positive place invariants in 38 ms returned sat
[2023-03-18 21:39:35] [INFO ] [Nat]Absence check using 267 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-18 21:39:35] [INFO ] After 692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-18 21:39:36] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-18 21:39:36] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 1 ms to minimize.
[2023-03-18 21:39:36] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-18 21:39:36] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-18 21:39:37] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 1 ms to minimize.
[2023-03-18 21:39:37] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2023-03-18 21:39:37] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2023-03-18 21:39:37] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 4 ms to minimize.
[2023-03-18 21:39:38] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 1 ms to minimize.
[2023-03-18 21:39:38] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 0 ms to minimize.
[2023-03-18 21:39:38] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-18 21:39:38] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-18 21:39:38] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-18 21:39:39] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-18 21:39:39] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-18 21:39:39] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 0 ms to minimize.
[2023-03-18 21:39:39] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-18 21:39:39] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-18 21:39:40] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 0 ms to minimize.
[2023-03-18 21:39:40] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-18 21:39:40] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-18 21:39:40] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-18 21:39:40] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-18 21:39:41] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2023-03-18 21:39:41] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 0 ms to minimize.
[2023-03-18 21:39:41] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 5291 ms
[2023-03-18 21:39:41] [INFO ] Deduced a trap composed of 14 places in 276 ms of which 1 ms to minimize.
[2023-03-18 21:39:41] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 0 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-18 21:39:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1251 ms
[2023-03-18 21:39:42] [INFO ] Deduced a trap composed of 20 places in 189 ms of which 1 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2023-03-18 21:39:43] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 1 ms to minimize.
[2023-03-18 21:39:44] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-18 21:39:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2023-03-18 21:39:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1587 ms
[2023-03-18 21:39:44] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-18 21:39:44] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-18 21:39:44] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-18 21:39:45] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-18 21:39:45] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-03-18 21:39:45] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-18 21:39:45] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-18 21:39:45] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-18 21:39:46] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 11 ms to minimize.
[2023-03-18 21:39:46] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2023-03-18 21:39:46] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2023-03-18 21:39:46] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 1 ms to minimize.
[2023-03-18 21:39:46] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2023-03-18 21:39:46] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2023-03-18 21:39:47] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-18 21:39:48] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3611 ms
[2023-03-18 21:39:48] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-18 21:39:48] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 0 ms to minimize.
[2023-03-18 21:39:48] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 0 ms to minimize.
[2023-03-18 21:39:48] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2023-03-18 21:39:48] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2023-03-18 21:39:49] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-18 21:39:49] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-18 21:39:49] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-18 21:39:49] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-18 21:39:49] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 3 ms to minimize.
[2023-03-18 21:39:49] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-18 21:39:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 15 ms to minimize.
[2023-03-18 21:39:50] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2023-03-18 21:39:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2145 ms
[2023-03-18 21:39:50] [INFO ] After 14959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 516 ms.
[2023-03-18 21:39:50] [INFO ] After 15723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-18 21:39:50] [INFO ] Flatten gal took : 54 ms
[2023-03-18 21:39:50] [INFO ] Flatten gal took : 47 ms
[2023-03-18 21:39:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality322762463970124401.gal : 9 ms
[2023-03-18 21:39:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5695217150588649666.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/ReachabilityCardinality322762463970124401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5695217150588649666.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 ...327
Loading property file /tmp/ReachabilityCardinality5695217150588649666.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 30
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :30 after 90
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :90 after 794
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :794 after 126722
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :126722 after 5.06882e+07
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :5.06882e+07 after 9.45963e+14
Detected timeout of ITS tools.
[2023-03-18 21:40:06] [INFO ] Flatten gal took : 44 ms
[2023-03-18 21:40:06] [INFO ] Applying decomposition
[2023-03-18 21:40:06] [INFO ] Flatten gal took : 36 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/graph6936130521321461880.txt' '-o' '/tmp/graph6936130521321461880.bin' '-w' '/tmp/graph6936130521321461880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6936130521321461880.bin' '-l' '-1' '-v' '-w' '/tmp/graph6936130521321461880.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:40:06] [INFO ] Decomposing Gal with order
[2023-03-18 21:40:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:40:06] [INFO ] Removed a total of 635 redundant transitions.
[2023-03-18 21:40:06] [INFO ] Flatten gal took : 165 ms
[2023-03-18 21:40:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 560 labels/synchronizations in 81 ms.
[2023-03-18 21:40:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4984504111479865812.gal : 28 ms
[2023-03-18 21:40:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality657117323026947804.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/ReachabilityCardinality4984504111479865812.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality657117323026947804.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/ReachabilityCardinality657117323026947804.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 33
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :33 after 16913
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :16913 after 90129
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :90129 after 4.05506e+06
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :4.05506e+06 after 6.08258e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8549267807829395091
[2023-03-18 21:40:21] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8549267807829395091
Running compilation step : cd /tmp/ltsmin8549267807829395091;'/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 1753 ms.
Running link step : cd /tmp/ltsmin8549267807829395091;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin8549267807829395091;'/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' 'ShieldIIPsPT030BReachabilityFireability04==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-18 21:40:37] [INFO ] Flatten gal took : 54 ms
[2023-03-18 21:40:37] [INFO ] Applying decomposition
[2023-03-18 21:40:37] [INFO ] Flatten gal took : 56 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/graph18352329399378214550.txt' '-o' '/tmp/graph18352329399378214550.bin' '-w' '/tmp/graph18352329399378214550.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18352329399378214550.bin' '-l' '-1' '-v' '-w' '/tmp/graph18352329399378214550.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:40:37] [INFO ] Decomposing Gal with order
[2023-03-18 21:40:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:40:37] [INFO ] Removed a total of 690 redundant transitions.
[2023-03-18 21:40:37] [INFO ] Flatten gal took : 103 ms
[2023-03-18 21:40:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-18 21:40:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12872314479295373986.gal : 20 ms
[2023-03-18 21:40:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2610610488116181401.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/ReachabilityCardinality12872314479295373986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2610610488116181401.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/ReachabilityCardinality2610610488116181401.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 1031
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :1031 after 1.74997e+06
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :1.74997e+06 after 3.39937e+83
Reachability property ShieldIIPs-PT-030B-ReachabilityFireability-07 is true.
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3.39937e+83 after 8.55476e+84
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8.55476e+84 after 8.55476e+84
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 22:10:41] [INFO ] Flatten gal took : 605 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11239043353572846600
[2023-03-18 22:10:42] [INFO ] Computing symmetric may disable matrix : 817 transitions.
[2023-03-18 22:10:42] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:10:42] [INFO ] Computing symmetric may enable matrix : 817 transitions.
[2023-03-18 22:10:42] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:10:42] [INFO ] Applying decomposition
[2023-03-18 22:10:44] [INFO ] Flatten gal took : 1684 ms
[2023-03-18 22:10:44] [INFO ] Computing Do-Not-Accords matrix : 817 transitions.
[2023-03-18 22:10:44] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 22:10:44] [INFO ] Built C files in 2733ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11239043353572846600
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/graph3528819430377980003.txt' '-o' '/tmp/graph3528819430377980003.bin' '-w' '/tmp/graph3528819430377980003.weights'
Running compilation step : cd /tmp/ltsmin11239043353572846600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3528819430377980003.bin' '-l' '-1' '-v' '-w' '/tmp/graph3528819430377980003.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:10:46] [INFO ] Decomposing Gal with order
[2023-03-18 22:10:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:10:47] [INFO ] Removed a total of 628 redundant transitions.
[2023-03-18 22:10:47] [INFO ] Flatten gal took : 74 ms
[2023-03-18 22:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 573 labels/synchronizations in 39 ms.
[2023-03-18 22:10:47] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8593166607720556774.gal : 15 ms
[2023-03-18 22:10:47] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17655868328975800103.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/ReachabilityFireability8593166607720556774.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17655868328975800103.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/ReachabilityFireability17655868328975800103.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :3 after 33
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :33 after 4241
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :4241 after 45073
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :45073 after 4.05506e+06
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :4.05506e+06 after 7.60323e+08
Compilation finished in 5603 ms.
Running link step : cd /tmp/ltsmin11239043353572846600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin11239043353572846600;'/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' 'ShieldIIPsPT030BReachabilityFireability04==true'
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.84682e+20 after 9.81211e+40
Invariant property ShieldIIPs-PT-030B-ReachabilityFireability-14 does not hold.
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPs-PT-030B-ReachabilityFireability-10 is true.
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPs-PT-030B-ReachabilityFireability-04 is true.
FORMULA ShieldIIPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.81211e+40 after 3.61141e+66
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.066: Initializing POR dependencies: labels 822, guards 817
pins2lts-mc-linux64( 3/ 8), 0.123: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.165: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 14.812: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 15.199: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 15.199: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.201: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.201: There are 822 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 15.201: State length is 846, there are 817 groups
pins2lts-mc-linux64( 0/ 8), 15.201: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 15.201: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 15.201: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 15.201: Visible groups: 0 / 817, labels: 1 / 822
pins2lts-mc-linux64( 0/ 8), 15.201: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 15.201: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 15.200: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 15.200: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 15.200: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 15.201: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 15.201: "ShieldIIPsPT030BReachabilityFireability04==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 15.229: ~76 levels ~960 states ~1384 transitions
pins2lts-mc-linux64( 0/ 8), 15.272: ~79 levels ~1920 states ~4216 transitions
pins2lts-mc-linux64( 0/ 8), 15.416: ~81 levels ~3840 states ~11944 transitions
pins2lts-mc-linux64( 0/ 8), 15.769: ~83 levels ~7680 states ~28704 transitions
pins2lts-mc-linux64( 0/ 8), 16.389: ~85 levels ~15360 states ~68912 transitions
pins2lts-mc-linux64( 7/ 8), 17.391: ~9 levels ~30720 states ~112656 transitions
pins2lts-mc-linux64( 3/ 8), 19.498: ~10 levels ~61440 states ~255544 transitions
pins2lts-mc-linux64( 7/ 8), 23.584: ~11 levels ~122880 states ~548136 transitions
pins2lts-mc-linux64( 1/ 8), 31.296: ~12 levels ~245760 states ~1165488 transitions
pins2lts-mc-linux64( 1/ 8), 47.245: ~14 levels ~491520 states ~2466184 transitions
pins2lts-mc-linux64( 1/ 8), 79.578: ~15 levels ~983040 states ~5192024 transitions
pins2lts-mc-linux64( 1/ 8), 150.041: ~16 levels ~1966080 states ~11453560 transitions
pins2lts-mc-linux64( 1/ 8), 291.401: ~17 levels ~3932160 states ~23818672 transitions
pins2lts-mc-linux64( 1/ 8), 600.532: ~18 levels ~7864320 states ~51807176 transitions
pins2lts-mc-linux64( 3/ 8), 847.832: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 847.949:
pins2lts-mc-linux64( 0/ 8), 847.949: mean standard work distribution: 8.1% (states) 3.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 847.949:
pins2lts-mc-linux64( 0/ 8), 847.949: Explored 9785826 states 75063403 transitions, fanout: 7.671
pins2lts-mc-linux64( 0/ 8), 847.949: Total exploration time 832.740 sec (832.630 sec minimum, 832.694 sec on average)
pins2lts-mc-linux64( 0/ 8), 847.949: States per second: 11751, Transitions per second: 90140
pins2lts-mc-linux64( 0/ 8), 847.949: Ignoring proviso: 6635199
pins2lts-mc-linux64( 0/ 8), 847.949:
pins2lts-mc-linux64( 0/ 8), 847.949: Queue width: 8B, total height: 8592750, memory: 65.56MB
pins2lts-mc-linux64( 0/ 8), 847.949: Tree memory: 396.2MB, 22.6 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 847.949: Tree fill ratio (roots/leafs): 13.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 847.949: Stored 824 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 847.950: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 847.950: Est. total memory use: 461.8MB (~1089.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11239043353572846600;'/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' 'ShieldIIPsPT030BReachabilityFireability04==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11239043353572846600;'/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' 'ShieldIIPsPT030BReachabilityFireability04==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.61141e+66 after 9.03331e+66
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 4816152 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16161040 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldIIPs-PT-030B"
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 ShieldIIPs-PT-030B, 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-167903713200127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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