Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978500146.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVs-PT-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 6.7K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 18:31 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.8K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 18:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 320K 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 ShieldRVs-PT-050A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-050A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679343676432

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 20:21:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 20:21:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 20:21:18] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2023-03-20 20:21:18] [INFO ] Transformed 703 places.
[2023-03-20 20:21:18] [INFO ] Transformed 953 transitions.
[2023-03-20 20:21:18] [INFO ] Found NUPN structural information;
[2023-03-20 20:21:18] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 221 out of 703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 46 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 20:21:18] [INFO ] Computed 201 place invariants in 29 ms
[2023-03-20 20:21:18] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-20 20:21:18] [INFO ] Invariant cache hit.
[2023-03-20 20:21:19] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-20 20:21:19] [INFO ] Invariant cache hit.
[2023-03-20 20:21:19] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1577 ms. Remains : 703/703 places, 953/953 transitions.
Support contains 221 out of 703 places after structural reductions.
[2023-03-20 20:21:20] [INFO ] Flatten gal took : 124 ms
[2023-03-20 20:21:20] [INFO ] Flatten gal took : 74 ms
[2023-03-20 20:21:20] [INFO ] Input system was already deterministic with 953 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 86) seen :74
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :1
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 :1
Running SMT prover for 5 properties.
[2023-03-20 20:21:21] [INFO ] Invariant cache hit.
[2023-03-20 20:21:21] [INFO ] [Real]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-20 20:21:22] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 20:21:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 37 ms returned sat
[2023-03-20 20:21:23] [INFO ] After 864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 20:21:23] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 5 ms to minimize.
[2023-03-20 20:21:23] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-20 20:21:24] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2023-03-20 20:21:24] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 2 ms to minimize.
[2023-03-20 20:21:24] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 2 ms to minimize.
[2023-03-20 20:21:24] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2023-03-20 20:21:25] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2023-03-20 20:21:25] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-20 20:21:25] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2023-03-20 20:21:25] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:21:26] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2023-03-20 20:21:26] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-20 20:21:26] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 0 ms to minimize.
[2023-03-20 20:21:26] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:21:27] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-20 20:21:27] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:21:27] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 0 ms to minimize.
[2023-03-20 20:21:27] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-20 20:21:28] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2023-03-20 20:21:28] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:21:28] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-20 20:21:28] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:21:29] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-20 20:21:29] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2023-03-20 20:21:29] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 0 ms to minimize.
[2023-03-20 20:21:29] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 0 ms to minimize.
[2023-03-20 20:21:30] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:21:30] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-20 20:21:30] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 0 ms to minimize.
[2023-03-20 20:21:30] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 0 ms to minimize.
[2023-03-20 20:21:30] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:21:31] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 0 ms to minimize.
[2023-03-20 20:21:31] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2023-03-20 20:21:31] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 0 ms to minimize.
[2023-03-20 20:21:31] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2023-03-20 20:21:32] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2023-03-20 20:21:32] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2023-03-20 20:21:32] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-20 20:21:32] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:21:33] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 1 ms to minimize.
[2023-03-20 20:21:33] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 0 ms to minimize.
[2023-03-20 20:21:33] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:21:33] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:21:34] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:21:34] [INFO ] Deduced a trap composed of 16 places in 214 ms of which 1 ms to minimize.
[2023-03-20 20:21:34] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:21:34] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 0 ms to minimize.
[2023-03-20 20:21:35] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 1 ms to minimize.
[2023-03-20 20:21:35] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 0 ms to minimize.
[2023-03-20 20:21:35] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 1 ms to minimize.
[2023-03-20 20:21:35] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:21:36] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 1 ms to minimize.
[2023-03-20 20:21:36] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 1 ms to minimize.
[2023-03-20 20:21:36] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:21:36] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 1 ms to minimize.
[2023-03-20 20:21:37] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2023-03-20 20:21:37] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 2 ms to minimize.
[2023-03-20 20:21:37] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:21:38] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 0 ms to minimize.
[2023-03-20 20:21:38] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 1 ms to minimize.
[2023-03-20 20:21:38] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 0 ms to minimize.
[2023-03-20 20:21:38] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-20 20:21:39] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-20 20:21:39] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2023-03-20 20:21:39] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-20 20:21:39] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:21:40] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 2 ms to minimize.
[2023-03-20 20:21:40] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-20 20:21:40] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:21:40] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 1 ms to minimize.
[2023-03-20 20:21:41] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 0 ms to minimize.
[2023-03-20 20:21:41] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:21:41] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:21:41] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2023-03-20 20:21:42] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:21:42] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:21:42] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-20 20:21:42] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:21:42] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2023-03-20 20:21:43] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:21:43] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:21:43] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-20 20:21:43] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:21:44] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:21:44] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-20 20:21:44] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:21:44] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 1 ms to minimize.
[2023-03-20 20:21:44] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-20 20:21:45] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:21:45] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-20 20:21:45] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:21:45] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:21:45] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:21:45] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-20 20:21:46] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2023-03-20 20:21:46] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:21:46] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2023-03-20 20:21:46] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-20 20:21:46] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:21:47] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-20 20:21:47] [INFO ] Deduced a trap composed of 31 places in 125 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 20:21:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:21:47] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 268 ms.
Support contains 27 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 98 place count 702 transition count 952
Applied a total of 98 rules in 215 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 702/703 places, 952/953 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 20:21:48] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-20 20:21:48] [INFO ] [Real]Absence check using 201 positive place invariants in 58 ms returned sat
[2023-03-20 20:21:49] [INFO ] After 865ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 20:21:49] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 20:21:49] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 20:21:50] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-20 20:21:50] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2023-03-20 20:21:50] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 0 ms to minimize.
[2023-03-20 20:21:51] [INFO ] Deduced a trap composed of 7 places in 222 ms of which 0 ms to minimize.
[2023-03-20 20:21:51] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:21:51] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:21:51] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-20 20:21:51] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:21:52] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-20 20:21:52] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 0 ms to minimize.
[2023-03-20 20:21:52] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-20 20:21:52] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:21:53] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-20 20:21:53] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 1 ms to minimize.
[2023-03-20 20:21:53] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 1 ms to minimize.
[2023-03-20 20:21:53] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-20 20:21:53] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:21:54] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 1 ms to minimize.
[2023-03-20 20:21:54] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-20 20:21:54] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-20 20:21:54] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:21:55] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-20 20:21:55] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2023-03-20 20:21:55] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:21:55] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 1 ms to minimize.
[2023-03-20 20:21:56] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:21:56] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 0 ms to minimize.
[2023-03-20 20:21:56] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 20:21:56] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:21:56] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:21:57] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:21:57] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:21:57] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 1 ms to minimize.
[2023-03-20 20:21:57] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-20 20:21:57] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:21:58] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-20 20:21:58] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:21:58] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:21:58] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 0 ms to minimize.
[2023-03-20 20:21:59] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-20 20:21:59] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 2 ms to minimize.
[2023-03-20 20:21:59] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:21:59] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 1 ms to minimize.
[2023-03-20 20:22:00] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 0 ms to minimize.
[2023-03-20 20:22:00] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-20 20:22:00] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-20 20:22:01] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-20 20:22:01] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-20 20:22:01] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 0 ms to minimize.
[2023-03-20 20:22:01] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:22:02] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:22:02] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-20 20:22:02] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-20 20:22:02] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-20 20:22:03] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-20 20:22:03] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 0 ms to minimize.
[2023-03-20 20:22:03] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2023-03-20 20:22:03] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 0 ms to minimize.
[2023-03-20 20:22:04] [INFO ] Deduced a trap composed of 7 places in 219 ms of which 0 ms to minimize.
[2023-03-20 20:22:04] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 0 ms to minimize.
[2023-03-20 20:22:04] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:22:04] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 0 ms to minimize.
[2023-03-20 20:22:05] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2023-03-20 20:22:05] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-20 20:22:05] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:22:05] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 0 ms to minimize.
[2023-03-20 20:22:05] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 0 ms to minimize.
[2023-03-20 20:22:06] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:22:06] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2023-03-20 20:22:06] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 3 ms to minimize.
[2023-03-20 20:22:06] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 0 ms to minimize.
[2023-03-20 20:22:07] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 0 ms to minimize.
[2023-03-20 20:22:07] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-20 20:22:07] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 0 ms to minimize.
[2023-03-20 20:22:07] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:22:08] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-20 20:22:08] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2023-03-20 20:22:08] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:22:08] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2023-03-20 20:22:09] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2023-03-20 20:22:09] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:22:09] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 0 ms to minimize.
[2023-03-20 20:22:09] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:22:09] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-20 20:22:10] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 0 ms to minimize.
[2023-03-20 20:22:10] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 1 ms to minimize.
[2023-03-20 20:22:10] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 0 ms to minimize.
[2023-03-20 20:22:10] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-20 20:22:11] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 0 ms to minimize.
[2023-03-20 20:22:11] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2023-03-20 20:22:11] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:22:11] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:22:12] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-20 20:22:12] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:22:12] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:22:12] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:22:13] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-20 20:22:13] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-20 20:22:13] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-20 20:22:13] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:22:13] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:22:14] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:22:14] [INFO ] Deduced a trap composed of 11 places in 175 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 20:22:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:22:14] [INFO ] After 25188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 122 ms.
Support contains 20 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 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 702 transition count 952
Applied a total of 1 rules in 77 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 702/702 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) 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 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 952 rows 702 cols
[2023-03-20 20:22:14] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-20 20:22:15] [INFO ] [Real]Absence check using 201 positive place invariants in 35 ms returned sat
[2023-03-20 20:22:15] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:22:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-20 20:22:15] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:22:16] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-20 20:22:16] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2023-03-20 20:22:16] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2023-03-20 20:22:16] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-20 20:22:16] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2023-03-20 20:22:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 694 ms
[2023-03-20 20:22:16] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 0 ms to minimize.
[2023-03-20 20:22:17] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:22:17] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-20 20:22:17] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-20 20:22:17] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:22:18] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2023-03-20 20:22:18] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-20 20:22:18] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-20 20:22:18] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-20 20:22:19] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2023-03-20 20:22:19] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:22:19] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-20 20:22:19] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-20 20:22:19] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-20 20:22:20] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-20 20:22:20] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:22:20] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:22:20] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 0 ms to minimize.
[2023-03-20 20:22:21] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-20 20:22:21] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:22:21] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:22:21] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:22:21] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 1 ms to minimize.
[2023-03-20 20:22:22] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
[2023-03-20 20:22:22] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:22:22] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:22:22] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
[2023-03-20 20:22:22] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:22:23] [INFO ] Deduced a trap composed of 20 places in 172 ms of which 1 ms to minimize.
[2023-03-20 20:22:23] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:22:23] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:22:23] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 1 ms to minimize.
[2023-03-20 20:22:24] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:22:24] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:22:24] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:22:24] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:22:24] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:22:25] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:22:25] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:22:25] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 2 ms to minimize.
[2023-03-20 20:22:25] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:22:25] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:22:26] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-20 20:22:26] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 0 ms to minimize.
[2023-03-20 20:22:26] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2023-03-20 20:22:26] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 0 ms to minimize.
[2023-03-20 20:22:26] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:22:27] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-20 20:22:27] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:22:27] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 1 ms to minimize.
[2023-03-20 20:22:27] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:22:27] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:22:28] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:22:28] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 0 ms to minimize.
[2023-03-20 20:22:28] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:22:29] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:22:29] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:22:29] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:22:29] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:22:29] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:22:30] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 0 ms to minimize.
[2023-03-20 20:22:30] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 0 ms to minimize.
[2023-03-20 20:22:30] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:22:30] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:22:30] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:22:31] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:22:31] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 0 ms to minimize.
[2023-03-20 20:22:31] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-20 20:22:31] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:22:32] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-20 20:22:32] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 0 ms to minimize.
[2023-03-20 20:22:32] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2023-03-20 20:22:32] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 0 ms to minimize.
[2023-03-20 20:22:33] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 1 ms to minimize.
[2023-03-20 20:22:33] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 2 ms to minimize.
[2023-03-20 20:22:33] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-20 20:22:33] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 1 ms to minimize.
[2023-03-20 20:22:34] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2023-03-20 20:22:34] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:22:34] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:22:34] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 0 ms to minimize.
[2023-03-20 20:22:35] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-20 20:22:35] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:22:35] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:22:35] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:22:35] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 1 ms to minimize.
[2023-03-20 20:22:36] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 0 ms to minimize.
[2023-03-20 20:22:36] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 0 ms to minimize.
[2023-03-20 20:22:36] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:22:36] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-20 20:22:37] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:22:37] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:22:37] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:22:37] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-20 20:22:38] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2023-03-20 20:22:38] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:22:38] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2023-03-20 20:22:38] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 0 ms to minimize.
[2023-03-20 20:22:39] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2023-03-20 20:22:39] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 1 ms to minimize.
[2023-03-20 20:22:39] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-20 20:22:39] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 1 ms to minimize.
[2023-03-20 20:22:40] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:22:40] [INFO ] Deduced a trap composed of 19 places in 182 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 20:22:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:22:40] [INFO ] After 25158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 101 ms.
Support contains 16 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 30 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 702/702 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 202171 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202171 steps, saw 63850 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 20:22:43] [INFO ] Invariant cache hit.
[2023-03-20 20:22:43] [INFO ] [Real]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-20 20:22:44] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 20:22:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 20:22:45] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 20:22:45] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:22:45] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2023-03-20 20:22:45] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-20 20:22:45] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-20 20:22:45] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2023-03-20 20:22:45] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-20 20:22:46] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-20 20:22:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 929 ms
[2023-03-20 20:22:46] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 0 ms to minimize.
[2023-03-20 20:22:46] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 1 ms to minimize.
[2023-03-20 20:22:46] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 0 ms to minimize.
[2023-03-20 20:22:47] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-20 20:22:47] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:22:47] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 0 ms to minimize.
[2023-03-20 20:22:47] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:22:47] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:22:48] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 1 ms to minimize.
[2023-03-20 20:22:48] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:22:48] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2023-03-20 20:22:48] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:22:48] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 1 ms to minimize.
[2023-03-20 20:22:49] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 0 ms to minimize.
[2023-03-20 20:22:49] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-20 20:22:49] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:22:49] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:22:50] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 0 ms to minimize.
[2023-03-20 20:22:50] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-20 20:22:50] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:22:50] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-20 20:22:50] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:22:51] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2023-03-20 20:22:51] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:22:51] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:22:51] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2023-03-20 20:22:51] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2023-03-20 20:22:52] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2023-03-20 20:22:52] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 1 ms to minimize.
[2023-03-20 20:22:52] [INFO ] Deduced a trap composed of 27 places in 175 ms of which 1 ms to minimize.
[2023-03-20 20:22:52] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2023-03-20 20:22:52] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2023-03-20 20:22:53] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:22:53] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2023-03-20 20:22:53] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-20 20:22:53] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-20 20:22:54] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2023-03-20 20:22:54] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-20 20:22:54] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 0 ms to minimize.
[2023-03-20 20:22:54] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-20 20:22:54] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2023-03-20 20:22:55] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-20 20:22:55] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2023-03-20 20:22:55] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-20 20:22:55] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 1 ms to minimize.
[2023-03-20 20:22:55] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:22:56] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:22:56] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2023-03-20 20:22:56] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:22:56] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 0 ms to minimize.
[2023-03-20 20:22:56] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2023-03-20 20:22:57] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2023-03-20 20:22:57] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:22:57] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:22:57] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-20 20:22:57] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:22:58] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2023-03-20 20:22:58] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-20 20:22:58] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 20:22:58] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2023-03-20 20:22:58] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-20 20:22:59] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-20 20:22:59] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 0 ms to minimize.
[2023-03-20 20:22:59] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 0 ms to minimize.
[2023-03-20 20:22:59] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-20 20:22:59] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:23:00] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-20 20:23:00] [INFO ] Deduced a trap composed of 13 places in 198 ms of which 0 ms to minimize.
[2023-03-20 20:23:00] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 1 ms to minimize.
[2023-03-20 20:23:00] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:23:01] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:23:01] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:23:01] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 2 ms to minimize.
[2023-03-20 20:23:01] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-20 20:23:01] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2023-03-20 20:23:02] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2023-03-20 20:23:02] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
[2023-03-20 20:23:02] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2023-03-20 20:23:02] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 1 ms to minimize.
[2023-03-20 20:23:02] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-20 20:23:03] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:23:03] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-20 20:23:03] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:23:03] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2023-03-20 20:23:03] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-20 20:23:04] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 0 ms to minimize.
[2023-03-20 20:23:04] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2023-03-20 20:23:04] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:23:04] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 0 ms to minimize.
[2023-03-20 20:23:04] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2023-03-20 20:23:05] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:23:05] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:23:05] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:23:05] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 1 ms to minimize.
[2023-03-20 20:23:05] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-20 20:23:06] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2023-03-20 20:23:06] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-20 20:23:06] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:23:06] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:23:06] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2023-03-20 20:23:07] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 1 ms to minimize.
[2023-03-20 20:23:07] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 0 ms to minimize.
[2023-03-20 20:23:07] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-20 20:23:07] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 0 ms to minimize.
[2023-03-20 20:23:07] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-20 20:23:08] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2023-03-20 20:23:08] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-20 20:23:08] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 0 ms to minimize.
[2023-03-20 20:23:08] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-20 20:23:09] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-20 20:23:09] [INFO ] Deduced a trap composed of 15 places in 168 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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 20:23:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 20:23:09] [INFO ] After 25106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 80 ms.
Support contains 16 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 52 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 702/702 places, 952/952 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 36 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-20 20:23:09] [INFO ] Invariant cache hit.
[2023-03-20 20:23:09] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-20 20:23:09] [INFO ] Invariant cache hit.
[2023-03-20 20:23:10] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-20 20:23:10] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-20 20:23:10] [INFO ] Invariant cache hit.
[2023-03-20 20:23:11] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1809 ms. Remains : 702/702 places, 952/952 transitions.
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 43 ms
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 43 ms
[2023-03-20 20:23:11] [INFO ] Input system was already deterministic with 953 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 34 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 702/703 places, 952/953 transitions.
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 36 ms
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 39 ms
[2023-03-20 20:23:11] [INFO ] Input system was already deterministic with 952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 35 ms
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 36 ms
[2023-03-20 20:23:11] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 12 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 37 ms
[2023-03-20 20:23:11] [INFO ] Flatten gal took : 38 ms
[2023-03-20 20:23:11] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 701 transition count 951
Applied a total of 2 rules in 34 ms. Remains 701 /703 variables (removed 2) and now considering 951/953 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 701/703 places, 951/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 27 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 31 ms
[2023-03-20 20:23:12] [INFO ] Input system was already deterministic with 951 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 31 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 31 ms
[2023-03-20 20:23:12] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 31 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 30 ms
[2023-03-20 20:23:12] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Applied a total of 2 rules in 32 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 702/703 places, 952/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 31 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 32 ms
[2023-03-20 20:23:12] [INFO ] Input system was already deterministic with 952 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 29 ms
[2023-03-20 20:23:12] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 26 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 34 ms
[2023-03-20 20:23:12] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 30 ms
[2023-03-20 20:23:12] [INFO ] Flatten gal took : 29 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 27 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 9 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 30 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 32 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 27 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 7 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 26 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 10 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 36 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
Starting structural reductions in LTL mode, iteration 0 : 703/703 places, 953/953 transitions.
Applied a total of 0 rules in 8 ms. Remains 703 /703 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 703/703 places, 953/953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 27 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:13] [INFO ] Input system was already deterministic with 953 transitions.
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 28 ms
[2023-03-20 20:23:13] [INFO ] Flatten gal took : 29 ms
[2023-03-20 20:23:13] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 20:23:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 703 places, 953 transitions and 4600 arcs took 5 ms.
Total runtime 115939 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 703 NrTr: 953 NrArc: 4600)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.067sec

net check time: 0m 0.001sec

init dd package: 0m 3.139sec


before gc: list nodes free: 1890992

after gc: idd nodes used:3765, unused:63996235; list nodes free:276803406

before gc: list nodes free: 1265722

after gc: idd nodes used:4031, unused:63995969; list nodes free:276802011

before gc: list nodes free: 1314112

after gc: idd nodes used:4217, unused:63995783; list nodes free:276801262

before gc: list nodes free: 1107223

after gc: idd nodes used:4153, unused:63995847; list nodes free:276801508

before gc: list nodes free: 1132032

after gc: idd nodes used:4578, unused:63995422; list nodes free:276799347

before gc: list nodes free: 865529

after gc: idd nodes used:4636, unused:63995364; list nodes free:276799007

before gc: list nodes free: 935245

after gc: idd nodes used:4423, unused:63995577; list nodes free:276800184

before gc: list nodes free: 1330288

after gc: idd nodes used:4458, unused:63995542; list nodes free:276799891

before gc: list nodes free: 1318620

after gc: idd nodes used:4564, unused:63995436; list nodes free:276799272

before gc: list nodes free: 1122227

after gc: idd nodes used:4605, unused:63995395; list nodes free:276799252

before gc: list nodes free: 535467

after gc: idd nodes used:4789, unused:63995211; list nodes free:276798109

before gc: list nodes free: 214950

after gc: idd nodes used:4758, unused:63995242; list nodes free:276798315

before gc: list nodes free: 428808

after gc: idd nodes used:4795, unused:63995205; list nodes free:276798137

before gc: list nodes free: 687053

after gc: idd nodes used:4995, unused:63995005; list nodes free:276797063

before gc: list nodes free: 962765

after gc: idd nodes used:5103, unused:63994897; list nodes free:276796569

before gc: list nodes free: 920180

after gc: idd nodes used:4930, unused:63995070; list nodes free:276797461

before gc: list nodes free: 223841

after gc: idd nodes used:5255, unused:63994745; list nodes free:276795746

before gc: list nodes free: 329802

after gc: idd nodes used:5069, unused:63994931; list nodes free:276796775

before gc: list nodes free: 489798

after gc: idd nodes used:5052, unused:63994948; list nodes free:276796879

before gc: list nodes free: 966530

after gc: idd nodes used:5006, unused:63994994; list nodes free:276797181

before gc: list nodes free: 739488

after gc: idd nodes used:5114, unused:63994886; list nodes free:276796580

before gc: list nodes free: 918504

after gc: idd nodes used:5280, unused:63994720; list nodes free:276795775

before gc: list nodes free: 203729

after gc: idd nodes used:5200, unused:63994800; list nodes free:276796220

before gc: list nodes free: 493495

after gc: idd nodes used:5186, unused:63994814; list nodes free:276796352

before gc: list nodes free: 547974

after gc: idd nodes used:5052, unused:63994948; list nodes free:276797091

before gc: list nodes free: 987703

after gc: idd nodes used:4922, unused:63995078; list nodes free:276797738

before gc: list nodes free: 298101

after gc: idd nodes used:5026, unused:63994974; list nodes free:276797176

before gc: list nodes free: 602673

after gc: idd nodes used:5061, unused:63994939; list nodes free:276797009

before gc: list nodes free: 708728

after gc: idd nodes used:5051, unused:63994949; list nodes free:276797044
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 6389312 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097868 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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.012sec

3109 3358 3304 3809 3623 3499 3740 3861 4009 3686 3846 3924 3878 4070 4027 4096 4176 4293 4242 4219 4256 4109 4110 4124 4069 4289 4267 4196 4144 4294 4278 4376 4404 4556 4561 4305 4463 4505 4323 4488 4482 4757 4710 4602 4565 4595 4574 4635 4357 4342 4356 4540 4457 4379 4360 4435 4510 4475 4594 4435 4482 4496 4543 4505 4345 4492 4520 4461 4473 4590 4599 4555 4575 4855 4781 4642 4750 4739 4554 4668 4631 4895 4764 4882 4906 4894 4893 4870 5038 4875 4792 4799 5034 5135 4872 4884 4993 4920 4934 4988 4938 4920 5042 5087 5067 4944 4925 5046 5056 4897 4925 5221 5547 5192 5294 5212 5294 5230 5290 5277 5498 5073 5122 5132 5097 5108 5104 5063 5018 5013 5085 5046 5168 5001 5043 5047 5114 5040 5013 5022 5192 5337 5049 5046 5119 5058 5068 5149 5379 5192 5222 5326 5272 5292 5260 5265 5175 5191 5245 5204 5192 5203 5194 5219 5428 5197 5200 5203 4957 5007 5056 4977 4998 5052 5063 5185 5003 5081 4977 5063 4990 5034 5045 5037 4985 5087 4984 5190 5091 5101 5057 5036 5073 5106 4918 4959 5088 4967 5020 5152 4935 5047 5133 5018

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="ShieldRVs-PT-050A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldRVs-PT-050A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r426-tajo-167905978500146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;