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.r425-tajo-167905977800130.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 ltsminxred
Input is ShieldRVs-PT-040A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.5K Feb 26 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 26 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:33 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.4K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 256K 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-040A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-040A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679298974885

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:56:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:56:16] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-20 07:56:16] [INFO ] Transformed 563 places.
[2023-03-20 07:56:16] [INFO ] Transformed 763 transitions.
[2023-03-20 07:56:16] [INFO ] Found NUPN structural information;
[2023-03-20 07:56:16] [INFO ] Parsed PT model containing 563 places and 763 transitions and 3680 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 221 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 44 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
// Phase 1: matrix 763 rows 563 cols
[2023-03-20 07:56:16] [INFO ] Computed 161 place invariants in 24 ms
[2023-03-20 07:56:17] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-20 07:56:17] [INFO ] Invariant cache hit.
[2023-03-20 07:56:18] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2023-03-20 07:56:18] [INFO ] Invariant cache hit.
[2023-03-20 07:56:18] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1979 ms. Remains : 563/563 places, 763/763 transitions.
Support contains 221 out of 563 places after structural reductions.
[2023-03-20 07:56:19] [INFO ] Flatten gal took : 255 ms
[2023-03-20 07:56:19] [INFO ] Flatten gal took : 123 ms
[2023-03-20 07:56:19] [INFO ] Input system was already deterministic with 763 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 849 ms. (steps per millisecond=11 ) properties (out of 88) seen :79
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) 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 7) 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 7) 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 6) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:56:21] [INFO ] Invariant cache hit.
[2023-03-20 07:56:21] [INFO ] [Real]Absence check using 161 positive place invariants in 40 ms returned sat
[2023-03-20 07:56:21] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:56:21] [INFO ] [Nat]Absence check using 161 positive place invariants in 36 ms returned sat
[2023-03-20 07:56:22] [INFO ] After 903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:56:23] [INFO ] Deduced a trap composed of 11 places in 229 ms of which 17 ms to minimize.
[2023-03-20 07:56:23] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2023-03-20 07:56:23] [INFO ] Deduced a trap composed of 8 places in 346 ms of which 27 ms to minimize.
[2023-03-20 07:56:24] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 0 ms to minimize.
[2023-03-20 07:56:24] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2023-03-20 07:56:24] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2023-03-20 07:56:25] [INFO ] Deduced a trap composed of 14 places in 378 ms of which 0 ms to minimize.
[2023-03-20 07:56:25] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 1 ms to minimize.
[2023-03-20 07:56:25] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 07:56:25] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-20 07:56:25] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 0 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 1 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 1 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2023-03-20 07:56:26] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2023-03-20 07:56:27] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-20 07:56:27] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-03-20 07:56:27] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:56:27] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2023-03-20 07:56:27] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2023-03-20 07:56:27] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:56:28] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-20 07:56:29] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 6994 ms
[2023-03-20 07:56:37] [INFO ] Deduced a trap composed of 9 places in 7218 ms of which 27 ms to minimize.
[2023-03-20 07:56:37] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-20 07:56:37] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-20 07:56:37] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 2 ms to minimize.
[2023-03-20 07:56:38] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-20 07:56:38] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-20 07:56:38] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2023-03-20 07:56:38] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 1 ms to minimize.
[2023-03-20 07:56:38] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2023-03-20 07:56:39] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 19 ms to minimize.
[2023-03-20 07:56:39] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2023-03-20 07:56:39] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 0 ms to minimize.
[2023-03-20 07:56:39] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2023-03-20 07:56:39] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2023-03-20 07:56:40] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 0 ms to minimize.
[2023-03-20 07:56:40] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-20 07:56:40] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-20 07:56:40] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2023-03-20 07:56:40] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-20 07:56:40] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-20 07:56:41] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2023-03-20 07:56:41] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2023-03-20 07:56:41] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-20 07:56:41] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-20 07:56:41] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-03-20 07:56:41] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 0 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 0 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-20 07:56:42] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 0 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2023-03-20 07:56:43] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-20 07:56:44] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2023-03-20 07:56:44] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2023-03-20 07:56:44] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 0 ms to minimize.
[2023-03-20 07:56:44] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 14347 ms
[2023-03-20 07:56:44] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-20 07:56:44] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-20 07:56:44] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-20 07:56:45] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-20 07:56:45] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-20 07:56:45] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-20 07:56:45] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 0 ms to minimize.
[2023-03-20 07:56:45] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 1 ms to minimize.
[2023-03-20 07:56:46] [INFO ] Deduced a trap composed of 11 places in 166 ms of which 0 ms to minimize.
[2023-03-20 07:56:46] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2023-03-20 07:56:46] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2023-03-20 07:56:46] [INFO ] Deduced a trap composed of 11 places in 108 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 07:56:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:56:46] [INFO ] After 25110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 385 ms.
Support contains 28 out of 563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 563/563 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 0 with 75 rules applied. Total rules applied 77 place count 562 transition count 762
Applied a total of 77 rules in 202 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 562/563 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 07:56:48] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 07:56:48] [INFO ] [Real]Absence check using 161 positive place invariants in 28 ms returned sat
[2023-03-20 07:56:48] [INFO ] After 699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:56:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 22 ms returned sat
[2023-03-20 07:56:49] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:56:49] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-20 07:56:49] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:56:50] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2023-03-20 07:56:50] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2023-03-20 07:56:50] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2023-03-20 07:56:50] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 0 ms to minimize.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 11 places in 4349 ms of which 27 ms to minimize.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 0 ms to minimize.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-20 07:56:55] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 0 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 13 ms to minimize.
[2023-03-20 07:56:56] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-20 07:56:57] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:56:58] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2023-03-20 07:56:59] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 0 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 0 ms to minimize.
[2023-03-20 07:57:00] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 0 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-20 07:57:01] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2023-03-20 07:57:02] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 07:57:03] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:57:04] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-20 07:57:05] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 0 ms to minimize.
[2023-03-20 07:57:06] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2023-03-20 07:57:07] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-20 07:57:07] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 0 ms to minimize.
[2023-03-20 07:57:07] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-20 07:57:07] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-20 07:57:07] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2023-03-20 07:57:08] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2023-03-20 07:57:08] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-20 07:57:08] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-20 07:57:08] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 0 ms to minimize.
[2023-03-20 07:57:08] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 0 ms to minimize.
[2023-03-20 07:57:08] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 1 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 1 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-20 07:57:09] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2023-03-20 07:57:10] [INFO ] Trap strengthening (SAT) tested/added 118/117 trap constraints in 21206 ms
[2023-03-20 07:57:11] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-20 07:57:11] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:57:11] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-20 07:57:11] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 0 ms to minimize.
[2023-03-20 07:57:11] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 1 ms to minimize.
[2023-03-20 07:57:11] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:57:12] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:57:12] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2023-03-20 07:57:12] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2023-03-20 07:57:12] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
[2023-03-20 07:57:12] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:57:13] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-20 07:57:13] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2023-03-20 07:57:13] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 ms to minimize.
[2023-03-20 07:57:13] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-20 07:57:13] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 1 ms to minimize.
[2023-03-20 07:57:13] [INFO ] Deduced a trap composed of 7 places in 148 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 07:57:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 07:57:13] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 116 ms.
Support contains 14 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 562 transition count 762
Applied a total of 3 rules in 79 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 07:57:14] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 07:57:14] [INFO ] [Real]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 07:57:15] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:57:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 07:57:15] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 07:57:16] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2023-03-20 07:57:16] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-20 07:57:16] [INFO ] Deduced a trap composed of 7 places in 188 ms of which 1 ms to minimize.
[2023-03-20 07:57:17] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-20 07:57:17] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2023-03-20 07:57:17] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-20 07:57:17] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-20 07:57:17] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2023-03-20 07:57:18] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 07:57:18] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2023-03-20 07:57:18] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:57:18] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:57:18] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2023-03-20 07:57:18] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 1 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2023-03-20 07:57:19] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 0 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-20 07:57:20] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 0 ms to minimize.
[2023-03-20 07:57:21] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 0 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2023-03-20 07:57:22] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:57:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 0 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-20 07:57:24] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:57:25] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 4 ms to minimize.
[2023-03-20 07:57:25] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2023-03-20 07:57:25] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-20 07:57:25] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2023-03-20 07:57:25] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-20 07:57:26] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 07:57:26] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:57:26] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:57:26] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-20 07:57:26] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2023-03-20 07:57:26] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 0 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 0 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-20 07:57:27] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2023-03-20 07:57:28] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:57:28] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 1 ms to minimize.
[2023-03-20 07:57:28] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-20 07:57:28] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-20 07:57:28] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-20 07:57:28] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 0 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2023-03-20 07:57:29] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 0 ms to minimize.
[2023-03-20 07:57:30] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-20 07:57:30] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:57:30] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:57:30] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2023-03-20 07:57:30] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2023-03-20 07:57:30] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 0 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 0 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2023-03-20 07:57:31] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 0 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 0 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 0 ms to minimize.
[2023-03-20 07:57:32] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 0 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 1 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 1 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2023-03-20 07:57:33] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 0 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 0 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 1 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:57:34] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 1 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 0 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 1 ms to minimize.
[2023-03-20 07:57:35] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2023-03-20 07:57:36] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 1 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 0 ms to minimize.
[2023-03-20 07:57:37] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 0 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 0 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2023-03-20 07:57:38] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2023-03-20 07:57:39] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 0 ms to minimize.
[2023-03-20 07:57:40] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 0 ms to minimize.
[2023-03-20 07:57:40] [INFO ] Trap strengthening (SAT) tested/added 150/150 trap constraints in 24188 ms
[2023-03-20 07:57:40] [INFO ] After 24828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 07:57:40] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 101 ms.
Support contains 10 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 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 562 transition count 762
Applied a total of 1 rules in 48 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 562/562 places, 762/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 431796 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{0=1}
Probabilistic random walk after 431796 steps, saw 381220 distinct states, run finished after 3002 ms. (steps per millisecond=143 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 762 rows 562 cols
[2023-03-20 07:57:43] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 07:57:43] [INFO ] [Real]Absence check using 161 positive place invariants in 27 ms returned sat
[2023-03-20 07:57:43] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:57:44] [INFO ] [Nat]Absence check using 161 positive place invariants in 28 ms returned sat
[2023-03-20 07:57:44] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:57:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:57:44] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:57:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-03-20 07:57:44] [INFO ] After 526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-20 07:57:44] [INFO ] After 747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 562 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 561 transition count 761
Applied a total of 3 rules in 79 ms. Remains 561 /562 variables (removed 1) and now considering 761/762 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 561/562 places, 761/762 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 436896 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 436896 steps, saw 361450 distinct states, run finished after 3004 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 761 rows 561 cols
[2023-03-20 07:57:47] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 07:57:47] [INFO ] [Real]Absence check using 161 positive place invariants in 22 ms returned sat
[2023-03-20 07:57:48] [INFO ] After 396ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:57:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2023-03-20 07:57:48] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:57:48] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-20 07:57:49] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-20 07:57:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1716 ms
[2023-03-20 07:57:50] [INFO ] After 2064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-20 07:57:50] [INFO ] After 2313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 22 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 561/561 places, 761/761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 20 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
[2023-03-20 07:57:50] [INFO ] Invariant cache hit.
[2023-03-20 07:57:50] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-20 07:57:50] [INFO ] Invariant cache hit.
[2023-03-20 07:57:51] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
[2023-03-20 07:57:51] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-20 07:57:51] [INFO ] Invariant cache hit.
[2023-03-20 07:57:52] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1615 ms. Remains : 561/561 places, 761/761 transitions.
Applied a total of 0 rules in 19 ms. Remains 561 /561 variables (removed 0) and now considering 761/761 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 07:57:52] [INFO ] Invariant cache hit.
[2023-03-20 07:57:52] [INFO ] [Real]Absence check using 161 positive place invariants in 27 ms returned sat
[2023-03-20 07:57:52] [INFO ] After 435ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:57:52] [INFO ] [Nat]Absence check using 161 positive place invariants in 25 ms returned sat
[2023-03-20 07:57:53] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-20 07:57:53] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-03-20 07:57:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 967 ms
[2023-03-20 07:57:54] [INFO ] After 1225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-20 07:57:54] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 67 ms
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 48 ms
[2023-03-20 07:57:54] [INFO ] Input system was already deterministic with 763 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 38 ms
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 38 ms
[2023-03-20 07:57:54] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 35 ms
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 37 ms
[2023-03-20 07:57:54] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 37 ms
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 37 ms
[2023-03-20 07:57:54] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 35 ms
[2023-03-20 07:57:54] [INFO ] Flatten gal took : 34 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 30 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 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 561 transition count 761
Applied a total of 2 rules in 34 ms. Remains 561 /563 variables (removed 2) and now considering 761/763 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 561/563 places, 761/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 24 ms
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 25 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 761 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 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 562 transition count 762
Applied a total of 2 rules in 27 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 26 ms
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:55] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 8 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:55] [INFO ] Flatten gal took : 26 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:56] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 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 562 transition count 762
Applied a total of 2 rules in 26 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 26 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:56] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 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 562 transition count 762
Applied a total of 2 rules in 24 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 26 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:56] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 763/763 transitions.
Applied a total of 0 rules in 7 ms. Remains 563 /563 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 563/563 places, 763/763 transitions.
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:56] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 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 562 transition count 762
Applied a total of 2 rules in 24 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 26 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:57:56] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 563/563 places, 763/763 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 562 transition count 762
Applied a total of 2 rules in 25 ms. Remains 562 /563 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 562/563 places, 762/763 transitions.
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 26 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:56] [INFO ] Input system was already deterministic with 762 transitions.
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 28 ms
[2023-03-20 07:57:56] [INFO ] Flatten gal took : 29 ms
[2023-03-20 07:57:56] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 07:57:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 563 places, 763 transitions and 3680 arcs took 4 ms.
Total runtime 100403 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1790/ctl_0_ --ctl=/tmp/1790/ctl_1_ --ctl=/tmp/1790/ctl_2_ --ctl=/tmp/1790/ctl_3_ --ctl=/tmp/1790/ctl_4_ --ctl=/tmp/1790/ctl_5_ --ctl=/tmp/1790/ctl_6_ --ctl=/tmp/1790/ctl_7_ --ctl=/tmp/1790/ctl_8_ --ctl=/tmp/1790/ctl_9_ --ctl=/tmp/1790/ctl_10_ --ctl=/tmp/1790/ctl_11_ --ctl=/tmp/1790/ctl_12_ --ctl=/tmp/1790/ctl_13_ --ctl=/tmp/1790/ctl_14_ --ctl=/tmp/1790/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 16017608 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097364 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
mcc2023

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-040A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-040A, 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 r425-tajo-167905977800130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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