About the Execution of Marcie+red for Peterson-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7862.596 | 3600000.00 | 3646282.00 | 8991.70 | ???????????T??TT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r266-smll-167863541100570.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Peterson-COL-4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541100570
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-CTLFireability-00
FORMULA_NAME Peterson-COL-4-CTLFireability-01
FORMULA_NAME Peterson-COL-4-CTLFireability-02
FORMULA_NAME Peterson-COL-4-CTLFireability-03
FORMULA_NAME Peterson-COL-4-CTLFireability-04
FORMULA_NAME Peterson-COL-4-CTLFireability-05
FORMULA_NAME Peterson-COL-4-CTLFireability-06
FORMULA_NAME Peterson-COL-4-CTLFireability-07
FORMULA_NAME Peterson-COL-4-CTLFireability-08
FORMULA_NAME Peterson-COL-4-CTLFireability-09
FORMULA_NAME Peterson-COL-4-CTLFireability-10
FORMULA_NAME Peterson-COL-4-CTLFireability-11
FORMULA_NAME Peterson-COL-4-CTLFireability-12
FORMULA_NAME Peterson-COL-4-CTLFireability-13
FORMULA_NAME Peterson-COL-4-CTLFireability-14
FORMULA_NAME Peterson-COL-4-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679150927974
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=Peterson-COL-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 14:48:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 14:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:48:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 14:48:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 14:48:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1019 ms
[2023-03-18 14:48:52] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
[2023-03-18 14:48:52] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2023-03-18 14:48:52] [INFO ] Skeletonized 9 HLPN properties in 2 ms. Removed 7 properties that had guard overlaps.
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 219 steps, including 0 resets, run visited all 9 properties in 25 ms. (steps per millisecond=8 )
[2023-03-18 14:48:52] [INFO ] Flatten gal took : 26 ms
[2023-03-18 14:48:52] [INFO ] Flatten gal took : 5 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-18 14:48:52] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 61 ms.
[2023-03-18 14:48:52] [INFO ] Unfolded 16 HLPN properties in 4 ms.
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 40 transitions.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 37 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 14:48:52] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 14:48:52] [INFO ] Computed 19 place invariants in 44 ms
[2023-03-18 14:48:53] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-18 14:48:53] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 14:48:53] [INFO ] Invariant cache hit.
[2023-03-18 14:48:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 14:48:54] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
[2023-03-18 14:48:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 14:48:54] [INFO ] Invariant cache hit.
[2023-03-18 14:48:54] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2158 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2023-03-18 14:48:55] [INFO ] Flatten gal took : 147 ms
[2023-03-18 14:48:55] [INFO ] Flatten gal took : 97 ms
[2023-03-18 14:48:56] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 36) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 14:48:57] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 14:48:57] [INFO ] Invariant cache hit.
[2023-03-18 14:48:57] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2023-03-18 14:48:57] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-18 14:48:58] [INFO ] After 720ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-18 14:48:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 14:48:58] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-18 14:48:59] [INFO ] After 1148ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-18 14:48:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 14:49:00] [INFO ] After 966ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-18 14:49:01] [INFO ] Deduced a trap composed of 36 places in 420 ms of which 11 ms to minimize.
[2023-03-18 14:49:01] [INFO ] Deduced a trap composed of 27 places in 398 ms of which 2 ms to minimize.
[2023-03-18 14:49:02] [INFO ] Deduced a trap composed of 79 places in 360 ms of which 2 ms to minimize.
[2023-03-18 14:49:02] [INFO ] Deduced a trap composed of 86 places in 348 ms of which 3 ms to minimize.
[2023-03-18 14:49:02] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 1 ms to minimize.
[2023-03-18 14:49:03] [INFO ] Deduced a trap composed of 96 places in 306 ms of which 1 ms to minimize.
[2023-03-18 14:49:03] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 2 ms to minimize.
[2023-03-18 14:49:03] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 1 ms to minimize.
[2023-03-18 14:49:04] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 2 ms to minimize.
[2023-03-18 14:49:04] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 1 ms to minimize.
[2023-03-18 14:49:04] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2023-03-18 14:49:04] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 3 ms to minimize.
[2023-03-18 14:49:04] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2023-03-18 14:49:05] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 1 ms to minimize.
[2023-03-18 14:49:05] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 1 ms to minimize.
[2023-03-18 14:49:05] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4446 ms
[2023-03-18 14:49:06] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 1 ms to minimize.
[2023-03-18 14:49:06] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 2 ms to minimize.
[2023-03-18 14:49:06] [INFO ] Deduced a trap composed of 75 places in 293 ms of which 1 ms to minimize.
[2023-03-18 14:49:07] [INFO ] Deduced a trap composed of 62 places in 332 ms of which 1 ms to minimize.
[2023-03-18 14:49:07] [INFO ] Deduced a trap composed of 64 places in 374 ms of which 1 ms to minimize.
[2023-03-18 14:49:08] [INFO ] Deduced a trap composed of 65 places in 372 ms of which 1 ms to minimize.
[2023-03-18 14:49:08] [INFO ] Deduced a trap composed of 79 places in 387 ms of which 2 ms to minimize.
[2023-03-18 14:49:08] [INFO ] Deduced a trap composed of 70 places in 326 ms of which 1 ms to minimize.
[2023-03-18 14:49:09] [INFO ] Deduced a trap composed of 96 places in 341 ms of which 1 ms to minimize.
[2023-03-18 14:49:09] [INFO ] Deduced a trap composed of 12 places in 346 ms of which 1 ms to minimize.
[2023-03-18 14:49:10] [INFO ] Deduced a trap composed of 62 places in 288 ms of which 1 ms to minimize.
[2023-03-18 14:49:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4327 ms
[2023-03-18 14:49:10] [INFO ] Deduced a trap composed of 147 places in 396 ms of which 1 ms to minimize.
[2023-03-18 14:49:11] [INFO ] Deduced a trap composed of 31 places in 318 ms of which 1 ms to minimize.
[2023-03-18 14:49:11] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 1 ms to minimize.
[2023-03-18 14:49:12] [INFO ] Deduced a trap composed of 99 places in 364 ms of which 1 ms to minimize.
[2023-03-18 14:49:12] [INFO ] Deduced a trap composed of 49 places in 390 ms of which 1 ms to minimize.
[2023-03-18 14:49:12] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 1 ms to minimize.
[2023-03-18 14:49:13] [INFO ] Deduced a trap composed of 10 places in 395 ms of which 1 ms to minimize.
[2023-03-18 14:49:13] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 1 ms to minimize.
[2023-03-18 14:49:14] [INFO ] Deduced a trap composed of 14 places in 386 ms of which 3 ms to minimize.
[2023-03-18 14:49:14] [INFO ] Deduced a trap composed of 80 places in 377 ms of which 1 ms to minimize.
[2023-03-18 14:49:15] [INFO ] Deduced a trap composed of 96 places in 281 ms of which 3 ms to minimize.
[2023-03-18 14:49:15] [INFO ] Deduced a trap composed of 96 places in 263 ms of which 1 ms to minimize.
[2023-03-18 14:49:15] [INFO ] Deduced a trap composed of 111 places in 192 ms of which 1 ms to minimize.
[2023-03-18 14:49:15] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 2 ms to minimize.
[2023-03-18 14:49:16] [INFO ] Deduced a trap composed of 69 places in 279 ms of which 1 ms to minimize.
[2023-03-18 14:49:16] [INFO ] Deduced a trap composed of 92 places in 282 ms of which 1 ms to minimize.
[2023-03-18 14:49:16] [INFO ] Deduced a trap composed of 14 places in 315 ms of which 1 ms to minimize.
[2023-03-18 14:49:17] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 1 ms to minimize.
[2023-03-18 14:49:17] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 1 ms to minimize.
[2023-03-18 14:49:18] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 2 ms to minimize.
[2023-03-18 14:49:18] [INFO ] Deduced a trap composed of 143 places in 233 ms of which 6 ms to minimize.
[2023-03-18 14:49:18] [INFO ] Deduced a trap composed of 140 places in 226 ms of which 2 ms to minimize.
[2023-03-18 14:49:18] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8495 ms
[2023-03-18 14:49:19] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 1 ms to minimize.
[2023-03-18 14:49:19] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 1 ms to minimize.
[2023-03-18 14:49:20] [INFO ] Deduced a trap composed of 95 places in 307 ms of which 2 ms to minimize.
[2023-03-18 14:49:20] [INFO ] Deduced a trap composed of 55 places in 282 ms of which 1 ms to minimize.
[2023-03-18 14:49:20] [INFO ] Deduced a trap composed of 73 places in 319 ms of which 1 ms to minimize.
[2023-03-18 14:49:21] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2023-03-18 14:49:21] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 1 ms to minimize.
[2023-03-18 14:49:21] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 0 ms to minimize.
[2023-03-18 14:49:22] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 6 ms to minimize.
[2023-03-18 14:49:22] [INFO ] Deduced a trap composed of 81 places in 206 ms of which 1 ms to minimize.
[2023-03-18 14:49:22] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 0 ms to minimize.
[2023-03-18 14:49:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3572 ms
[2023-03-18 14:49:22] [INFO ] After 22912ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:692)
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-18 14:49:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 14:49:23] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 113 ms.
Support contains 235 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 480 transition count 674
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 464 transition count 674
Applied a total of 32 rules in 98 ms. Remains 464 /480 variables (removed 16) and now considering 674/690 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 464/480 places, 674/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 410262 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{0=1, 2=1, 4=1}
Probabilistic random walk after 410262 steps, saw 90276 distinct states, run finished after 3002 ms. (steps per millisecond=136 ) properties seen :3
Running SMT prover for 2 properties.
[2023-03-18 14:49:27] [INFO ] Flow matrix only has 614 transitions (discarded 60 similar events)
// Phase 1: matrix 614 rows 464 cols
[2023-03-18 14:49:27] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-18 14:49:27] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-18 14:49:27] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-18 14:49:28] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 14:49:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 23 ms returned sat
[2023-03-18 14:49:28] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2023-03-18 14:49:29] [INFO ] After 882ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 14:49:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 14:49:30] [INFO ] After 575ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 14:49:31] [INFO ] Deduced a trap composed of 16 places in 361 ms of which 1 ms to minimize.
[2023-03-18 14:49:31] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 1 ms to minimize.
[2023-03-18 14:49:31] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 1 ms to minimize.
[2023-03-18 14:49:32] [INFO ] Deduced a trap composed of 61 places in 324 ms of which 2 ms to minimize.
[2023-03-18 14:49:32] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2023-03-18 14:49:32] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 2 ms to minimize.
[2023-03-18 14:49:33] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 3 ms to minimize.
[2023-03-18 14:49:33] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 4 ms to minimize.
[2023-03-18 14:49:34] [INFO ] Deduced a trap composed of 84 places in 295 ms of which 0 ms to minimize.
[2023-03-18 14:49:34] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 1 ms to minimize.
[2023-03-18 14:49:34] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 1 ms to minimize.
[2023-03-18 14:49:34] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 1 ms to minimize.
[2023-03-18 14:49:35] [INFO ] Deduced a trap composed of 63 places in 245 ms of which 1 ms to minimize.
[2023-03-18 14:49:35] [INFO ] Deduced a trap composed of 62 places in 236 ms of which 1 ms to minimize.
[2023-03-18 14:49:35] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 1 ms to minimize.
[2023-03-18 14:49:36] [INFO ] Deduced a trap composed of 35 places in 333 ms of which 1 ms to minimize.
[2023-03-18 14:49:36] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 1 ms to minimize.
[2023-03-18 14:49:36] [INFO ] Deduced a trap composed of 94 places in 302 ms of which 1 ms to minimize.
[2023-03-18 14:49:37] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2023-03-18 14:49:37] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 0 ms to minimize.
[2023-03-18 14:49:37] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 6972 ms
[2023-03-18 14:49:38] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 2 ms to minimize.
[2023-03-18 14:49:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2023-03-18 14:49:38] [INFO ] After 8681ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 584 ms.
[2023-03-18 14:49:38] [INFO ] After 10363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 120 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 674/674 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 464 transition count 578
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 368 transition count 578
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 192 place count 368 transition count 489
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 370 place count 279 transition count 489
Applied a total of 370 rules in 77 ms. Remains 279 /464 variables (removed 185) and now considering 489/674 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 279/464 places, 489/674 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 485502 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485502 steps, saw 82925 distinct states, run finished after 3002 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 14:49:42] [INFO ] Flow matrix only has 429 transitions (discarded 60 similar events)
// Phase 1: matrix 429 rows 279 cols
[2023-03-18 14:49:42] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 14:49:42] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 14:49:42] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-18 14:49:42] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 14:49:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-18 14:49:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-18 14:49:43] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 14:49:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 14:49:44] [INFO ] After 501ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 14:49:44] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2023-03-18 14:49:44] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2023-03-18 14:49:45] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2023-03-18 14:49:45] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 1 ms to minimize.
[2023-03-18 14:49:45] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2023-03-18 14:49:45] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 0 ms to minimize.
[2023-03-18 14:49:46] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2023-03-18 14:49:46] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 1 ms to minimize.
[2023-03-18 14:49:46] [INFO ] Deduced a trap composed of 21 places in 184 ms of which 1 ms to minimize.
[2023-03-18 14:49:46] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2023-03-18 14:49:46] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 1 ms to minimize.
[2023-03-18 14:49:47] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 1 ms to minimize.
[2023-03-18 14:49:47] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-18 14:49:47] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-18 14:49:47] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2023-03-18 14:49:48] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2023-03-18 14:49:48] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2023-03-18 14:49:48] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2023-03-18 14:49:48] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 0 ms to minimize.
[2023-03-18 14:49:48] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2023-03-18 14:49:49] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 0 ms to minimize.
[2023-03-18 14:49:49] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 1 ms to minimize.
[2023-03-18 14:49:49] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2023-03-18 14:49:49] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2023-03-18 14:49:49] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 1 ms to minimize.
[2023-03-18 14:49:50] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 1 ms to minimize.
[2023-03-18 14:49:50] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 1 ms to minimize.
[2023-03-18 14:49:50] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5650 ms
[2023-03-18 14:49:50] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 0 ms to minimize.
[2023-03-18 14:49:50] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2023-03-18 14:49:50] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2023-03-18 14:49:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 523 ms
[2023-03-18 14:49:50] [INFO ] After 7173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 512 ms.
[2023-03-18 14:49:51] [INFO ] After 8484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 120 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 489/489 transitions.
Applied a total of 0 rules in 35 ms. Remains 279 /279 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 279/279 places, 489/489 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 489/489 transitions.
Applied a total of 0 rules in 29 ms. Remains 279 /279 variables (removed 0) and now considering 489/489 (removed 0) transitions.
[2023-03-18 14:49:51] [INFO ] Flow matrix only has 429 transitions (discarded 60 similar events)
[2023-03-18 14:49:51] [INFO ] Invariant cache hit.
[2023-03-18 14:49:51] [INFO ] Implicit Places using invariants in 224 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 228 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 274/279 places, 489/489 transitions.
Applied a total of 0 rules in 27 ms. Remains 274 /274 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 284 ms. Remains : 274/279 places, 489/489 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 541080 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 541080 steps, saw 92269 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 14:49:55] [INFO ] Flow matrix only has 429 transitions (discarded 60 similar events)
// Phase 1: matrix 429 rows 274 cols
[2023-03-18 14:49:55] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 14:49:55] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 14:49:55] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 14:49:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 14:49:55] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 14:49:55] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 14:49:56] [INFO ] After 386ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 14:49:56] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 0 ms to minimize.
[2023-03-18 14:49:56] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 1 ms to minimize.
[2023-03-18 14:49:57] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 1 ms to minimize.
[2023-03-18 14:49:57] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2023-03-18 14:49:57] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 1 ms to minimize.
[2023-03-18 14:49:57] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 1 ms to minimize.
[2023-03-18 14:49:58] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 1 ms to minimize.
[2023-03-18 14:49:58] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 1 ms to minimize.
[2023-03-18 14:49:58] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 0 ms to minimize.
[2023-03-18 14:49:58] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 1 ms to minimize.
[2023-03-18 14:49:58] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 1 ms to minimize.
[2023-03-18 14:49:59] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2023-03-18 14:49:59] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 1 ms to minimize.
[2023-03-18 14:49:59] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2023-03-18 14:49:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3021 ms
[2023-03-18 14:49:59] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 1 ms to minimize.
[2023-03-18 14:49:59] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2023-03-18 14:50:00] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2023-03-18 14:50:00] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 1 ms to minimize.
[2023-03-18 14:50:00] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 1 ms to minimize.
[2023-03-18 14:50:00] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-18 14:50:01] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2023-03-18 14:50:01] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2023-03-18 14:50:01] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2023-03-18 14:50:01] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-18 14:50:01] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2023-03-18 14:50:02] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2023-03-18 14:50:02] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-18 14:50:02] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2023-03-18 14:50:02] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2023-03-18 14:50:02] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
[2023-03-18 14:50:03] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 1 ms to minimize.
[2023-03-18 14:50:03] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2023-03-18 14:50:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3865 ms
[2023-03-18 14:50:03] [INFO ] After 7658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 533 ms.
[2023-03-18 14:50:03] [INFO ] After 8763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 120 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 489/489 transitions.
Applied a total of 0 rules in 21 ms. Remains 274 /274 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 274/274 places, 489/489 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 489/489 transitions.
Applied a total of 0 rules in 20 ms. Remains 274 /274 variables (removed 0) and now considering 489/489 (removed 0) transitions.
[2023-03-18 14:50:04] [INFO ] Flow matrix only has 429 transitions (discarded 60 similar events)
[2023-03-18 14:50:04] [INFO ] Invariant cache hit.
[2023-03-18 14:50:04] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-18 14:50:04] [INFO ] Flow matrix only has 429 transitions (discarded 60 similar events)
[2023-03-18 14:50:04] [INFO ] Invariant cache hit.
[2023-03-18 14:50:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 14:50:04] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-18 14:50:04] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-18 14:50:04] [INFO ] Flow matrix only has 429 transitions (discarded 60 similar events)
[2023-03-18 14:50:04] [INFO ] Invariant cache hit.
[2023-03-18 14:50:05] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1559 ms. Remains : 274/274 places, 489/489 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 274 transition count 429
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 269 transition count 464
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 269 transition count 460
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 89 place count 269 transition count 445
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 104 place count 254 transition count 445
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 254 transition count 445
Applied a total of 114 rules in 84 ms. Remains 254 /274 variables (removed 20) and now considering 445/489 (removed 44) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 445 rows 254 cols
[2023-03-18 14:50:05] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-18 14:50:05] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2023-03-18 14:50:06] [INFO ] After 879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 14:50:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 14:50:07] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 14:50:08] [INFO ] After 1271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 478 ms.
[2023-03-18 14:50:08] [INFO ] After 1874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA Peterson-COL-4-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 14:50:08] [INFO ] Flatten gal took : 88 ms
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 129 ms
[2023-03-18 14:50:09] [INFO ] Input system was already deterministic with 690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 31 ms
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 34 ms
[2023-03-18 14:50:09] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 2 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 27 ms
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 31 ms
[2023-03-18 14:50:09] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 22 ms
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 25 ms
[2023-03-18 14:50:09] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 21 ms
[2023-03-18 14:50:09] [INFO ] Flatten gal took : 24 ms
[2023-03-18 14:50:09] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 480 transition count 493
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 283 transition count 493
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 394 place count 283 transition count 405
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 580 place count 190 transition count 400
Applied a total of 580 rules in 38 ms. Remains 190 /480 variables (removed 290) and now considering 400/690 (removed 290) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 190/480 places, 400/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 16 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 15 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 480 transition count 626
Reduce places removed 64 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 80 rules applied. Total rules applied 144 place count 416 transition count 610
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 160 place count 400 transition count 610
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 160 place count 400 transition count 525
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 330 place count 315 transition count 525
Applied a total of 330 rules in 32 ms. Remains 315 /480 variables (removed 165) and now considering 525/690 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 315/480 places, 525/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 17 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 21 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 23 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 19 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 22 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 9 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 19 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 21 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 23 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 19 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 22 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 23 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 165/480 places, 375/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 11 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 16 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 375 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=87 )
FORMULA Peterson-COL-4-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 20 ms
[2023-03-18 14:50:10] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 480/480 places, 690/690 transitions.
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 19 ms
[2023-03-18 14:50:10] [INFO ] Flatten gal took : 22 ms
[2023-03-18 14:50:11] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 22 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 165/480 places, 375/690 transitions.
[2023-03-18 14:50:11] [INFO ] Flatten gal took : 11 ms
[2023-03-18 14:50:11] [INFO ] Flatten gal took : 12 ms
[2023-03-18 14:50:11] [INFO ] Input system was already deterministic with 375 transitions.
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
FORMULA Peterson-COL-4-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-18 14:50:11] [INFO ] Flatten gal took : 43 ms
[2023-03-18 14:50:11] [INFO ] Flatten gal took : 41 ms
[2023-03-18 14:50:11] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 35 ms.
[2023-03-18 14:50:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 5 ms.
Total runtime 80596 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: 480 NrTr: 690 NrArc: 2120)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.064sec
net check time: 0m 0.000sec
init dd package: 0m 3.604sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8278628 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092704 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.002sec
89548 239690 468110 514269 622728 730304 903442 1076659 1118056 1284660 1329043 1473765 1531944 1504308 1559327
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="Peterson-COL-4"
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 Peterson-COL-4, 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 r266-smll-167863541100570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 '
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 ;