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.r391-oct2-167903715400510.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 lolaxred
Input is ShieldPPPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K 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:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 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 888K 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-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679277245714

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:54:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 01:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:54:08] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2023-03-20 01:54:08] [INFO ] Transformed 3403 places.
[2023-03-20 01:54:08] [INFO ] Transformed 3153 transitions.
[2023-03-20 01:54:08] [INFO ] Found NUPN structural information;
[2023-03-20 01:54:08] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 14) seen :7
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-20 01:54:09] [INFO ] Computed 551 place invariants in 35 ms
[2023-03-20 01:54:10] [INFO ] After 1230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 01:54:11] [INFO ] [Nat]Absence check using 551 positive place invariants in 277 ms returned sat
[2023-03-20 01:54:16] [INFO ] After 3771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 01:54:18] [INFO ] Deduced a trap composed of 22 places in 2297 ms of which 15 ms to minimize.
[2023-03-20 01:54:20] [INFO ] Deduced a trap composed of 23 places in 1682 ms of which 28 ms to minimize.
[2023-03-20 01:54:22] [INFO ] Deduced a trap composed of 23 places in 1617 ms of which 20 ms to minimize.
[2023-03-20 01:54:24] [INFO ] Deduced a trap composed of 17 places in 1479 ms of which 18 ms to minimize.
[2023-03-20 01:54:25] [INFO ] Deduced a trap composed of 26 places in 1422 ms of which 16 ms to minimize.
[2023-03-20 01:54:28] [INFO ] Deduced a trap composed of 19 places in 1044 ms of which 2 ms to minimize.
[2023-03-20 01:54:29] [INFO ] Deduced a trap composed of 25 places in 1099 ms of which 3 ms to minimize.
[2023-03-20 01:54:30] [INFO ] Deduced a trap composed of 23 places in 1024 ms of which 2 ms to minimize.
[2023-03-20 01:54:32] [INFO ] Deduced a trap composed of 19 places in 1052 ms of which 2 ms to minimize.
[2023-03-20 01:54:33] [INFO ] Deduced a trap composed of 43 places in 964 ms of which 2 ms to minimize.
[2023-03-20 01:54:34] [INFO ] Deduced a trap composed of 29 places in 1204 ms of which 2 ms to minimize.
[2023-03-20 01:54:35] [INFO ] Deduced a trap composed of 57 places in 905 ms of which 2 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-20 01:54:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:54:35] [INFO ] After 25203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 850 ms.
Support contains 124 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 306 transitions
Trivial Post-agglo rules discarded 306 transitions
Performed 306 trivial Post agglomeration. Transition count delta: 306
Iterating post reduction 0 with 306 rules applied. Total rules applied 306 place count 3403 transition count 2847
Reduce places removed 306 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 323 rules applied. Total rules applied 629 place count 3097 transition count 2830
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 646 place count 3080 transition count 2830
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 646 place count 3080 transition count 2581
Deduced a syphon composed of 249 places in 7 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 1144 place count 2831 transition count 2581
Discarding 312 places :
Symmetric choice reduction at 3 with 312 rule applications. Total rules 1456 place count 2519 transition count 2269
Iterating global reduction 3 with 312 rules applied. Total rules applied 1768 place count 2519 transition count 2269
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 1768 place count 2519 transition count 2149
Deduced a syphon composed of 120 places in 26 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 2008 place count 2399 transition count 2149
Performed 699 Post agglomeration using F-continuation condition.Transition count delta: 699
Deduced a syphon composed of 699 places in 4 ms
Reduce places removed 699 places and 0 transitions.
Iterating global reduction 3 with 1398 rules applied. Total rules applied 3406 place count 1700 transition count 1450
Partial Free-agglomeration rule applied 404 times.
Drop transitions removed 404 transitions
Iterating global reduction 3 with 404 rules applied. Total rules applied 3810 place count 1700 transition count 1450
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3811 place count 1699 transition count 1449
Applied a total of 3811 rules in 1081 ms. Remains 1699 /3403 variables (removed 1704) and now considering 1449/3153 (removed 1704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1081 ms. Remains : 1699/3403 places, 1449/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 7) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :1
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1449 rows 1699 cols
[2023-03-20 01:54:38] [INFO ] Computed 551 place invariants in 38 ms
[2023-03-20 01:54:38] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 01:54:39] [INFO ] [Nat]Absence check using 518 positive place invariants in 191 ms returned sat
[2023-03-20 01:54:39] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 7 ms returned sat
[2023-03-20 01:54:42] [INFO ] After 2361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 01:54:42] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 1 ms to minimize.
[2023-03-20 01:54:43] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 0 ms to minimize.
[2023-03-20 01:54:43] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 0 ms to minimize.
[2023-03-20 01:54:43] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-20 01:54:44] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 0 ms to minimize.
[2023-03-20 01:54:44] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-20 01:54:44] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:54:45] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-20 01:54:45] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:54:45] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:54:46] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 0 ms to minimize.
[2023-03-20 01:54:46] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 1 ms to minimize.
[2023-03-20 01:54:46] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 0 ms to minimize.
[2023-03-20 01:54:47] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 0 ms to minimize.
[2023-03-20 01:54:47] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:54:47] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 3 ms to minimize.
[2023-03-20 01:54:48] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:54:48] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 0 ms to minimize.
[2023-03-20 01:54:48] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 0 ms to minimize.
[2023-03-20 01:54:49] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
[2023-03-20 01:54:49] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 1 ms to minimize.
[2023-03-20 01:54:49] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 0 ms to minimize.
[2023-03-20 01:54:50] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-20 01:54:50] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2023-03-20 01:54:50] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-20 01:54:51] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:54:51] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-20 01:54:51] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:54:51] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-20 01:54:52] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 1 ms to minimize.
[2023-03-20 01:54:52] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-20 01:54:52] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 0 ms to minimize.
[2023-03-20 01:54:53] [INFO ] Deduced a trap composed of 8 places in 194 ms of which 1 ms to minimize.
[2023-03-20 01:54:53] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:54:53] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:54:54] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-20 01:54:54] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 0 ms to minimize.
[2023-03-20 01:54:54] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 0 ms to minimize.
[2023-03-20 01:54:55] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:54:55] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-20 01:54:55] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-20 01:54:56] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2023-03-20 01:54:56] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-20 01:54:56] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 0 ms to minimize.
[2023-03-20 01:54:56] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:54:57] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 0 ms to minimize.
[2023-03-20 01:54:57] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-20 01:54:57] [INFO ] Deduced a trap composed of 13 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:54:58] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-20 01:54:58] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:54:58] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:54:58] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:54:59] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2023-03-20 01:54:59] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 6 ms to minimize.
[2023-03-20 01:54:59] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 16849 ms
[2023-03-20 01:55:00] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 1 ms to minimize.
[2023-03-20 01:55:00] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 0 ms to minimize.
[2023-03-20 01:55:00] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 5 ms to minimize.
[2023-03-20 01:55:01] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2023-03-20 01:55:01] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-20 01:55:01] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-20 01:55:02] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 3 ms to minimize.
[2023-03-20 01:55:02] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-20 01:55:02] [INFO ] Deduced a trap composed of 8 places in 345 ms of which 2 ms to minimize.
[2023-03-20 01:55:03] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-20 01:55:03] [INFO ] Deduced a trap composed of 9 places in 322 ms of which 1 ms to minimize.
[2023-03-20 01:55:04] [INFO ] Deduced a trap composed of 12 places in 434 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-20 01:55:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:55:04] [INFO ] After 25338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 359 ms.
Support contains 86 out of 1699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1699/1699 places, 1449/1449 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1699 transition count 1440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1690 transition count 1440
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 18 place count 1690 transition count 1431
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 36 place count 1681 transition count 1431
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 1680 transition count 1430
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 1680 transition count 1430
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 96 place count 1651 transition count 1401
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 1651 transition count 1401
Applied a total of 104 rules in 262 ms. Remains 1651 /1699 variables (removed 48) and now considering 1401/1449 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 1651/1699 places, 1401/1449 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 84363 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84363 steps, saw 77702 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1401 rows 1651 cols
[2023-03-20 01:55:08] [INFO ] Computed 551 place invariants in 55 ms
[2023-03-20 01:55:09] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 01:55:09] [INFO ] [Nat]Absence check using 525 positive place invariants in 231 ms returned sat
[2023-03-20 01:55:09] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 5 ms returned sat
[2023-03-20 01:55:12] [INFO ] After 2324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 01:55:13] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:55:13] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:55:13] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 0 ms to minimize.
[2023-03-20 01:55:14] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:55:14] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-20 01:55:14] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:55:14] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-20 01:55:15] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 0 ms to minimize.
[2023-03-20 01:55:15] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 0 ms to minimize.
[2023-03-20 01:55:15] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 0 ms to minimize.
[2023-03-20 01:55:16] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 0 ms to minimize.
[2023-03-20 01:55:16] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 0 ms to minimize.
[2023-03-20 01:55:16] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 0 ms to minimize.
[2023-03-20 01:55:17] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-20 01:55:17] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-20 01:55:18] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:55:18] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:55:18] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:55:18] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-20 01:55:19] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 0 ms to minimize.
[2023-03-20 01:55:19] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 0 ms to minimize.
[2023-03-20 01:55:19] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 0 ms to minimize.
[2023-03-20 01:55:19] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-20 01:55:20] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
[2023-03-20 01:55:20] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 0 ms to minimize.
[2023-03-20 01:55:21] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:55:21] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 0 ms to minimize.
[2023-03-20 01:55:21] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-20 01:55:21] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:55:22] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 1 ms to minimize.
[2023-03-20 01:55:22] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 1 ms to minimize.
[2023-03-20 01:55:22] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:55:23] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-20 01:55:23] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-20 01:55:23] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2023-03-20 01:55:23] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-20 01:55:24] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:55:24] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 11621 ms
[2023-03-20 01:55:24] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-20 01:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 399 ms
[2023-03-20 01:55:25] [INFO ] Deduced a trap composed of 10 places in 346 ms of which 0 ms to minimize.
[2023-03-20 01:55:25] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2023-03-20 01:55:26] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 1 ms to minimize.
[2023-03-20 01:55:26] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 1 ms to minimize.
[2023-03-20 01:55:26] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 2 ms to minimize.
[2023-03-20 01:55:27] [INFO ] Deduced a trap composed of 9 places in 387 ms of which 0 ms to minimize.
[2023-03-20 01:55:27] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 1 ms to minimize.
[2023-03-20 01:55:28] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-20 01:55:28] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 0 ms to minimize.
[2023-03-20 01:55:28] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 0 ms to minimize.
[2023-03-20 01:55:29] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 1 ms to minimize.
[2023-03-20 01:55:29] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-20 01:55:29] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 0 ms to minimize.
[2023-03-20 01:55:30] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 0 ms to minimize.
[2023-03-20 01:55:30] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 0 ms to minimize.
[2023-03-20 01:55:31] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 1 ms to minimize.
[2023-03-20 01:55:31] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 1 ms to minimize.
[2023-03-20 01:55:31] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-20 01:55:31] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 1 ms to minimize.
[2023-03-20 01:55:32] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-20 01:55:32] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 0 ms to minimize.
[2023-03-20 01:55:32] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-20 01:55:33] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:55:33] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-20 01:55:33] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:55:33] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 10 ms to minimize.
[2023-03-20 01:55:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 26 trap constraints in 8903 ms
[2023-03-20 01:55:34] [INFO ] After 24194ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 01:55:34] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 384 ms.
Support contains 73 out of 1651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1651 transition count 1399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1649 transition count 1399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 1649 transition count 1398
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1648 transition count 1398
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 1636 transition count 1386
Applied a total of 30 rules in 115 ms. Remains 1636 /1651 variables (removed 15) and now considering 1386/1401 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1636/1651 places, 1386/1401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 82227 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82227 steps, saw 75741 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1386 rows 1636 cols
[2023-03-20 01:55:38] [INFO ] Computed 551 place invariants in 42 ms
[2023-03-20 01:55:38] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:55:38] [INFO ] [Nat]Absence check using 524 positive place invariants in 151 ms returned sat
[2023-03-20 01:55:38] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 60 ms returned sat
[2023-03-20 01:55:41] [INFO ] After 1944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:55:42] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2023-03-20 01:55:42] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2023-03-20 01:55:43] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-20 01:55:43] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2023-03-20 01:55:43] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 1 ms to minimize.
[2023-03-20 01:55:44] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-20 01:55:44] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 0 ms to minimize.
[2023-03-20 01:55:44] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:55:44] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-20 01:55:45] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 0 ms to minimize.
[2023-03-20 01:55:45] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-20 01:55:45] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:55:46] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-20 01:55:46] [INFO ] Deduced a trap composed of 10 places in 238 ms of which 1 ms to minimize.
[2023-03-20 01:55:46] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-20 01:55:47] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 1 ms to minimize.
[2023-03-20 01:55:47] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-20 01:55:47] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-20 01:55:48] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-20 01:55:48] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-20 01:55:48] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:55:48] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 0 ms to minimize.
[2023-03-20 01:55:49] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 1 ms to minimize.
[2023-03-20 01:55:49] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 1 ms to minimize.
[2023-03-20 01:55:49] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2023-03-20 01:55:50] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2023-03-20 01:55:50] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-20 01:55:50] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:55:50] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-20 01:55:51] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:55:51] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-20 01:55:51] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:55:51] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 0 ms to minimize.
[2023-03-20 01:55:52] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:55:52] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:55:52] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:55:52] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 10642 ms
[2023-03-20 01:55:53] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 0 ms to minimize.
[2023-03-20 01:55:53] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2023-03-20 01:55:53] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 0 ms to minimize.
[2023-03-20 01:55:54] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 1 ms to minimize.
[2023-03-20 01:55:54] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 1 ms to minimize.
[2023-03-20 01:55:54] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 0 ms to minimize.
[2023-03-20 01:55:55] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 1 ms to minimize.
[2023-03-20 01:55:55] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-20 01:55:56] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:55:56] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 1 ms to minimize.
[2023-03-20 01:55:56] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2023-03-20 01:55:56] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-20 01:55:57] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-20 01:55:57] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2023-03-20 01:55:57] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4676 ms
[2023-03-20 01:55:58] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2023-03-20 01:55:58] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:55:58] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:55:59] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:55:59] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-20 01:55:59] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:56:00] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:56:00] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-20 01:56:00] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2023-03-20 01:56:01] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2023-03-20 01:56:01] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:56:01] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2023-03-20 01:56:01] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-20 01:56:02] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 0 ms to minimize.
[2023-03-20 01:56:02] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2023-03-20 01:56:02] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-20 01:56:02] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:56:03] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:56:03] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-20 01:56:04] [INFO ] Deduced a trap composed of 6 places in 1098 ms of which 2 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-20 01:56:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:56:04] [INFO ] After 26113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 329 ms.
Support contains 73 out of 1636 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1636/1636 places, 1386/1386 transitions.
Applied a total of 0 rules in 54 ms. Remains 1636 /1636 variables (removed 0) and now considering 1386/1386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 1636/1636 places, 1386/1386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1636/1636 places, 1386/1386 transitions.
Applied a total of 0 rules in 56 ms. Remains 1636 /1636 variables (removed 0) and now considering 1386/1386 (removed 0) transitions.
[2023-03-20 01:56:05] [INFO ] Invariant cache hit.
[2023-03-20 01:56:06] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2023-03-20 01:56:06] [INFO ] Invariant cache hit.
[2023-03-20 01:56:08] [INFO ] Implicit Places using invariants and state equation in 2597 ms returned []
Implicit Place search using SMT with State Equation took 3700 ms to find 0 implicit places.
[2023-03-20 01:56:08] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-20 01:56:08] [INFO ] Invariant cache hit.
[2023-03-20 01:56:09] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4867 ms. Remains : 1636/1636 places, 1386/1386 transitions.
Applied a total of 0 rules in 53 ms. Remains 1636 /1636 variables (removed 0) and now considering 1386/1386 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-20 01:56:09] [INFO ] Invariant cache hit.
[2023-03-20 01:56:10] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:56:10] [INFO ] [Nat]Absence check using 524 positive place invariants in 122 ms returned sat
[2023-03-20 01:56:10] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-20 01:56:13] [INFO ] After 2306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:56:13] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 0 ms to minimize.
[2023-03-20 01:56:14] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2023-03-20 01:56:14] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:56:14] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-20 01:56:15] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2023-03-20 01:56:15] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 0 ms to minimize.
[2023-03-20 01:56:15] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 2 ms to minimize.
[2023-03-20 01:56:15] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:56:16] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 0 ms to minimize.
[2023-03-20 01:56:16] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:56:16] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 1 ms to minimize.
[2023-03-20 01:56:17] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2023-03-20 01:56:17] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-20 01:56:17] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2023-03-20 01:56:18] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:56:18] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-20 01:56:18] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-20 01:56:19] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2023-03-20 01:56:19] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-20 01:56:19] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-20 01:56:19] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 0 ms to minimize.
[2023-03-20 01:56:20] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-20 01:56:20] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 0 ms to minimize.
[2023-03-20 01:56:20] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 3 ms to minimize.
[2023-03-20 01:56:21] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 0 ms to minimize.
[2023-03-20 01:56:21] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:56:21] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2023-03-20 01:56:22] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 0 ms to minimize.
[2023-03-20 01:56:22] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2023-03-20 01:56:22] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2023-03-20 01:56:22] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-20 01:56:23] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2023-03-20 01:56:23] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 1 ms to minimize.
[2023-03-20 01:56:23] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 0 ms to minimize.
[2023-03-20 01:56:24] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-20 01:56:24] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:56:24] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2023-03-20 01:56:24] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 13 ms to minimize.
[2023-03-20 01:56:25] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2023-03-20 01:56:25] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2023-03-20 01:56:26] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 0 ms to minimize.
[2023-03-20 01:56:26] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:56:26] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 1 ms to minimize.
[2023-03-20 01:56:26] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 14 ms to minimize.
[2023-03-20 01:56:27] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 1 ms to minimize.
[2023-03-20 01:56:28] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 0 ms to minimize.
[2023-03-20 01:56:28] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 0 ms to minimize.
[2023-03-20 01:56:28] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 01:56:28] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2023-03-20 01:56:28] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 15307 ms
[2023-03-20 01:56:29] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:56:29] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2023-03-20 01:56:29] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-20 01:56:30] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:56:30] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-20 01:56:30] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 0 ms to minimize.
[2023-03-20 01:56:31] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 1 ms to minimize.
[2023-03-20 01:56:31] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2023-03-20 01:56:31] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 1 ms to minimize.
[2023-03-20 01:56:32] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 1 ms to minimize.
[2023-03-20 01:56:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3162 ms
[2023-03-20 01:56:32] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2023-03-20 01:56:33] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:56:33] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:56:33] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 0 ms to minimize.
[2023-03-20 01:56:34] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:56:34] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-20 01:56:34] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 1 ms to minimize.
[2023-03-20 01:56:35] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:56:35] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:56:35] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-20 01:56:35] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-20 01:56:36] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:56:36] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-20 01:56:36] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 0 ms to minimize.
[2023-03-20 01:56:36] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:56:37] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 1 ms to minimize.
[2023-03-20 01:56:37] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:56:37] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-20 01:56:38] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2023-03-20 01:56:38] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2023-03-20 01:56:38] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 1 ms to minimize.
[2023-03-20 01:56:39] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-20 01:56:39] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6549 ms
[2023-03-20 01:56:39] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 2 ms to minimize.
[2023-03-20 01:56:40] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 0 ms to minimize.
[2023-03-20 01:56:40] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2023-03-20 01:56:40] [INFO ] Deduced a trap composed of 8 places in 228 ms of which 0 ms to minimize.
[2023-03-20 01:56:41] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 0 ms to minimize.
[2023-03-20 01:56:41] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 1 ms to minimize.
[2023-03-20 01:56:41] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-20 01:56:42] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 0 ms to minimize.
[2023-03-20 01:56:42] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-20 01:56:42] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 1 ms to minimize.
[2023-03-20 01:56:43] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 1 ms to minimize.
[2023-03-20 01:56:43] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 0 ms to minimize.
[2023-03-20 01:56:43] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-20 01:56:44] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 0 ms to minimize.
[2023-03-20 01:56:44] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:56:44] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-20 01:56:45] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 3 ms to minimize.
[2023-03-20 01:56:45] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-20 01:56:45] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-20 01:56:46] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 1 ms to minimize.
[2023-03-20 01:56:46] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:56:46] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:56:47] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:56:47] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:56:47] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 0 ms to minimize.
[2023-03-20 01:56:48] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 1 ms to minimize.
[2023-03-20 01:56:48] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 0 ms to minimize.
[2023-03-20 01:56:48] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-20 01:56:49] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:56:49] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 1 ms to minimize.
[2023-03-20 01:56:50] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 1 ms to minimize.
[2023-03-20 01:56:50] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 0 ms to minimize.
[2023-03-20 01:56:50] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 1 ms to minimize.
[2023-03-20 01:56:51] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 0 ms to minimize.
[2023-03-20 01:56:51] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 1 ms to minimize.
[2023-03-20 01:56:51] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 1 ms to minimize.
[2023-03-20 01:56:51] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 1 ms to minimize.
[2023-03-20 01:56:52] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 0 ms to minimize.
[2023-03-20 01:56:52] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 1 ms to minimize.
[2023-03-20 01:56:53] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 0 ms to minimize.
[2023-03-20 01:56:53] [INFO ] Deduced a trap composed of 21 places in 329 ms of which 0 ms to minimize.
[2023-03-20 01:56:53] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-20 01:56:54] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:56:54] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 0 ms to minimize.
[2023-03-20 01:56:54] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2023-03-20 01:56:55] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-20 01:56:55] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 0 ms to minimize.
[2023-03-20 01:56:55] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:56:56] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 2 ms to minimize.
[2023-03-20 01:56:56] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 16683 ms
[2023-03-20 01:56:56] [INFO ] After 45543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1675 ms.
[2023-03-20 01:56:57] [INFO ] After 47778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:56:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 19 ms.
[2023-03-20 01:56:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1636 places, 1386 transitions and 6297 arcs took 18 ms.
[2023-03-20 01:56:58] [INFO ] Flatten gal took : 217 ms
Total runtime 170684 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityCardinality

FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679277421046
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13006848 kB
After kill :
MemTotal: 16393220 kB
MemFree: 13006328 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type EXCL) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-08
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 3 ShieldPPPs-PT-050B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-08
lola: result : true
lola: markings : 95
lola: fired transitions : 94
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-08 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 23 (type EXCL) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-06
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 0 ShieldPPPs-PT-050B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 22 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-06
lola: result : true
lola: markings : 110
lola: fired transitions : 109
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 20 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 23 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-06 (obsolete)
lola: FINISHED task # 13 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 93
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 30 (type EXCL) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-14
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 26 (type FNDP) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type EQUN) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type SRCH) for 6 ShieldPPPs-PT-050B-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-14.sara.
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-20.sara.
lola: FINISHED task # 29 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-14
lola: result : true
lola: markings : 168
lola: fired transitions : 167
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 26 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 27 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 30 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-14 (obsolete)
lola: FINISHED task # 26 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-14
lola: result : unknown
lola: fired transitions : 498
lola: tried executions : 63
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 37 (type EXCL) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-15
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 9 ShieldPPPs-PT-050B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 19 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-06
lola: result : true
lola: fired transitions : 108
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 36 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityCardinality-15
lola: result : true
lola: markings : 89
lola: fired transitions : 88
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 34 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-ReachabilityCardinality-06: EF true tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-08: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-14: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityCardinality-15: AG false tandem / insertion


Time elapsed: 3 secs. Pages in use: 2
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-27.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1947)

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-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPs-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715400510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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