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.r458-smll-167912650600697.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is StigmergyElection-PT-11a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650600697
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 153M 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 StigmergyElection-PT-11a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679613473874

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 23:17:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 23:17:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 23:18:03] [INFO ] Load time of PNML (sax parser for PT used): 6652 ms
[2023-03-23 23:18:04] [INFO ] Transformed 156 places.
[2023-03-23 23:18:04] [INFO ] Transformed 136650 transitions.
[2023-03-23 23:18:04] [INFO ] Found NUPN structural information;
[2023-03-23 23:18:04] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 7815 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyElection-PT-11a-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 151 transition count 4299
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 151 transition count 4299
Applied a total of 10 rules in 94 ms. Remains 151 /156 variables (removed 5) and now considering 4299/4305 (removed 6) transitions.
[2023-03-23 23:18:06] [INFO ] Flow matrix only has 4271 transitions (discarded 28 similar events)
// Phase 1: matrix 4271 rows 151 cols
[2023-03-23 23:18:06] [INFO ] Computed 8 place invariants in 104 ms
[2023-03-23 23:18:07] [INFO ] Implicit Places using invariants in 1427 ms returned []
[2023-03-23 23:18:07] [INFO ] Flow matrix only has 4271 transitions (discarded 28 similar events)
[2023-03-23 23:18:07] [INFO ] Invariant cache hit.
[2023-03-23 23:18:09] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2023-03-23 23:18:09] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 3886 ms to find 0 implicit places.
[2023-03-23 23:18:09] [INFO ] Flow matrix only has 4271 transitions (discarded 28 similar events)
[2023-03-23 23:18:09] [INFO ] Invariant cache hit.
[2023-03-23 23:18:13] [INFO ] Dead Transitions using invariants and state equation in 3326 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/156 places, 4299/4305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7315 ms. Remains : 151/156 places, 4299/4305 transitions.
Support contains 80 out of 151 places after structural reductions.
[2023-03-23 23:18:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 23:18:14] [INFO ] Flatten gal took : 663 ms
FORMULA StigmergyElection-PT-11a-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 23:18:14] [INFO ] Flatten gal took : 498 ms
[2023-03-23 23:18:15] [INFO ] Input system was already deterministic with 4299 transitions.
Support contains 69 out of 151 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 4249 ms. (steps per millisecond=2 ) properties (out of 53) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-23 23:18:20] [INFO ] Flow matrix only has 4271 transitions (discarded 28 similar events)
[2023-03-23 23:18:20] [INFO ] Invariant cache hit.
[2023-03-23 23:18:21] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 23:18:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-23 23:18:24] [INFO ] After 2608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-23 23:18:25] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2023-03-23 23:18:27] [INFO ] After 2701ms SMT Verify possible using 4148 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-23 23:18:30] [INFO ] Deduced a trap composed of 12 places in 2452 ms of which 5 ms to minimize.
[2023-03-23 23:18:32] [INFO ] Deduced a trap composed of 13 places in 1855 ms of which 5 ms to minimize.
[2023-03-23 23:18:34] [INFO ] Deduced a trap composed of 12 places in 1660 ms of which 4 ms to minimize.
[2023-03-23 23:18:35] [INFO ] Deduced a trap composed of 12 places in 1641 ms of which 2 ms to minimize.
[2023-03-23 23:18:37] [INFO ] Deduced a trap composed of 12 places in 1257 ms of which 2 ms to minimize.
[2023-03-23 23:18:38] [INFO ] Deduced a trap composed of 12 places in 932 ms of which 1 ms to minimize.
[2023-03-23 23:18:39] [INFO ] Deduced a trap composed of 12 places in 649 ms of which 1 ms to minimize.
[2023-03-23 23:18:40] [INFO ] Deduced a trap composed of 12 places in 796 ms of which 1 ms to minimize.
[2023-03-23 23:18:41] [INFO ] Deduced a trap composed of 12 places in 724 ms of which 1 ms to minimize.
[2023-03-23 23:18:41] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 1 ms to minimize.
[2023-03-23 23:18:42] [INFO ] Deduced a trap composed of 12 places in 562 ms of which 1 ms to minimize.
[2023-03-23 23:18:42] [INFO ] Deduced a trap composed of 12 places in 382 ms of which 1 ms to minimize.
[2023-03-23 23:18:43] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 1 ms to minimize.
[2023-03-23 23:18:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 15519 ms
[2023-03-23 23:18:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 15522 ms
[2023-03-23 23:18:43] [INFO ] Deduced a trap composed of 13 places in 450 ms of which 2 ms to minimize.
[2023-03-23 23:18:44] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 1 ms to minimize.
[2023-03-23 23:18:45] [INFO ] Deduced a trap composed of 12 places in 423 ms of which 1 ms to minimize.
[2023-03-23 23:18:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1777 ms
[2023-03-23 23:18:45] [INFO ] Deduced a trap composed of 12 places in 390 ms of which 1 ms to minimize.
[2023-03-23 23:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 697 ms
[2023-03-23 23:18:46] [INFO ] Deduced a trap composed of 12 places in 405 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-23 23:18:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:18:46] [INFO ] After 25364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 21 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Graph (complete) has 583 edges and 151 vertex of which 148 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.53 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 148 transition count 4253
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 74 place count 135 transition count 4236
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 131 transition count 4234
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 83 place count 129 transition count 4233
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 83 place count 129 transition count 4216
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 117 place count 112 transition count 4216
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 133 place count 96 transition count 4199
Iterating global reduction 4 with 16 rules applied. Total rules applied 149 place count 96 transition count 4199
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 150 place count 96 transition count 4198
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 152 place count 95 transition count 4197
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 166 place count 81 transition count 4181
Iterating global reduction 6 with 14 rules applied. Total rules applied 180 place count 81 transition count 4181
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 214 place count 81 transition count 4147
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 216 place count 79 transition count 4145
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 79 transition count 4145
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 7 with 96 rules applied. Total rules applied 314 place count 79 transition count 4049
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 332 place count 70 transition count 4040
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 339 place count 63 transition count 4033
Iterating global reduction 8 with 7 rules applied. Total rules applied 346 place count 63 transition count 4033
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 354 place count 63 transition count 4025
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 358 place count 61 transition count 4023
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 361 place count 61 transition count 4023
Applied a total of 361 rules in 9618 ms. Remains 61 /151 variables (removed 90) and now considering 4023/4299 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9621 ms. Remains : 61/151 places, 4023/4299 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 5932 ms. (steps per millisecond=1 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 4023 rows 61 cols
[2023-03-23 23:19:02] [INFO ] Computed 9 place invariants in 29 ms
[2023-03-23 23:19:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-23 23:19:02] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-23 23:19:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-23 23:19:05] [INFO ] After 2287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 23:19:05] [INFO ] State equation strengthened by 3995 read => feed constraints.
[2023-03-23 23:19:08] [INFO ] After 2522ms SMT Verify possible using 3995 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-23 23:19:11] [INFO ] Deduced a trap composed of 7 places in 2566 ms of which 2 ms to minimize.
[2023-03-23 23:19:13] [INFO ] Deduced a trap composed of 6 places in 2352 ms of which 1 ms to minimize.
[2023-03-23 23:19:15] [INFO ] Deduced a trap composed of 7 places in 1657 ms of which 1 ms to minimize.
[2023-03-23 23:19:17] [INFO ] Deduced a trap composed of 6 places in 1758 ms of which 0 ms to minimize.
[2023-03-23 23:19:18] [INFO ] Deduced a trap composed of 6 places in 1377 ms of which 1 ms to minimize.
[2023-03-23 23:19:20] [INFO ] Deduced a trap composed of 4 places in 1572 ms of which 2 ms to minimize.
[2023-03-23 23:19:22] [INFO ] Deduced a trap composed of 4 places in 1443 ms of which 1 ms to minimize.
[2023-03-23 23:19:23] [INFO ] Deduced a trap composed of 5 places in 1153 ms of which 1 ms to minimize.
[2023-03-23 23:19:24] [INFO ] Deduced a trap composed of 4 places in 1299 ms of which 1 ms to minimize.
[2023-03-23 23:19:25] [INFO ] Deduced a trap composed of 5 places in 865 ms of which 1 ms to minimize.
[2023-03-23 23:19:26] [INFO ] Deduced a trap composed of 9 places in 930 ms of which 1 ms to minimize.
[2023-03-23 23:19:28] [INFO ] Deduced a trap composed of 4 places in 1391 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-23 23:19:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:19:28] [INFO ] After 25598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 124 ms.
Support contains 18 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 4023/4023 transitions.
Graph (complete) has 332 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 60 transition count 4020
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 58 transition count 4020
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 10 place count 56 transition count 4018
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 54 transition count 4016
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 54 transition count 4016
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 2 with 384 rules applied. Total rules applied 398 place count 54 transition count 3632
Applied a total of 398 rules in 2916 ms. Remains 54 /61 variables (removed 7) and now considering 3632/4023 (removed 391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2916 ms. Remains : 54/61 places, 3632/4023 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5623 ms. (steps per millisecond=1 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 3632 rows 54 cols
[2023-03-23 23:19:37] [INFO ] Computed 9 place invariants in 35 ms
[2023-03-23 23:19:37] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-23 23:19:37] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 23:19:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-23 23:19:39] [INFO ] After 2002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 23:19:40] [INFO ] State equation strengthened by 3609 read => feed constraints.
[2023-03-23 23:19:42] [INFO ] After 2081ms SMT Verify possible using 3609 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-23 23:19:45] [INFO ] Deduced a trap composed of 7 places in 2415 ms of which 1 ms to minimize.
[2023-03-23 23:19:47] [INFO ] Deduced a trap composed of 5 places in 1862 ms of which 1 ms to minimize.
[2023-03-23 23:19:48] [INFO ] Deduced a trap composed of 4 places in 1335 ms of which 2 ms to minimize.
[2023-03-23 23:19:49] [INFO ] Deduced a trap composed of 7 places in 1028 ms of which 10 ms to minimize.
[2023-03-23 23:19:51] [INFO ] Deduced a trap composed of 5 places in 1445 ms of which 1 ms to minimize.
[2023-03-23 23:19:52] [INFO ] Deduced a trap composed of 6 places in 1342 ms of which 1 ms to minimize.
[2023-03-23 23:19:54] [INFO ] Deduced a trap composed of 7 places in 1408 ms of which 0 ms to minimize.
[2023-03-23 23:19:55] [INFO ] Deduced a trap composed of 4 places in 1025 ms of which 1 ms to minimize.
[2023-03-23 23:19:56] [INFO ] Deduced a trap composed of 4 places in 897 ms of which 1 ms to minimize.
[2023-03-23 23:19:57] [INFO ] Deduced a trap composed of 4 places in 861 ms of which 1 ms to minimize.
[2023-03-23 23:19:58] [INFO ] Deduced a trap composed of 4 places in 680 ms of which 1 ms to minimize.
[2023-03-23 23:19:59] [INFO ] Deduced a trap composed of 4 places in 761 ms of which 0 ms to minimize.
[2023-03-23 23:19:59] [INFO ] Deduced a trap composed of 4 places in 557 ms of which 1 ms to minimize.
[2023-03-23 23:20:00] [INFO ] Deduced a trap composed of 4 places in 865 ms of which 0 ms to minimize.
[2023-03-23 23:20:01] [INFO ] Deduced a trap composed of 4 places in 894 ms of which 1 ms to minimize.
[2023-03-23 23:20:02] [INFO ] Deduced a trap composed of 4 places in 728 ms of which 2 ms to minimize.
[2023-03-23 23:20:05] [INFO ] Deduced a trap composed of 4 places in 2766 ms of which 3 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-23 23:20:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 23:20:05] [INFO ] After 27816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 4 properties in 84 ms.
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 3632/3632 transitions.
Graph (complete) has 301 edges and 54 vertex of which 51 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 5 place count 51 transition count 3628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 50 transition count 3628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 50 transition count 3627
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 8 place count 49 transition count 3627
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 45 transition count 3623
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 45 transition count 3623
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 45 transition count 3622
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 42 transition count 3619
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 40 transition count 3617
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 40 transition count 3617
Ensure Unique test removed 511 transitions
Reduce isomorphic transitions removed 511 transitions.
Iterating post reduction 3 with 511 rules applied. Total rules applied 538 place count 40 transition count 3106
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 540 place count 40 transition count 3104
Applied a total of 540 rules in 3665 ms. Remains 40 /54 variables (removed 14) and now considering 3104/3632 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3669 ms. Remains : 40/54 places, 3104/3632 transitions.
[2023-03-23 23:20:09] [INFO ] Flatten gal took : 477 ms
[2023-03-23 23:20:10] [INFO ] Flatten gal took : 332 ms
[2023-03-23 23:20:10] [INFO ] Input system was already deterministic with 4299 transitions.
Computed a total of 24 stabilizing places and 23 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 135 transition count 4273
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 135 transition count 4273
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 126 transition count 4255
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 126 transition count 4255
Applied a total of 50 rules in 64 ms. Remains 126 /151 variables (removed 25) and now considering 4255/4299 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 126/151 places, 4255/4299 transitions.
[2023-03-23 23:20:11] [INFO ] Flatten gal took : 284 ms
[2023-03-23 23:20:11] [INFO ] Flatten gal took : 291 ms
[2023-03-23 23:20:12] [INFO ] Input system was already deterministic with 4255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 135 transition count 4273
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 135 transition count 4273
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 127 transition count 4257
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 127 transition count 4257
Applied a total of 48 rules in 51 ms. Remains 127 /151 variables (removed 24) and now considering 4257/4299 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 127/151 places, 4257/4299 transitions.
[2023-03-23 23:20:12] [INFO ] Flatten gal took : 262 ms
[2023-03-23 23:20:12] [INFO ] Flatten gal took : 289 ms
[2023-03-23 23:20:13] [INFO ] Input system was already deterministic with 4257 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 149 transition count 4257
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 108 transition count 4256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 107 transition count 4256
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 85 place count 107 transition count 4236
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 125 place count 87 transition count 4236
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 140 place count 72 transition count 4212
Iterating global reduction 3 with 15 rules applied. Total rules applied 155 place count 72 transition count 4212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 72 transition count 4211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 162 place count 66 transition count 4199
Iterating global reduction 4 with 6 rules applied. Total rules applied 168 place count 66 transition count 4199
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 230 place count 66 transition count 4137
Drop transitions removed 3997 transitions
Redundant transition composition rules discarded 3997 transitions
Iterating global reduction 5 with 3997 rules applied. Total rules applied 4227 place count 66 transition count 140
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 4249 place count 55 transition count 129
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4259 place count 45 transition count 119
Applied a total of 4259 rules in 2350 ms. Remains 45 /151 variables (removed 106) and now considering 119/4299 (removed 4180) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2351 ms. Remains : 45/151 places, 119/4299 transitions.
[2023-03-23 23:20:15] [INFO ] Flatten gal took : 7 ms
[2023-03-23 23:20:15] [INFO ] Flatten gal took : 8 ms
[2023-03-23 23:20:15] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 149 transition count 4256
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 107 transition count 4256
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 85 place count 107 transition count 4234
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 129 place count 85 transition count 4234
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 142 place count 72 transition count 4212
Iterating global reduction 2 with 13 rules applied. Total rules applied 155 place count 72 transition count 4212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 72 transition count 4211
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 164 place count 64 transition count 4195
Iterating global reduction 3 with 8 rules applied. Total rules applied 172 place count 64 transition count 4195
Ensure Unique test removed 510 transitions
Reduce isomorphic transitions removed 510 transitions.
Iterating post reduction 3 with 510 rules applied. Total rules applied 682 place count 64 transition count 3685
Drop transitions removed 3563 transitions
Redundant transition composition rules discarded 3563 transitions
Iterating global reduction 4 with 3563 rules applied. Total rules applied 4245 place count 64 transition count 122
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 4267 place count 53 transition count 111
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 4269 place count 53 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4270 place count 53 transition count 110
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4271 place count 53 transition count 109
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 4282 place count 42 transition count 98
Applied a total of 4282 rules in 1523 ms. Remains 42 /151 variables (removed 109) and now considering 98/4299 (removed 4201) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1523 ms. Remains : 42/151 places, 98/4299 transitions.
[2023-03-23 23:20:17] [INFO ] Flatten gal took : 8 ms
[2023-03-23 23:20:17] [INFO ] Flatten gal took : 8 ms
[2023-03-23 23:20:17] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 139 transition count 4279
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 139 transition count 4279
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 132 transition count 4265
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 132 transition count 4265
Applied a total of 38 rules in 75 ms. Remains 132 /151 variables (removed 19) and now considering 4265/4299 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 132/151 places, 4265/4299 transitions.
[2023-03-23 23:20:17] [INFO ] Flatten gal took : 304 ms
[2023-03-23 23:20:18] [INFO ] Flatten gal took : 287 ms
[2023-03-23 23:20:18] [INFO ] Input system was already deterministic with 4265 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 149 transition count 4263
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 114 transition count 4261
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 112 transition count 4261
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 75 place count 112 transition count 4242
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 113 place count 93 transition count 4242
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 129 place count 77 transition count 4216
Iterating global reduction 3 with 16 rules applied. Total rules applied 145 place count 77 transition count 4216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 77 transition count 4215
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 153 place count 70 transition count 4201
Iterating global reduction 4 with 7 rules applied. Total rules applied 160 place count 70 transition count 4201
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 4 with 126 rules applied. Total rules applied 286 place count 70 transition count 4075
Drop transitions removed 3853 transitions
Redundant transition composition rules discarded 3853 transitions
Iterating global reduction 5 with 3853 rules applied. Total rules applied 4139 place count 70 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 4140 place count 70 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4141 place count 69 transition count 221
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 4161 place count 59 transition count 211
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 4162 place count 59 transition count 211
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 4163 place count 59 transition count 210
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 4173 place count 49 transition count 200
Applied a total of 4173 rules in 2224 ms. Remains 49 /151 variables (removed 102) and now considering 200/4299 (removed 4099) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2225 ms. Remains : 49/151 places, 200/4299 transitions.
[2023-03-23 23:20:21] [INFO ] Flatten gal took : 22 ms
[2023-03-23 23:20:21] [INFO ] Flatten gal took : 24 ms
[2023-03-23 23:20:21] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 135 transition count 4273
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 135 transition count 4273
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 126 transition count 4255
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 126 transition count 4255
Applied a total of 50 rules in 82 ms. Remains 126 /151 variables (removed 25) and now considering 4255/4299 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 126/151 places, 4255/4299 transitions.
[2023-03-23 23:20:21] [INFO ] Flatten gal took : 442 ms
[2023-03-23 23:20:22] [INFO ] Flatten gal took : 483 ms
[2023-03-23 23:20:22] [INFO ] Input system was already deterministic with 4255 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 149 transition count 4254
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 105 transition count 4254
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 89 place count 105 transition count 4232
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 133 place count 83 transition count 4232
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 149 place count 67 transition count 4206
Iterating global reduction 2 with 16 rules applied. Total rules applied 165 place count 67 transition count 4206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 67 transition count 4205
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 175 place count 58 transition count 4187
Iterating global reduction 3 with 9 rules applied. Total rules applied 184 place count 58 transition count 4187
Ensure Unique test removed 1022 transitions
Reduce isomorphic transitions removed 1022 transitions.
Iterating post reduction 3 with 1022 rules applied. Total rules applied 1206 place count 58 transition count 3165
Drop transitions removed 3035 transitions
Redundant transition composition rules discarded 3035 transitions
Iterating global reduction 4 with 3035 rules applied. Total rules applied 4241 place count 58 transition count 130
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 4263 place count 47 transition count 119
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 4274 place count 36 transition count 108
Applied a total of 4274 rules in 1067 ms. Remains 36 /151 variables (removed 115) and now considering 108/4299 (removed 4191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1067 ms. Remains : 36/151 places, 108/4299 transitions.
[2023-03-23 23:20:23] [INFO ] Flatten gal took : 6 ms
[2023-03-23 23:20:23] [INFO ] Flatten gal took : 6 ms
[2023-03-23 23:20:23] [INFO ] Input system was already deterministic with 108 transitions.
Finished random walk after 88 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
FORMULA StigmergyElection-PT-11a-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 135 transition count 4272
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 135 transition count 4272
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 126 transition count 4254
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 126 transition count 4254
Applied a total of 50 rules in 48 ms. Remains 126 /151 variables (removed 25) and now considering 4254/4299 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 126/151 places, 4254/4299 transitions.
[2023-03-23 23:20:24] [INFO ] Flatten gal took : 253 ms
[2023-03-23 23:20:24] [INFO ] Flatten gal took : 284 ms
[2023-03-23 23:20:25] [INFO ] Input system was already deterministic with 4254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 138 transition count 4278
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 138 transition count 4278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 132 transition count 4266
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 132 transition count 4266
Applied a total of 38 rules in 48 ms. Remains 132 /151 variables (removed 19) and now considering 4266/4299 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 132/151 places, 4266/4299 transitions.
[2023-03-23 23:20:25] [INFO ] Flatten gal took : 392 ms
[2023-03-23 23:20:25] [INFO ] Flatten gal took : 354 ms
[2023-03-23 23:20:26] [INFO ] Input system was already deterministic with 4266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 137 transition count 4274
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 137 transition count 4274
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 128 transition count 4256
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 128 transition count 4256
Applied a total of 46 rules in 48 ms. Remains 128 /151 variables (removed 23) and now considering 4256/4299 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 128/151 places, 4256/4299 transitions.
[2023-03-23 23:20:26] [INFO ] Flatten gal took : 255 ms
[2023-03-23 23:20:27] [INFO ] Flatten gal took : 286 ms
[2023-03-23 23:20:27] [INFO ] Input system was already deterministic with 4256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 134 transition count 4271
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 134 transition count 4271
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 125 transition count 4253
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 125 transition count 4253
Applied a total of 52 rules in 48 ms. Remains 125 /151 variables (removed 26) and now considering 4253/4299 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 125/151 places, 4253/4299 transitions.
[2023-03-23 23:20:28] [INFO ] Flatten gal took : 252 ms
[2023-03-23 23:20:28] [INFO ] Flatten gal took : 282 ms
[2023-03-23 23:20:29] [INFO ] Input system was already deterministic with 4253 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 149 transition count 4256
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 107 transition count 4255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 106 transition count 4255
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 87 place count 106 transition count 4234
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 129 place count 85 transition count 4234
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 146 place count 68 transition count 4206
Iterating global reduction 3 with 17 rules applied. Total rules applied 163 place count 68 transition count 4206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 68 transition count 4205
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 174 place count 58 transition count 4185
Iterating global reduction 4 with 10 rules applied. Total rules applied 184 place count 58 transition count 4185
Ensure Unique test removed 1022 transitions
Reduce isomorphic transitions removed 1022 transitions.
Iterating post reduction 4 with 1022 rules applied. Total rules applied 1206 place count 58 transition count 3163
Drop transitions removed 3051 transitions
Redundant transition composition rules discarded 3051 transitions
Iterating global reduction 5 with 3051 rules applied. Total rules applied 4257 place count 58 transition count 112
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 4279 place count 47 transition count 101
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4289 place count 37 transition count 91
Applied a total of 4289 rules in 1232 ms. Remains 37 /151 variables (removed 114) and now considering 91/4299 (removed 4208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1232 ms. Remains : 37/151 places, 91/4299 transitions.
[2023-03-23 23:20:30] [INFO ] Flatten gal took : 5 ms
[2023-03-23 23:20:30] [INFO ] Flatten gal took : 5 ms
[2023-03-23 23:20:30] [INFO ] Input system was already deterministic with 91 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
FORMULA StigmergyElection-PT-11a-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 4299/4299 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 134 transition count 4271
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 134 transition count 4271
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 124 transition count 4251
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 124 transition count 4251
Applied a total of 54 rules in 48 ms. Remains 124 /151 variables (removed 27) and now considering 4251/4299 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 124/151 places, 4251/4299 transitions.
[2023-03-23 23:20:30] [INFO ] Flatten gal took : 253 ms
[2023-03-23 23:20:30] [INFO ] Flatten gal took : 284 ms
[2023-03-23 23:20:31] [INFO ] Input system was already deterministic with 4251 transitions.
[2023-03-23 23:20:31] [INFO ] Flatten gal took : 283 ms
[2023-03-23 23:20:32] [INFO ] Flatten gal took : 285 ms
[2023-03-23 23:20:32] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2023-03-23 23:20:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 4299 transitions and 90817 arcs took 80 ms.
Total runtime 155199 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 151 NrTr: 4299 NrArc: 90817)

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

net check time: 0m 0.017sec

init dd package: 0m 3.292sec


RS generation: 3m25.607sec


-> reachability set: #nodes 475296 (4.8e+05) #states 53,199,618 (7)



starting MCC model checker
--------------------------

checking: EG [[AX [EX [0<=0]] & [0<=p116 & p116<=0]]]
normalized: EG [[[0<=p116 & p116<=0] & ~ [EX [~ [EX [0<=0]]]]]]

abstracting: (0<=0)
states: 53,199,618 (7)
..abstracting: (p116<=0)
states: 52,151,042 (7)
abstracting: (0<=p116)
states: 53,199,618 (7)
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.164sec

checking: AX [AG [[[1<=p1 & p1<=1] | [0<=p61 & p61<=0]]]]
normalized: ~ [EX [E [true U ~ [[[1<=p1 & p1<=1] | [0<=p61 & p61<=0]]]]]]

abstracting: (p61<=0)
states: 52,151,042 (7)
abstracting: (0<=p61)
states: 53,199,618 (7)
abstracting: (p1<=1)
states: 53,199,618 (7)
abstracting: (1<=p1)
states: 9,765,625 (6)
.-> the formula is FALSE

FORMULA StigmergyElection-PT-11a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m42.049sec

checking: AG [EF [[[[1<=p48 & p48<=1] | [0<=p20 & p20<=0]] & EX [0<=0]]]]
normalized: ~ [E [true U ~ [E [true U [EX [0<=0] & [[0<=p20 & p20<=0] | [1<=p48 & p48<=1]]]]]]]

abstracting: (p48<=1)
states: 53,199,618 (7)
abstracting: (1<=p48)
states: 1
abstracting: (p20<=0)
states: 52,151,042 (7)
abstracting: (0<=p20)
states: 53,199,618 (7)
abstracting: (0<=0)
states: 53,199,618 (7)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.210sec

checking: EX [A [~ [A [~ [[p28<=1 & 1<=p28]] U [[0<=p22 & p22<=0] & [1<=p138 & p138<=1]]]] U EX [0<=0]]]
normalized: EX [[~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [[~ [EG [~ [[[1<=p138 & p138<=1] & [0<=p22 & p22<=0]]]]] & ~ [E [~ [[[1<=p138 & p138<=1] & [0<=p22 & p22<=0]]] U [[p28<=1 & 1<=p28] & ~ [[[1<=p138 & p138<=1] & [0<=p22 & p22<=0]]]]]]] & ~ [EX [0<=0]]]]]]]

abstracting: (0<=0)
states: 53,199,618 (7)
.abstracting: (p22<=0)
states: 53,199,617 (7)
abstracting: (0<=p22)
states: 53,199,618 (7)
abstracting: (p138<=1)
states: 53,199,618 (7)
abstracting: (1<=p138)
states: 9,765,625 (6)
abstracting: (1<=p28)
states: 9,765,625 (6)
abstracting: (p28<=1)
states: 53,199,618 (7)
abstracting: (p22<=0)
states: 53,199,617 (7)
abstracting: (0<=p22)
states: 53,199,618 (7)
abstracting: (p138<=1)
states: 53,199,618 (7)
abstracting: (1<=p138)
states: 9,765,625 (6)
abstracting: (p22<=0)
states: 53,199,617 (7)
abstracting: (0<=p22)
states: 53,199,618 (7)
abstracting: (p138<=1)
states: 53,199,618 (7)
abstracting: (1<=p138)
states: 9,765,625 (6)
..
EG iterations: 2
abstracting: (0<=0)
states: 53,199,618 (7)
.abstracting: (0<=0)
states: 53,199,618 (7)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.752sec

checking: AG [AF [[[[[1<=p15 & p15<=1] & [0<=p136 & p136<=0]] | [1<=p22 & p22<=1]] | [[0<=p117 & p117<=0] | AG [[1<=p62 & p62<=1]]]]]]
normalized: ~ [E [true U EG [~ [[[~ [E [true U ~ [[1<=p62 & p62<=1]]]] | [0<=p117 & p117<=0]] | [[1<=p22 & p22<=1] | [[0<=p136 & p136<=0] & [1<=p15 & p15<=1]]]]]]]]

abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (p136<=0)
states: 43,433,993 (7)
abstracting: (0<=p136)
states: 53,199,618 (7)
abstracting: (p22<=1)
states: 53,199,618 (7)
abstracting: (1<=p22)
states: 1
abstracting: (p117<=0)
states: 53,199,617 (7)
abstracting: (0<=p117)
states: 53,199,618 (7)
abstracting: (p62<=1)
states: 53,199,618 (7)
abstracting: (1<=p62)
states: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-11a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.430sec

checking: AF [~ [E [AF [[[[[1<=p120 & p120<=1] | [0<=p15 & p15<=0]] | [1<=p80 & p80<=1]] & [[[1<=p142 & p142<=1] | [1<=p55 & p55<=1]] | [0<=p141 & p141<=0]]]] U [AF [[p7<=1 & 1<=p7]] & [p83<=0 & 0<=p83]]]]]
normalized: ~ [EG [E [~ [EG [~ [[[[0<=p141 & p141<=0] | [[1<=p55 & p55<=1] | [1<=p142 & p142<=1]]] & [[1<=p80 & p80<=1] | [[0<=p15 & p15<=0] | [1<=p120 & p120<=1]]]]]]] U [[p83<=0 & 0<=p83] & ~ [EG [~ [[p7<=1 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 1,048,576 (6)
abstracting: (p7<=1)
states: 53,199,618 (7)
.
EG iterations: 1
abstracting: (0<=p83)
states: 53,199,618 (7)
abstracting: (p83<=0)
states: 43,433,993 (7)
abstracting: (p120<=1)
states: 53,199,618 (7)
abstracting: (1<=p120)
states: 1
abstracting: (p15<=0)
states: 43,433,993 (7)
abstracting: (0<=p15)
states: 53,199,618 (7)
abstracting: (p80<=1)
states: 53,199,618 (7)
abstracting: (1<=p80)
states: 59,049 (4)
abstracting: (p142<=1)
states: 53,199,618 (7)
abstracting: (1<=p142)
states: 1,048,576 (6)
abstracting: (p55<=1)
states: 53,199,618 (7)
abstracting: (1<=p55)
states: 9,765,625 (6)
abstracting: (p141<=0)
states: 52,151,042 (7)
abstracting: (0<=p141)
states: 53,199,618 (7)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-11a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 7.635sec

checking: E [AX [[EF [[p3<=0 & 0<=p3]] & [EX [AG [[p48<=1 & 1<=p48]]] | [p117<=1 & 1<=p117]]]] U E [AG [EX [0<=0]] U [~ [AG [[[p26<=0 & 0<=p26] & [p80<=1 & 1<=p80]]]] & [~ [[p33<=0 & 0<=p33]] | [[p143<=1 & 1<=p143] | ~ [EF [[p10<=1 & 1<=p10]]]]]]]]
normalized: E [~ [EX [~ [[[[p117<=1 & 1<=p117] | EX [~ [E [true U ~ [[p48<=1 & 1<=p48]]]]]] & E [true U [p3<=0 & 0<=p3]]]]]] U E [~ [E [true U ~ [EX [0<=0]]]] U [[[~ [E [true U [p10<=1 & 1<=p10]]] | [p143<=1 & 1<=p143]] | ~ [[p33<=0 & 0<=p33]]] & E [true U ~ [[[p80<=1 & 1<=p80] & [p26<=0 & 0<=p26]]]]]]]

abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (1<=p80)
states: 59,049 (4)
abstracting: (p80<=1)
states: 53,199,618 (7)
abstracting: (0<=p33)
states: 53,199,618 (7)
abstracting: (p33<=0)
states: 52,151,042 (7)
abstracting: (1<=p143)
states: 1
abstracting: (p143<=1)
states: 53,199,618 (7)
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 53,199,618 (7)
abstracting: (0<=0)
states: 53,199,618 (7)
.abstracting: (0<=p3)
states: 53,199,618 (7)
abstracting: (p3<=0)
states: 43,433,993 (7)
abstracting: (1<=p48)
states: 1
abstracting: (p48<=1)
states: 53,199,618 (7)
.abstracting: (1<=p117)
states: 1
abstracting: (p117<=1)
states: 53,199,618 (7)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m39.257sec

checking: E [[AX [EF [EX [[[1<=p87 & p87<=1] | [0<=p98 & p98<=0]]]]] | ~ [[EX [AG [[1<=p126 & p126<=1]]] & ~ [[E [[[1<=p11 & p11<=1] | [0<=p10 & p10<=0]] U [0<=p127 & p127<=0]] | ~ [[[1<=p68 & p68<=1] | [0<=p98 & p98<=0]]]]]]]] U AX [1<=0]]
normalized: E [[~ [[~ [[~ [[[0<=p98 & p98<=0] | [1<=p68 & p68<=1]]] | E [[[0<=p10 & p10<=0] | [1<=p11 & p11<=1]] U [0<=p127 & p127<=0]]]] & EX [~ [E [true U ~ [[1<=p126 & p126<=1]]]]]]] | ~ [EX [~ [E [true U EX [[[0<=p98 & p98<=0] | [1<=p87 & p87<=1]]]]]]]] U ~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
.abstracting: (p87<=1)
states: 53,199,618 (7)
abstracting: (1<=p87)
states: 1,048,576 (6)
abstracting: (p98<=0)
states: 43,433,993 (7)
abstracting: (0<=p98)
states: 53,199,618 (7)

before gc: list nodes free: 1337330

after gc: idd nodes used:2360905, unused:61639095; list nodes free:279070385
..abstracting: (p126<=1)
states: 53,199,618 (7)
abstracting: (1<=p126)
states: 9,765,625 (6)
.abstracting: (p127<=0)
states: 43,433,993 (7)
abstracting: (0<=p127)
states: 53,199,618 (7)
abstracting: (p11<=1)
states: 53,199,618 (7)
abstracting: (1<=p11)
states: 1
abstracting: (p10<=0)
states: 53,199,617 (7)
abstracting: (0<=p10)
states: 53,199,618 (7)
abstracting: (p68<=1)
states: 53,199,618 (7)
abstracting: (1<=p68)
states: 59,049 (4)
abstracting: (p98<=0)
states: 43,433,993 (7)
abstracting: (0<=p98)
states: 53,199,618 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-11a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.939sec

checking: E [[[1<=p103 & p103<=1] | [0<=p31 & p31<=0]] U [[[1<=p19 & p19<=1] | [0<=p113 & p113<=0]] & ~ [[[~ [[p33<=1 & 1<=p33]] & EG [[[p20<=0 & 0<=p20] | [p52<=1 & 1<=p52]]]] | [AG [[[p21<=0 & 0<=p21] | [p144<=1 & 1<=p144]]] | ~ [AF [[[p130<=0 & 0<=p130] | [1<=p97 & p97<=1]]]]]]]]]
normalized: E [[[0<=p31 & p31<=0] | [1<=p103 & p103<=1]] U [~ [[[EG [~ [[[1<=p97 & p97<=1] | [p130<=0 & 0<=p130]]]] | ~ [E [true U ~ [[[p144<=1 & 1<=p144] | [p21<=0 & 0<=p21]]]]]] | [EG [[[p52<=1 & 1<=p52] | [p20<=0 & 0<=p20]]] & ~ [[p33<=1 & 1<=p33]]]]] & [[0<=p113 & p113<=0] | [1<=p19 & p19<=1]]]]

abstracting: (p19<=1)
states: 53,199,618 (7)
abstracting: (1<=p19)
states: 1,048,576 (6)
abstracting: (p113<=0)
states: 43,433,993 (7)
abstracting: (0<=p113)
states: 53,199,618 (7)
abstracting: (1<=p33)
states: 1,048,576 (6)
abstracting: (p33<=1)
states: 53,199,618 (7)
abstracting: (0<=p20)
states: 53,199,618 (7)
abstracting: (p20<=0)
states: 52,151,042 (7)
abstracting: (1<=p52)
states: 10,873,287 (7)
abstracting: (p52<=1)
states: 53,199,618 (7)
.
EG iterations: 1
abstracting: (0<=p21)
states: 53,199,618 (7)
abstracting: (p21<=0)
states: 52,151,042 (7)
abstracting: (1<=p144)
states: 1
abstracting: (p144<=1)
states: 53,199,618 (7)
abstracting: (0<=p130)
states: 53,199,618 (7)
abstracting: (p130<=0)
states: 53,199,617 (7)
abstracting: (p97<=1)
states: 53,199,618 (7)
abstracting: (1<=p97)
states: 9,765,625 (6)
..
EG iterations: 2
abstracting: (p103<=1)
states: 53,199,618 (7)
abstracting: (1<=p103)
states: 1
abstracting: (p31<=0)
states: 43,433,993 (7)
abstracting: (0<=p31)
states: 53,199,618 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m43.755sec

checking: A [EX [~ [[[[p17<=1 & 1<=p17] | [p81<=1 & 1<=p81]] & ~ [[[p3<=0 & 0<=p3] | [p2<=1 & 1<=p2]]]]]] U EG [[~ [[[~ [[[p88<=0 & 0<=p88] | [1<=p76 & p76<=1]]] | AX [[[p110<=0 & 0<=p110] | [p71<=1 & 1<=p71]]]] & [~ [[[p66<=0 & 0<=p66] | [p17<=1 & 1<=p17]]] | [[p27<=0 & 0<=p27] | [p13<=1 & 1<=p13]]]]] | AG [EX [[p92<=0 & 0<=p92]]]]]]
normalized: [~ [EG [~ [EG [[~ [E [true U ~ [EX [[p92<=0 & 0<=p92]]]]] | ~ [[[[[p13<=1 & 1<=p13] | [p27<=0 & 0<=p27]] | ~ [[[p17<=1 & 1<=p17] | [p66<=0 & 0<=p66]]]] & [~ [EX [~ [[[p71<=1 & 1<=p71] | [p110<=0 & 0<=p110]]]]] | ~ [[[1<=p76 & p76<=1] | [p88<=0 & 0<=p88]]]]]]]]]]] & ~ [E [~ [EG [[~ [E [true U ~ [EX [[p92<=0 & 0<=p92]]]]] | ~ [[[[[p13<=1 & 1<=p13] | [p27<=0 & 0<=p27]] | ~ [[[p17<=1 & 1<=p17] | [p66<=0 & 0<=p66]]]] & [~ [EX [~ [[[p71<=1 & 1<=p71] | [p110<=0 & 0<=p110]]]]] | ~ [[[1<=p76 & p76<=1] | [p88<=0 & 0<=p88]]]]]]]]] U [~ [EX [~ [[~ [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]]] & [[p81<=1 & 1<=p81] | [p17<=1 & 1<=p17]]]]]] & ~ [EG [[~ [E [true U ~ [EX [[p92<=0 & 0<=p92]]]]] | ~ [[[[[p13<=1 & 1<=p13] | [p27<=0 & 0<=p27]] | ~ [[[p17<=1 & 1<=p17] | [p66<=0 & 0<=p66]]]] & [~ [EX [~ [[[p71<=1 & 1<=p71] | [p110<=0 & 0<=p110]]]]] | ~ [[[1<=p76 & p76<=1] | [p88<=0 & 0<=p88]]]]]]]]]]]]]

abstracting: (0<=p88)
states: 53,199,618 (7)
abstracting: (p88<=0)
states: 52,151,042 (7)
abstracting: (p76<=1)
states: 53,199,618 (7)
abstracting: (1<=p76)
states: 1
abstracting: (0<=p110)
states: 53,199,618 (7)
abstracting: (p110<=0)
states: 43,433,993 (7)
abstracting: (1<=p71)
states: 9,765,625 (6)
abstracting: (p71<=1)
states: 53,199,618 (7)
.abstracting: (0<=p66)
states: 53,199,618 (7)
abstracting: (p66<=0)
states: 42,326,331 (7)
abstracting: (1<=p17)
states: 9,765,625 (6)
abstracting: (p17<=1)
states: 53,199,618 (7)
abstracting: (0<=p27)
states: 53,199,618 (7)
abstracting: (p27<=0)
states: 53,140,569 (7)
abstracting: (1<=p13)
states: 59,049 (4)
abstracting: (p13<=1)
states: 53,199,618 (7)
abstracting: (0<=p92)
states: 53,199,618 (7)
abstracting: (p92<=0)
states: 53,199,617 (7)
.
EG iterations: 0
abstracting: (1<=p17)
states: 9,765,625 (6)
abstracting: (p17<=1)
states: 53,199,618 (7)
abstracting: (1<=p81)
states: 59,049 (4)
abstracting: (p81<=1)
states: 53,199,618 (7)
abstracting: (0<=p3)
states: 53,199,618 (7)
abstracting: (p3<=0)
states: 43,433,993 (7)
abstracting: (1<=p2)
states: 9,765,625 (6)
abstracting: (p2<=1)
states: 53,199,618 (7)
.abstracting: (0<=p88)
states: 53,199,618 (7)
abstracting: (p88<=0)
states: 52,151,042 (7)
abstracting: (p76<=1)
states: 53,199,618 (7)
abstracting: (1<=p76)
states: 1
abstracting: (0<=p110)
states: 53,199,618 (7)
abstracting: (p110<=0)
states: 43,433,993 (7)
abstracting: (1<=p71)
states: 9,765,625 (6)
abstracting: (p71<=1)
states: 53,199,618 (7)
.abstracting: (0<=p66)
states: 53,199,618 (7)
abstracting: (p66<=0)
states: 42,326,331 (7)
abstracting: (1<=p17)
states: 9,765,625 (6)
abstracting: (p17<=1)
states: 53,199,618 (7)
abstracting: (0<=p27)
states: 53,199,618 (7)
abstracting: (p27<=0)
states: 53,140,569 (7)
abstracting: (1<=p13)
states: 59,049 (4)
abstracting: (p13<=1)
states: 53,199,618 (7)
abstracting: (0<=p92)
states: 53,199,618 (7)
abstracting: (p92<=0)
states: 53,199,617 (7)
.
EG iterations: 0
abstracting: (0<=p88)
states: 53,199,618 (7)
abstracting: (p88<=0)
states: 52,151,042 (7)
abstracting: (p76<=1)
states: 53,199,618 (7)
abstracting: (1<=p76)
states: 1
abstracting: (0<=p110)
states: 53,199,618 (7)
abstracting: (p110<=0)
states: 43,433,993 (7)
abstracting: (1<=p71)
states: 9,765,625 (6)
abstracting: (p71<=1)
states: 53,199,618 (7)
.abstracting: (0<=p66)
states: 53,199,618 (7)
abstracting: (p66<=0)
states: 42,326,331 (7)
abstracting: (1<=p17)
states: 9,765,625 (6)
abstracting: (p17<=1)
states: 53,199,618 (7)
abstracting: (0<=p27)
states: 53,199,618 (7)
abstracting: (p27<=0)
states: 53,140,569 (7)
abstracting: (1<=p13)
states: 59,049 (4)
abstracting: (p13<=1)
states: 53,199,618 (7)
abstracting: (0<=p92)
states: 53,199,618 (7)
abstracting: (p92<=0)
states: 53,199,617 (7)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.665sec

checking: A [~ [EX [EG [[[[p48<=1 & 1<=p48] | [0<=p110 & p110<=0]] & [[p106<=0 & 0<=p106] | [p132<=1 & 1<=p132]]]]]] U ~ [[[~ [[1<=p93 & p93<=1]] & A [[[1<=p69 & p69<=1] | [p4<=0 & 0<=p4]] U [[[0<=p89 & p89<=0] | [0<=p12 & p12<=0]] | A [[[1<=p15 & p15<=1] | [p134<=0 & 0<=p134]] U [0<=p26 & p26<=0]]]]] & EG [A [EX [[p119<=0 & 0<=p119]] U [p17<=0 & 0<=p17]]]]]]
normalized: [~ [EG [[EG [[~ [EG [~ [[p17<=0 & 0<=p17]]]] & ~ [E [~ [[p17<=0 & 0<=p17]] U [~ [EX [[p119<=0 & 0<=p119]]] & ~ [[p17<=0 & 0<=p17]]]]]]] & [[~ [EG [~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]]]] & ~ [E [~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]] U [~ [[[p4<=0 & 0<=p4] | [1<=p69 & p69<=1]]] & ~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]]]]]] & ~ [[1<=p93 & p93<=1]]]]]] & ~ [E [[EG [[~ [EG [~ [[p17<=0 & 0<=p17]]]] & ~ [E [~ [[p17<=0 & 0<=p17]] U [~ [EX [[p119<=0 & 0<=p119]]] & ~ [[p17<=0 & 0<=p17]]]]]]] & [[~ [EG [~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]]]] & ~ [E [~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]] U [~ [[[p4<=0 & 0<=p4] | [1<=p69 & p69<=1]]] & ~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]]]]]] & ~ [[1<=p93 & p93<=1]]]] U [EX [EG [[[[p132<=1 & 1<=p132] | [p106<=0 & 0<=p106]] & [[0<=p110 & p110<=0] | [p48<=1 & 1<=p48]]]]] & [EG [[~ [EG [~ [[p17<=0 & 0<=p17]]]] & ~ [E [~ [[p17<=0 & 0<=p17]] U [~ [EX [[p119<=0 & 0<=p119]]] & ~ [[p17<=0 & 0<=p17]]]]]]] & [[~ [EG [~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]]]] & ~ [E [~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]] U [~ [[[p4<=0 & 0<=p4] | [1<=p69 & p69<=1]]] & ~ [[[~ [EG [~ [[0<=p26 & p26<=0]]]] & ~ [E [~ [[0<=p26 & p26<=0]] U [~ [[[p134<=0 & 0<=p134] | [1<=p15 & p15<=1]]] & ~ [[0<=p26 & p26<=0]]]]]] | [[0<=p12 & p12<=0] | [0<=p89 & p89<=0]]]]]]]] & ~ [[1<=p93 & p93<=1]]]]]]]]

abstracting: (p93<=1)
states: 53,199,618 (7)
abstracting: (1<=p93)
states: 10,873,287 (7)
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
abstracting: (p69<=1)
states: 53,199,618 (7)
abstracting: (1<=p69)
states: 9,765,625 (6)
abstracting: (0<=p4)
states: 53,199,618 (7)
abstracting: (p4<=0)
states: 43,433,993 (7)
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
.
EG iterations: 1
abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
abstracting: (0<=p119)
states: 53,199,618 (7)
abstracting: (p119<=0)
states: 53,199,617 (7)
.abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p48)
states: 1
abstracting: (p48<=1)
states: 53,199,618 (7)
abstracting: (p110<=0)
states: 43,433,993 (7)
abstracting: (0<=p110)
states: 53,199,618 (7)
abstracting: (0<=p106)
states: 53,199,618 (7)
abstracting: (p106<=0)
states: 53,199,617 (7)
abstracting: (1<=p132)
states: 1
abstracting: (p132<=1)
states: 53,199,618 (7)
.
EG iterations: 1
.abstracting: (p93<=1)
states: 53,199,618 (7)
abstracting: (1<=p93)
states: 10,873,287 (7)
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
abstracting: (p69<=1)
states: 53,199,618 (7)
abstracting: (1<=p69)
states: 9,765,625 (6)
abstracting: (0<=p4)
states: 53,199,618 (7)
abstracting: (p4<=0)
states: 43,433,993 (7)
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
.
EG iterations: 1
abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
abstracting: (0<=p119)
states: 53,199,618 (7)
abstracting: (p119<=0)
states: 53,199,617 (7)
.abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
..
EG iterations: 2
.
EG iterations: 1

before gc: list nodes free: 1741309

after gc: idd nodes used:2927141, unused:61072859; list nodes free:278910224
abstracting: (p93<=1)
states: 53,199,618 (7)
abstracting: (1<=p93)
states: 10,873,287 (7)
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
abstracting: (p69<=1)
states: 53,199,618 (7)
abstracting: (1<=p69)
states: 9,765,625 (6)
abstracting: (0<=p4)
states: 53,199,618 (7)
abstracting: (p4<=0)
states: 43,433,993 (7)
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
abstracting: (p89<=0)
states: 53,199,617 (7)
abstracting: (0<=p89)
states: 53,199,618 (7)
abstracting: (p12<=0)
states: 42,326,331 (7)
abstracting: (0<=p12)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p15<=1)
states: 53,199,618 (7)
abstracting: (1<=p15)
states: 9,765,625 (6)
abstracting: (0<=p134)
states: 53,199,618 (7)
abstracting: (p134<=0)
states: 53,140,569 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
abstracting: (p26<=0)
states: 53,140,569 (7)
abstracting: (0<=p26)
states: 53,199,618 (7)
......................
EG iterations: 22
.
EG iterations: 1
abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
abstracting: (0<=p119)
states: 53,199,618 (7)
abstracting: (p119<=0)
states: 53,199,617 (7)
.abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
abstracting: (0<=p17)
states: 53,199,618 (7)
abstracting: (p17<=0)
states: 43,433,993 (7)
..
EG iterations: 2
.
EG iterations: 1
........................
EG iterations: 24
-> the formula is FALSE

FORMULA StigmergyElection-PT-11a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m39.162sec

checking: [EG [[[[[[0<=p13 & p13<=0] & AF [[[1<=p146 & p146<=1] & [0<=p117 & p117<=0]]]] & [[p26<=1 & 1<=p26] & [[p53<=0 & 0<=p53] & [p106<=1 & 1<=p106]]]] | [E [[[1<=p17 & p17<=1] | [0<=p42 & p42<=0]] U [[[0<=p84 & p84<=0] | [1<=p22 & p22<=1]] | [0<=p27 & p27<=0]]] & [[p132<=0 & 0<=p132] | [p121<=1 & 1<=p121]]]] | E [~ [EX [[[0<=p15 & p15<=0] | [p125<=1 & 1<=p125]]]] U [[p142<=0 & 0<=p142] | [p83<=1 & 1<=p83]]]]] | EG [[~ [A [EX [[1<=p121 & p121<=1]] U A [[1<=p66 & p66<=1] U [1<=p82 & p82<=1]]]] | [[1<=p27 & p27<=1] & [0<=p56 & p56<=0]]]]]
normalized: [EG [[[[[~ [EG [~ [[[0<=p117 & p117<=0] & [1<=p146 & p146<=1]]]]] & [0<=p13 & p13<=0]] & [[[p106<=1 & 1<=p106] & [p53<=0 & 0<=p53]] & [p26<=1 & 1<=p26]]] | [[[p121<=1 & 1<=p121] | [p132<=0 & 0<=p132]] & E [[[0<=p42 & p42<=0] | [1<=p17 & p17<=1]] U [[0<=p27 & p27<=0] | [[1<=p22 & p22<=1] | [0<=p84 & p84<=0]]]]]] | E [~ [EX [[[p125<=1 & 1<=p125] | [0<=p15 & p15<=0]]]] U [[p83<=1 & 1<=p83] | [p142<=0 & 0<=p142]]]]] | EG [[[[0<=p56 & p56<=0] & [1<=p27 & p27<=1]] | ~ [[~ [EG [~ [[~ [EG [~ [[1<=p82 & p82<=1]]]] & ~ [E [~ [[1<=p82 & p82<=1]] U [~ [[1<=p66 & p66<=1]] & ~ [[1<=p82 & p82<=1]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p82 & p82<=1]]]] & ~ [E [~ [[1<=p82 & p82<=1]] U [~ [[1<=p66 & p66<=1]] & ~ [[1<=p82 & p82<=1]]]]]]] U [~ [EX [[1<=p121 & p121<=1]]] & ~ [[~ [EG [~ [[1<=p82 & p82<=1]]]] & ~ [E [~ [[1<=p82 & p82<=1]] U [~ [[1<=p66 & p66<=1]] & ~ [[1<=p82 & p82<=1]]]]]]]]]]]]]]]

abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
abstracting: (p66<=1)
states: 53,199,618 (7)
abstracting: (1<=p66)
states: 10,873,287 (7)
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)

before gc: list nodes free: 267667

after gc: idd nodes used:3123506, unused:60876494; list nodes free:284362922
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
.
EG iterations: 1
abstracting: (p121<=1)
states: 53,199,618 (7)
abstracting: (1<=p121)
states: 10,873,287 (7)
.abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
abstracting: (p66<=1)
states: 53,199,618 (7)
abstracting: (1<=p66)
states: 10,873,287 (7)
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
.
EG iterations: 1
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
abstracting: (p66<=1)
states: 53,199,618 (7)
abstracting: (1<=p66)
states: 10,873,287 (7)
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
abstracting: (p82<=1)
states: 53,199,618 (7)
abstracting: (1<=p82)
states: 9,765,625 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p27<=1)
states: 53,199,618 (7)
abstracting: (1<=p27)
states: 59,049 (4)
abstracting: (p56<=0)
states: 43,433,993 (7)
abstracting: (0<=p56)
states: 53,199,618 (7)
.
EG iterations: 1
abstracting: (0<=p142)
states: 53,199,618 (7)
abstracting: (p142<=0)
states: 52,151,042 (7)
abstracting: (1<=p83)
states: 9,765,625 (6)
abstracting: (p83<=1)
states: 53,199,618 (7)
abstracting: (p15<=0)
states: 43,433,993 (7)
abstracting: (0<=p15)
states: 53,199,618 (7)
abstracting: (1<=p125)
states: 9,765,625 (6)
abstracting: (p125<=1)
states: 53,199,618 (7)
.abstracting: (p84<=0)
states: 43,433,993 (7)
abstracting: (0<=p84)
states: 53,199,618 (7)
abstracting: (p22<=1)
states: 53,199,618 (7)
abstracting: (1<=p22)
states: 1
abstracting: (p27<=0)
states: 53,140,569 (7)
abstracting: (0<=p27)
states: 53,199,618 (7)
abstracting: (p17<=1)
states: 53,199,618 (7)
abstracting: (1<=p17)
states: 9,765,625 (6)
abstracting: (p42<=0)
states: 43,433,993 (7)
abstracting: (0<=p42)
states: 53,199,618 (7)
abstracting: (0<=p132)
states: 53,199,618 (7)
abstracting: (p132<=0)
states: 53,199,617 (7)
abstracting: (1<=p121)
states: 10,873,287 (7)
abstracting: (p121<=1)
states: 53,199,618 (7)
abstracting: (1<=p26)
states: 59,049 (4)
abstracting: (p26<=1)
states: 53,199,618 (7)
abstracting: (0<=p53)
states: 53,199,618 (7)
abstracting: (p53<=0)
states: 53,140,569 (7)
abstracting: (1<=p106)
states: 1
abstracting: (p106<=1)
states: 53,199,618 (7)
abstracting: (p13<=0)
states: 53,140,569 (7)
abstracting: (0<=p13)
states: 53,199,618 (7)
abstracting: (p146<=1)
states: 53,199,618 (7)
abstracting: (1<=p146)
states: 1
abstracting: (p117<=0)
states: 53,199,617 (7)
abstracting: (0<=p117)
states: 53,199,618 (7)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-11a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m28.276sec

totally nodes used: 235694684 (2.4e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 456069564 2186470605 2642540169
used/not used/entry size/cache size: 66203849 905015 16 1024MB
basic ops cache: hits/miss/sum: 40186038 203126867 243312905
used/not used/entry size/cache size: 16262854 514362 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 1305761 6788193 8093954
used/not used/entry size/cache size: 1607039 6781569 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 32385375
1 21929284
2 9193489
3 2791766
4 657940
5 126953
6 20702
7 2946
8 368
9 38
>= 10 3

Total processing time: 29m51.921sec


BK_STOP 1679615425511

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.034sec

348553 366126 367239 368226 369640 371396 372736 375391 378414 381878 386916 391772 395051 400663 404814 410384 414010 418709 419491 428918 437596 445753 451810 461248 470174 478462
iterations count:2660418 (618), effective:4426 (1)

initing FirstDep: 0m 0.034sec


iterations count:38389 (8), effective:132 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:38151 (8), effective:130 (0)

iterations count:4299 (1), effective:0 (0)

iterations count:38612 (8), effective:133 (0)

iterations count:50658 (11), effective:156 (0)

iterations count:4472 (1), effective:2 (0)

iterations count:38597 (8), effective:132 (0)

iterations count:38571 (8), effective:132 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4299 (1), effective:0 (0)

iterations count:4299 (1), effective:0 (0)

iterations count:4386 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4388 (1), effective:1 (0)

iterations count:38389 (8), effective:132 (0)

iterations count:42676 (9), effective:132 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4299 (1), effective:0 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:4300 (1), effective:1 (0)

iterations count:35575 (8), effective:119 (0)

iterations count:35575 (8), effective:119 (0)

iterations count:36014 (8), effective:125 (0)

iterations count:35575 (8), effective:119 (0)

iterations count:4299 (1), effective:0 (0)

iterations count:4299 (1), effective:0 (0)

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="StigmergyElection-PT-11a"
export BK_EXAMINATION="CTLCardinality"
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 StigmergyElection-PT-11a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912650600697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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