fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903718000506
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10123.092 1739030.00 1841258.00 135.70 ?????T?????????? 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.r394-oct2-167903718000506.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPs-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679520385885

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=ShieldPPPs-PT-050B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 21:26:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 21:26:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:26:29] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2023-03-22 21:26:29] [INFO ] Transformed 3403 places.
[2023-03-22 21:26:29] [INFO ] Transformed 3153 transitions.
[2023-03-22 21:26:29] [INFO ] Found NUPN structural information;
[2023-03-22 21:26:29] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 832 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 141 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 3082 transition count 2832
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 3082 transition count 2832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 3081 transition count 2831
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 3081 transition count 2831
Applied a total of 644 rules in 1159 ms. Remains 3081 /3403 variables (removed 322) and now considering 2831/3153 (removed 322) transitions.
// Phase 1: matrix 2831 rows 3081 cols
[2023-03-22 21:26:31] [INFO ] Computed 551 place invariants in 75 ms
[2023-03-22 21:26:33] [INFO ] Implicit Places using invariants in 2385 ms returned []
[2023-03-22 21:26:33] [INFO ] Invariant cache hit.
[2023-03-22 21:26:39] [INFO ] Implicit Places using invariants and state equation in 6082 ms returned []
Implicit Place search using SMT with State Equation took 8527 ms to find 0 implicit places.
[2023-03-22 21:26:39] [INFO ] Invariant cache hit.
[2023-03-22 21:26:42] [INFO ] Dead Transitions using invariants and state equation in 2533 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3081/3403 places, 2831/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12231 ms. Remains : 3081/3403 places, 2831/3153 transitions.
Support contains 141 out of 3081 places after structural reductions.
[2023-03-22 21:26:42] [INFO ] Flatten gal took : 185 ms
[2023-03-22 21:26:42] [INFO ] Flatten gal took : 112 ms
[2023-03-22 21:26:43] [INFO ] Input system was already deterministic with 2831 transitions.
Support contains 128 out of 3081 places (down from 141) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=13 ) properties (out of 81) seen :49
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-22 21:26:44] [INFO ] Invariant cache hit.
[2023-03-22 21:26:47] [INFO ] [Real]Absence check using 551 positive place invariants in 536 ms returned sat
[2023-03-22 21:26:50] [INFO ] After 6445ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-22 21:26:53] [INFO ] [Nat]Absence check using 551 positive place invariants in 293 ms returned sat
[2023-03-22 21:27:03] [INFO ] After 8319ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :31
[2023-03-22 21:27:04] [INFO ] Deduced a trap composed of 19 places in 831 ms of which 6 ms to minimize.
[2023-03-22 21:27:05] [INFO ] Deduced a trap composed of 25 places in 1075 ms of which 3 ms to minimize.
[2023-03-22 21:27:06] [INFO ] Deduced a trap composed of 25 places in 837 ms of which 4 ms to minimize.
[2023-03-22 21:27:07] [INFO ] Deduced a trap composed of 25 places in 1508 ms of which 3 ms to minimize.
[2023-03-22 21:27:08] [INFO ] Deduced a trap composed of 20 places in 764 ms of which 2 ms to minimize.
[2023-03-22 21:27:09] [INFO ] Deduced a trap composed of 24 places in 757 ms of which 2 ms to minimize.
[2023-03-22 21:27:10] [INFO ] Deduced a trap composed of 24 places in 951 ms of which 5 ms to minimize.
[2023-03-22 21:27:11] [INFO ] Deduced a trap composed of 35 places in 682 ms of which 6 ms to minimize.
[2023-03-22 21:27:12] [INFO ] Deduced a trap composed of 22 places in 769 ms of which 1 ms to minimize.
[2023-03-22 21:27:13] [INFO ] Deduced a trap composed of 17 places in 1122 ms of which 2 ms to minimize.
[2023-03-22 21:27:14] [INFO ] Deduced a trap composed of 28 places in 620 ms of which 22 ms to minimize.
[2023-03-22 21:27:15] [INFO ] Deduced a trap composed of 27 places in 683 ms of which 1 ms to minimize.
[2023-03-22 21:27:15] [INFO ] Deduced a trap composed of 29 places in 641 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 21:27:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 21:27:15] [INFO ] After 25157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:32
Fused 32 Parikh solutions to 31 different solutions.
Parikh walk visited 0 properties in 6550 ms.
Support contains 55 out of 3081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Drop transitions removed 344 transitions
Trivial Post-agglo rules discarded 344 transitions
Performed 344 trivial Post agglomeration. Transition count delta: 344
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 3081 transition count 2487
Reduce places removed 344 places and 0 transitions.
Iterating post reduction 1 with 344 rules applied. Total rules applied 688 place count 2737 transition count 2487
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 246 Pre rules applied. Total rules applied 688 place count 2737 transition count 2241
Deduced a syphon composed of 246 places in 7 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 2 with 492 rules applied. Total rules applied 1180 place count 2491 transition count 2241
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1198 place count 2473 transition count 2223
Iterating global reduction 2 with 18 rules applied. Total rules applied 1216 place count 2473 transition count 2223
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1216 place count 2473 transition count 2213
Deduced a syphon composed of 10 places in 9 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1236 place count 2463 transition count 2213
Performed 866 Post agglomeration using F-continuation condition.Transition count delta: 866
Deduced a syphon composed of 866 places in 2 ms
Reduce places removed 866 places and 0 transitions.
Iterating global reduction 2 with 1732 rules applied. Total rules applied 2968 place count 1597 transition count 1347
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 431 times.
Drop transitions removed 431 transitions
Iterating global reduction 2 with 431 rules applied. Total rules applied 3399 place count 1597 transition count 1347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3400 place count 1596 transition count 1346
Applied a total of 3400 rules in 872 ms. Remains 1596 /3081 variables (removed 1485) and now considering 1346/2831 (removed 1485) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 872 ms. Remains : 1596/3081 places, 1346/2831 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 31) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1346 rows 1596 cols
[2023-03-22 21:27:24] [INFO ] Computed 551 place invariants in 61 ms
[2023-03-22 21:27:25] [INFO ] [Real]Absence check using 520 positive place invariants in 215 ms returned sat
[2023-03-22 21:27:25] [INFO ] [Real]Absence check using 520 positive and 31 generalized place invariants in 25 ms returned sat
[2023-03-22 21:27:25] [INFO ] After 665ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 21:27:25] [INFO ] [Nat]Absence check using 520 positive place invariants in 105 ms returned sat
[2023-03-22 21:27:25] [INFO ] [Nat]Absence check using 520 positive and 31 generalized place invariants in 7 ms returned sat
[2023-03-22 21:27:27] [INFO ] After 1340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 21:27:27] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2023-03-22 21:27:28] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-22 21:27:28] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 4 ms to minimize.
[2023-03-22 21:27:28] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-22 21:27:28] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:27:29] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2023-03-22 21:27:29] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2023-03-22 21:27:29] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 1 ms to minimize.
[2023-03-22 21:27:30] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 1 ms to minimize.
[2023-03-22 21:27:30] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 0 ms to minimize.
[2023-03-22 21:27:30] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 14 ms to minimize.
[2023-03-22 21:27:31] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-22 21:27:31] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2023-03-22 21:27:31] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-03-22 21:27:31] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2023-03-22 21:27:32] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2023-03-22 21:27:32] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 1 ms to minimize.
[2023-03-22 21:27:32] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2023-03-22 21:27:32] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2023-03-22 21:27:33] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:27:33] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 8 ms to minimize.
[2023-03-22 21:27:33] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 0 ms to minimize.
[2023-03-22 21:27:33] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 0 ms to minimize.
[2023-03-22 21:27:34] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-22 21:27:34] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-22 21:27:34] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 0 ms to minimize.
[2023-03-22 21:27:34] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 10 ms to minimize.
[2023-03-22 21:27:35] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-22 21:27:35] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 0 ms to minimize.
[2023-03-22 21:27:35] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 14 ms to minimize.
[2023-03-22 21:27:35] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-22 21:27:36] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2023-03-22 21:27:36] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2023-03-22 21:27:36] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 0 ms to minimize.
[2023-03-22 21:27:36] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-22 21:27:37] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 2 ms to minimize.
[2023-03-22 21:27:37] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:27:37] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 4 ms to minimize.
[2023-03-22 21:27:38] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 0 ms to minimize.
[2023-03-22 21:27:38] [INFO ] Deduced a trap composed of 31 places in 215 ms of which 0 ms to minimize.
[2023-03-22 21:27:38] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 1 ms to minimize.
[2023-03-22 21:27:39] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 1 ms to minimize.
[2023-03-22 21:27:39] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 2 ms to minimize.
[2023-03-22 21:27:39] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2023-03-22 21:27:39] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-22 21:27:40] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 0 ms to minimize.
[2023-03-22 21:27:40] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 1 ms to minimize.
[2023-03-22 21:27:40] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-22 21:27:40] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 13313 ms
[2023-03-22 21:27:41] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-22 21:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2023-03-22 21:27:41] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 1 ms to minimize.
[2023-03-22 21:27:41] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 5 ms to minimize.
[2023-03-22 21:27:42] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 4 ms to minimize.
[2023-03-22 21:27:42] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-22 21:27:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1047 ms
[2023-03-22 21:27:42] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 3 ms to minimize.
[2023-03-22 21:27:43] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 40 ms to minimize.
[2023-03-22 21:27:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2023-03-22 21:27:43] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 14 ms to minimize.
[2023-03-22 21:27:43] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-22 21:27:44] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 1 ms to minimize.
[2023-03-22 21:27:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 747 ms
[2023-03-22 21:27:44] [INFO ] After 18077ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 536 ms.
[2023-03-22 21:27:44] [INFO ] After 19490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 401 ms.
Support contains 12 out of 1596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1596/1596 places, 1346/1346 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1596 transition count 1345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1595 transition count 1345
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 1595 transition count 1341
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 1591 transition count 1341
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 58 place count 1567 transition count 1317
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 1567 transition count 1317
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 1563 transition count 1313
Applied a total of 71 rules in 254 ms. Remains 1563 /1596 variables (removed 33) and now considering 1313/1346 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 1563/1596 places, 1313/1346 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1313 rows 1563 cols
[2023-03-22 21:27:46] [INFO ] Computed 551 place invariants in 53 ms
[2023-03-22 21:27:46] [INFO ] [Real]Absence check using 516 positive place invariants in 194 ms returned sat
[2023-03-22 21:27:46] [INFO ] [Real]Absence check using 516 positive and 35 generalized place invariants in 19 ms returned sat
[2023-03-22 21:27:48] [INFO ] After 1988ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 21:27:48] [INFO ] [Nat]Absence check using 516 positive place invariants in 155 ms returned sat
[2023-03-22 21:27:48] [INFO ] [Nat]Absence check using 516 positive and 35 generalized place invariants in 24 ms returned sat
[2023-03-22 21:27:50] [INFO ] After 1118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 21:27:50] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-22 21:27:50] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-22 21:27:51] [INFO ] Deduced a trap composed of 9 places in 329 ms of which 1 ms to minimize.
[2023-03-22 21:27:51] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-22 21:27:51] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-22 21:27:51] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-22 21:27:52] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2023-03-22 21:27:52] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-22 21:27:52] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 0 ms to minimize.
[2023-03-22 21:27:53] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 1 ms to minimize.
[2023-03-22 21:27:53] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-22 21:27:53] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-22 21:27:53] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-22 21:27:54] [INFO ] Deduced a trap composed of 7 places in 314 ms of which 1 ms to minimize.
[2023-03-22 21:27:54] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-22 21:27:54] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-22 21:27:54] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2023-03-22 21:27:55] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2023-03-22 21:27:55] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2023-03-22 21:27:55] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 0 ms to minimize.
[2023-03-22 21:27:55] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-22 21:27:55] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-22 21:27:56] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-22 21:27:56] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2023-03-22 21:27:56] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-22 21:27:56] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2023-03-22 21:27:57] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-22 21:27:57] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:27:57] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 0 ms to minimize.
[2023-03-22 21:27:57] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-22 21:27:58] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2023-03-22 21:27:58] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2023-03-22 21:27:58] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-22 21:27:58] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-22 21:27:59] [INFO ] Deduced a trap composed of 9 places in 460 ms of which 1 ms to minimize.
[2023-03-22 21:27:59] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 21:27:59] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-22 21:28:00] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 1 ms to minimize.
[2023-03-22 21:28:00] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-22 21:28:00] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-22 21:28:01] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 1 ms to minimize.
[2023-03-22 21:28:01] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-22 21:28:01] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2023-03-22 21:28:01] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:28:02] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-22 21:28:02] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-22 21:28:02] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-22 21:28:02] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-22 21:28:02] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-22 21:28:03] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2023-03-22 21:28:03] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-22 21:28:03] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-22 21:28:03] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-22 21:28:04] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-22 21:28:04] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2023-03-22 21:28:04] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 0 ms to minimize.
[2023-03-22 21:28:04] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-22 21:28:04] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 0 ms to minimize.
[2023-03-22 21:28:05] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 1 ms to minimize.
[2023-03-22 21:28:05] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 1 ms to minimize.
[2023-03-22 21:28:05] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 0 ms to minimize.
[2023-03-22 21:28:06] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 0 ms to minimize.
[2023-03-22 21:28:06] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-22 21:28:06] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-22 21:28:06] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-22 21:28:07] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2023-03-22 21:28:07] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-22 21:28:07] [INFO ] Trap strengthening (SAT) tested/added 68/67 trap constraints in 17376 ms
[2023-03-22 21:28:07] [INFO ] After 19013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 364 ms.
[2023-03-22 21:28:08] [INFO ] After 20019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 186 ms.
Support contains 5 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1313/1313 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1563 transition count 1311
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1561 transition count 1311
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 1557 transition count 1307
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 1557 transition count 1307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 1555 transition count 1305
Applied a total of 17 rules in 245 ms. Remains 1555 /1563 variables (removed 8) and now considering 1305/1313 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 1555/1563 places, 1305/1313 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 78028 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{0=1, 1=1, 2=1}
Probabilistic random walk after 78028 steps, saw 71783 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 1305 rows 1555 cols
[2023-03-22 21:28:12] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-22 21:28:12] [INFO ] [Real]Absence check using 518 positive place invariants in 94 ms returned sat
[2023-03-22 21:28:12] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 13 ms returned sat
[2023-03-22 21:28:13] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:28:13] [INFO ] [Nat]Absence check using 518 positive place invariants in 144 ms returned sat
[2023-03-22 21:28:13] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 15 ms returned sat
[2023-03-22 21:28:15] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:28:15] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2023-03-22 21:28:15] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 15 ms to minimize.
[2023-03-22 21:28:16] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2023-03-22 21:28:16] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2023-03-22 21:28:16] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-22 21:28:16] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2023-03-22 21:28:17] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-22 21:28:17] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 1 ms to minimize.
[2023-03-22 21:28:17] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-22 21:28:17] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-22 21:28:18] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2023-03-22 21:28:18] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-22 21:28:18] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 0 ms to minimize.
[2023-03-22 21:28:18] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 1 ms to minimize.
[2023-03-22 21:28:19] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-22 21:28:19] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2023-03-22 21:28:19] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 1 ms to minimize.
[2023-03-22 21:28:19] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-22 21:28:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-22 21:28:20] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2023-03-22 21:28:20] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2023-03-22 21:28:20] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 0 ms to minimize.
[2023-03-22 21:28:20] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 21:28:21] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-22 21:28:21] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-22 21:28:21] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2023-03-22 21:28:21] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-22 21:28:21] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2023-03-22 21:28:21] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2023-03-22 21:28:22] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2023-03-22 21:28:22] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7157 ms
[2023-03-22 21:28:22] [INFO ] After 8276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-22 21:28:22] [INFO ] After 8889ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 1555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1555/1555 places, 1305/1305 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1555 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1554 transition count 1304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1554 transition count 1303
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1553 transition count 1303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 1551 transition count 1301
Applied a total of 9 rules in 189 ms. Remains 1551 /1555 variables (removed 4) and now considering 1301/1305 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1551/1555 places, 1301/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 146296 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146296 steps, saw 137664 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-22 21:28:25] [INFO ] Computed 551 place invariants in 23 ms
[2023-03-22 21:28:26] [INFO ] [Real]Absence check using 524 positive place invariants in 129 ms returned sat
[2023-03-22 21:28:26] [INFO ] [Real]Absence check using 524 positive and 27 generalized place invariants in 6 ms returned sat
[2023-03-22 21:28:27] [INFO ] After 1309ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:28:27] [INFO ] [Nat]Absence check using 524 positive place invariants in 136 ms returned sat
[2023-03-22 21:28:27] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 23 ms returned sat
[2023-03-22 21:28:28] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:28:28] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2023-03-22 21:28:29] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2023-03-22 21:28:29] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2023-03-22 21:28:29] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2023-03-22 21:28:29] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2023-03-22 21:28:30] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2023-03-22 21:28:30] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2023-03-22 21:28:30] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-22 21:28:30] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2023-03-22 21:28:30] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-22 21:28:31] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2023-03-22 21:28:31] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2023-03-22 21:28:31] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 0 ms to minimize.
[2023-03-22 21:28:31] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-22 21:28:32] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2023-03-22 21:28:32] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-22 21:28:32] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2023-03-22 21:28:33] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 0 ms to minimize.
[2023-03-22 21:28:33] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-22 21:28:33] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-22 21:28:33] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2023-03-22 21:28:34] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 14 ms to minimize.
[2023-03-22 21:28:34] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-22 21:28:34] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 1 ms to minimize.
[2023-03-22 21:28:34] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-03-22 21:28:35] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 0 ms to minimize.
[2023-03-22 21:28:35] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-22 21:28:35] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-22 21:28:35] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-22 21:28:36] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 0 ms to minimize.
[2023-03-22 21:28:36] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 26 ms to minimize.
[2023-03-22 21:28:36] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2023-03-22 21:28:37] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-22 21:28:37] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2023-03-22 21:28:37] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2023-03-22 21:28:37] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 9093 ms
[2023-03-22 21:28:37] [INFO ] After 10085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-22 21:28:37] [INFO ] After 10598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 49 ms.
Support contains 1 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 64 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 72 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-22 21:28:38] [INFO ] Invariant cache hit.
[2023-03-22 21:28:39] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2023-03-22 21:28:39] [INFO ] Invariant cache hit.
[2023-03-22 21:28:41] [INFO ] Implicit Places using invariants and state equation in 2796 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2023-03-22 21:28:41] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-22 21:28:41] [INFO ] Invariant cache hit.
[2023-03-22 21:28:42] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5042 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-22 21:28:43] [INFO ] Flatten gal took : 112 ms
[2023-03-22 21:28:43] [INFO ] Flatten gal took : 82 ms
[2023-03-22 21:28:43] [INFO ] Input system was already deterministic with 2831 transitions.
Computed a total of 619 stabilizing places and 619 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 3080 transition count 2482
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 2732 transition count 2482
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 696 place count 2732 transition count 2232
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1196 place count 2482 transition count 2232
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1223 place count 2455 transition count 2205
Iterating global reduction 2 with 27 rules applied. Total rules applied 1250 place count 2455 transition count 2205
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1250 place count 2455 transition count 2193
Deduced a syphon composed of 12 places in 7 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1274 place count 2443 transition count 2193
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Deduced a syphon composed of 880 places in 3 ms
Reduce places removed 880 places and 0 transitions.
Iterating global reduction 2 with 1760 rules applied. Total rules applied 3034 place count 1563 transition count 1313
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3036 place count 1561 transition count 1311
Applied a total of 3036 rules in 880 ms. Remains 1561 /3081 variables (removed 1520) and now considering 1311/2831 (removed 1520) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 880 ms. Remains : 1561/3081 places, 1311/2831 transitions.
[2023-03-22 21:28:44] [INFO ] Flatten gal took : 41 ms
[2023-03-22 21:28:44] [INFO ] Flatten gal took : 43 ms
[2023-03-22 21:28:44] [INFO ] Input system was already deterministic with 1311 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 702 place count 2729 transition count 2230
Deduced a syphon composed of 249 places in 5 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 1200 place count 2480 transition count 2230
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 1227 place count 2453 transition count 2203
Iterating global reduction 2 with 27 rules applied. Total rules applied 1254 place count 2453 transition count 2203
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1254 place count 2453 transition count 2191
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1278 place count 2441 transition count 2191
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 2 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 2 with 1772 rules applied. Total rules applied 3050 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3052 place count 1553 transition count 1303
Applied a total of 3052 rules in 688 ms. Remains 1553 /3081 variables (removed 1528) and now considering 1303/2831 (removed 1528) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 689 ms. Remains : 1553/3081 places, 1303/2831 transitions.
[2023-03-22 21:28:45] [INFO ] Flatten gal took : 38 ms
[2023-03-22 21:28:45] [INFO ] Flatten gal took : 41 ms
[2023-03-22 21:28:45] [INFO ] Input system was already deterministic with 1303 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1230 place count 2451 transition count 2201
Iterating global reduction 2 with 28 rules applied. Total rules applied 1258 place count 2451 transition count 2201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1258 place count 2451 transition count 2189
Deduced a syphon composed of 12 places in 6 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1282 place count 2439 transition count 2189
Performed 885 Post agglomeration using F-continuation condition.Transition count delta: 885
Deduced a syphon composed of 885 places in 2 ms
Reduce places removed 885 places and 0 transitions.
Iterating global reduction 2 with 1770 rules applied. Total rules applied 3052 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3054 place count 1552 transition count 1302
Applied a total of 3054 rules in 642 ms. Remains 1552 /3081 variables (removed 1529) and now considering 1302/2831 (removed 1529) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 642 ms. Remains : 1552/3081 places, 1302/2831 transitions.
[2023-03-22 21:28:46] [INFO ] Flatten gal took : 38 ms
[2023-03-22 21:28:46] [INFO ] Flatten gal took : 40 ms
[2023-03-22 21:28:46] [INFO ] Input system was already deterministic with 1302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3057 transition count 2807
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3057 transition count 2807
Applied a total of 48 rules in 447 ms. Remains 3057 /3081 variables (removed 24) and now considering 2807/2831 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 3057/3081 places, 2807/2831 transitions.
[2023-03-22 21:28:46] [INFO ] Flatten gal took : 69 ms
[2023-03-22 21:28:46] [INFO ] Flatten gal took : 105 ms
[2023-03-22 21:28:47] [INFO ] Input system was already deterministic with 2807 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2729 transition count 2228
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2478 transition count 2228
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1232 place count 2450 transition count 2200
Iterating global reduction 2 with 28 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Deduced a syphon composed of 880 places in 3 ms
Reduce places removed 880 places and 0 transitions.
Iterating global reduction 2 with 1760 rules applied. Total rules applied 3046 place count 1557 transition count 1307
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3048 place count 1555 transition count 1305
Applied a total of 3048 rules in 691 ms. Remains 1555 /3081 variables (removed 1526) and now considering 1305/2831 (removed 1526) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 691 ms. Remains : 1555/3081 places, 1305/2831 transitions.
[2023-03-22 21:28:47] [INFO ] Flatten gal took : 37 ms
[2023-03-22 21:28:47] [INFO ] Flatten gal took : 41 ms
[2023-03-22 21:28:47] [INFO ] Input system was already deterministic with 1305 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2729 transition count 2228
Deduced a syphon composed of 251 places in 7 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2478 transition count 2228
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1233 place count 2449 transition count 2199
Iterating global reduction 2 with 29 rules applied. Total rules applied 1262 place count 2449 transition count 2199
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1262 place count 2449 transition count 2186
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1288 place count 2436 transition count 2186
Performed 883 Post agglomeration using F-continuation condition.Transition count delta: 883
Deduced a syphon composed of 883 places in 3 ms
Reduce places removed 883 places and 0 transitions.
Iterating global reduction 2 with 1766 rules applied. Total rules applied 3054 place count 1553 transition count 1303
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3056 place count 1551 transition count 1301
Applied a total of 3056 rules in 684 ms. Remains 1551 /3081 variables (removed 1530) and now considering 1301/2831 (removed 1530) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 684 ms. Remains : 1551/3081 places, 1301/2831 transitions.
[2023-03-22 21:28:48] [INFO ] Flatten gal took : 33 ms
[2023-03-22 21:28:48] [INFO ] Flatten gal took : 36 ms
[2023-03-22 21:28:48] [INFO ] Input system was already deterministic with 1301 transitions.
Finished random walk after 1373 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=98 )
FORMULA ShieldPPPs-PT-050B-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 476 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2023-03-22 21:28:49] [INFO ] Flatten gal took : 66 ms
[2023-03-22 21:28:49] [INFO ] Flatten gal took : 72 ms
[2023-03-22 21:28:49] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3055 transition count 2805
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3055 transition count 2805
Applied a total of 52 rules in 436 ms. Remains 3055 /3081 variables (removed 26) and now considering 2805/2831 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 3055/3081 places, 2805/2831 transitions.
[2023-03-22 21:28:50] [INFO ] Flatten gal took : 62 ms
[2023-03-22 21:28:50] [INFO ] Flatten gal took : 70 ms
[2023-03-22 21:28:50] [INFO ] Input system was already deterministic with 2805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3054 transition count 2804
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3054 transition count 2804
Applied a total of 54 rules in 419 ms. Remains 3054 /3081 variables (removed 27) and now considering 2804/2831 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 3054/3081 places, 2804/2831 transitions.
[2023-03-22 21:28:50] [INFO ] Flatten gal took : 67 ms
[2023-03-22 21:28:50] [INFO ] Flatten gal took : 71 ms
[2023-03-22 21:28:51] [INFO ] Input system was already deterministic with 2804 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 702 place count 2729 transition count 2228
Deduced a syphon composed of 251 places in 5 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1204 place count 2478 transition count 2228
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 1232 place count 2450 transition count 2200
Iterating global reduction 2 with 28 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 879 Post agglomeration using F-continuation condition.Transition count delta: 879
Deduced a syphon composed of 879 places in 2 ms
Reduce places removed 879 places and 0 transitions.
Iterating global reduction 2 with 1758 rules applied. Total rules applied 3044 place count 1558 transition count 1308
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3046 place count 1556 transition count 1306
Applied a total of 3046 rules in 657 ms. Remains 1556 /3081 variables (removed 1525) and now considering 1306/2831 (removed 1525) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 658 ms. Remains : 1556/3081 places, 1306/2831 transitions.
[2023-03-22 21:28:51] [INFO ] Flatten gal took : 33 ms
[2023-03-22 21:28:51] [INFO ] Flatten gal took : 36 ms
[2023-03-22 21:28:51] [INFO ] Input system was already deterministic with 1306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1231 place count 2450 transition count 2200
Iterating global reduction 2 with 29 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 6 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 880 Post agglomeration using F-continuation condition.Transition count delta: 880
Deduced a syphon composed of 880 places in 2 ms
Reduce places removed 880 places and 0 transitions.
Iterating global reduction 2 with 1760 rules applied. Total rules applied 3046 place count 1557 transition count 1307
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3048 place count 1555 transition count 1305
Applied a total of 3048 rules in 608 ms. Remains 1555 /3081 variables (removed 1526) and now considering 1305/2831 (removed 1526) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 609 ms. Remains : 1555/3081 places, 1305/2831 transitions.
[2023-03-22 21:28:52] [INFO ] Flatten gal took : 33 ms
[2023-03-22 21:28:52] [INFO ] Flatten gal took : 36 ms
[2023-03-22 21:28:52] [INFO ] Input system was already deterministic with 1305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 445 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2023-03-22 21:28:53] [INFO ] Flatten gal took : 61 ms
[2023-03-22 21:28:53] [INFO ] Flatten gal took : 71 ms
[2023-03-22 21:28:53] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3080 transition count 2480
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2730 transition count 2480
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 700 place count 2730 transition count 2229
Deduced a syphon composed of 251 places in 9 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1228 place count 2453 transition count 2203
Iterating global reduction 2 with 26 rules applied. Total rules applied 1254 place count 2453 transition count 2203
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1254 place count 2453 transition count 2192
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1276 place count 2442 transition count 2192
Performed 876 Post agglomeration using F-continuation condition.Transition count delta: 876
Deduced a syphon composed of 876 places in 3 ms
Reduce places removed 876 places and 0 transitions.
Iterating global reduction 2 with 1752 rules applied. Total rules applied 3028 place count 1566 transition count 1316
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3030 place count 1564 transition count 1314
Applied a total of 3030 rules in 818 ms. Remains 1564 /3081 variables (removed 1517) and now considering 1314/2831 (removed 1517) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 818 ms. Remains : 1564/3081 places, 1314/2831 transitions.
[2023-03-22 21:28:54] [INFO ] Flatten gal took : 51 ms
[2023-03-22 21:28:54] [INFO ] Flatten gal took : 53 ms
[2023-03-22 21:28:54] [INFO ] Input system was already deterministic with 1314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 436 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2023-03-22 21:28:54] [INFO ] Flatten gal took : 61 ms
[2023-03-22 21:28:55] [INFO ] Flatten gal took : 67 ms
[2023-03-22 21:28:55] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1231 place count 2450 transition count 2200
Iterating global reduction 2 with 29 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2187
Deduced a syphon composed of 13 places in 5 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1286 place count 2437 transition count 2187
Performed 883 Post agglomeration using F-continuation condition.Transition count delta: 883
Deduced a syphon composed of 883 places in 2 ms
Reduce places removed 883 places and 0 transitions.
Iterating global reduction 2 with 1766 rules applied. Total rules applied 3052 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3054 place count 1552 transition count 1302
Applied a total of 3054 rules in 683 ms. Remains 1552 /3081 variables (removed 1529) and now considering 1302/2831 (removed 1529) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 683 ms. Remains : 1552/3081 places, 1302/2831 transitions.
[2023-03-22 21:28:55] [INFO ] Flatten gal took : 33 ms
[2023-03-22 21:28:55] [INFO ] Flatten gal took : 36 ms
[2023-03-22 21:28:55] [INFO ] Input system was already deterministic with 1302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3057 transition count 2807
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3057 transition count 2807
Applied a total of 48 rules in 411 ms. Remains 3057 /3081 variables (removed 24) and now considering 2807/2831 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 3057/3081 places, 2807/2831 transitions.
[2023-03-22 21:28:56] [INFO ] Flatten gal took : 59 ms
[2023-03-22 21:28:56] [INFO ] Flatten gal took : 66 ms
[2023-03-22 21:28:56] [INFO ] Input system was already deterministic with 2807 transitions.
[2023-03-22 21:28:56] [INFO ] Flatten gal took : 62 ms
[2023-03-22 21:28:56] [INFO ] Flatten gal took : 65 ms
[2023-03-22 21:28:56] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 21:28:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3081 places, 2831 transitions and 8062 arcs took 10 ms.
Total runtime 147931 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: 3081 NrTr: 2831 NrArc: 8062)

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

net check time: 0m 0.004sec

init dd package: 0m 2.970sec


before gc: list nodes free: 893852

after gc: idd nodes used:50624180, unused:13375820; list nodes free:57785255

RS generation: 25m53.082sec


-> last computed set: #nodes 50621101 (5.1e+07) #states 137,243,446,493,201 (14)


CANNOT_COMPUTE


BK_STOP 1679522124915

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.027sec

idd.cc:820: DD Exception: No free nodes

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050B"
export BK_EXAMINATION="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 ShieldPPPs-PT-050B, 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 r394-oct2-167903718000506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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