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.r170-tall-167838857400567.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 FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857400567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 12:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:22 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 FlexibleBarrier-PT-18b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678575769595

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 23:02:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 23:02:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 23:02:51] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-11 23:02:51] [INFO ] Transformed 4370 places.
[2023-03-11 23:02:51] [INFO ] Transformed 5037 transitions.
[2023-03-11 23:02:51] [INFO ] Found NUPN structural information;
[2023-03-11 23:02:51] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 5037 rows 4370 cols
[2023-03-11 23:02:52] [INFO ] Computed 20 place invariants in 129 ms
[2023-03-11 23:02:54] [INFO ] After 1670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-11 23:02:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 40 ms returned sat
[2023-03-11 23:03:04] [INFO ] After 8059ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2023-03-11 23:03:08] [INFO ] Deduced a trap composed of 176 places in 1679 ms of which 11 ms to minimize.
[2023-03-11 23:03:10] [INFO ] Deduced a trap composed of 1500 places in 1644 ms of which 2 ms to minimize.
[2023-03-11 23:03:12] [INFO ] Deduced a trap composed of 1540 places in 1588 ms of which 3 ms to minimize.
[2023-03-11 23:03:13] [INFO ] Deduced a trap composed of 1496 places in 1403 ms of which 3 ms to minimize.
[2023-03-11 23:03:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 7287 ms
[2023-03-11 23:03:14] [INFO ] Deduced a trap composed of 261 places in 223 ms of which 1 ms to minimize.
[2023-03-11 23:03:15] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 1 ms to minimize.
[2023-03-11 23:03:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 844 ms
[2023-03-11 23:03:20] [INFO ] Deduced a trap composed of 1535 places in 1728 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.Application.startNoEx(Application.java:902)
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-11 23:03:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 23:03:20] [INFO ] After 25726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 11 different solutions.
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 181 ms.
Support contains 173 out of 4370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Graph (trivial) has 3228 edges and 4370 vertex of which 48 / 4370 are part of one of the 8 SCC in 16 ms
Free SCC test removed 40 places
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 725 transitions
Trivial Post-agglo rules discarded 725 transitions
Performed 725 trivial Post agglomeration. Transition count delta: 725
Iterating post reduction 0 with 725 rules applied. Total rules applied 726 place count 4330 transition count 4264
Reduce places removed 725 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 749 rules applied. Total rules applied 1475 place count 3605 transition count 4240
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1499 place count 3581 transition count 4240
Performed 561 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 561 Pre rules applied. Total rules applied 1499 place count 3581 transition count 3679
Deduced a syphon composed of 561 places in 4 ms
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 1122 rules applied. Total rules applied 2621 place count 3020 transition count 3679
Discarding 1685 places :
Symmetric choice reduction at 3 with 1685 rule applications. Total rules 4306 place count 1335 transition count 1994
Iterating global reduction 3 with 1685 rules applied. Total rules applied 5991 place count 1335 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5992 place count 1335 transition count 1993
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 5992 place count 1335 transition count 1990
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 5998 place count 1332 transition count 1990
Discarding 224 places :
Symmetric choice reduction at 4 with 224 rule applications. Total rules 6222 place count 1108 transition count 1766
Iterating global reduction 4 with 224 rules applied. Total rules applied 6446 place count 1108 transition count 1766
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 4 with 205 rules applied. Total rules applied 6651 place count 1108 transition count 1561
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 5 with 252 rules applied. Total rules applied 6903 place count 982 transition count 1435
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 6917 place count 975 transition count 1435
Free-agglomeration rule applied 191 times.
Iterating global reduction 5 with 191 rules applied. Total rules applied 7108 place count 975 transition count 1244
Reduce places removed 191 places and 0 transitions.
Iterating post reduction 5 with 191 rules applied. Total rules applied 7299 place count 784 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 7302 place count 781 transition count 1241
Iterating global reduction 6 with 3 rules applied. Total rules applied 7305 place count 781 transition count 1241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 7308 place count 781 transition count 1238
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 7 with 22 rules applied. Total rules applied 7330 place count 781 transition count 1216
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 7340 place count 781 transition count 1216
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 7341 place count 781 transition count 1216
Applied a total of 7341 rules in 983 ms. Remains 781 /4370 variables (removed 3589) and now considering 1216/5037 (removed 3821) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 983 ms. Remains : 781/4370 places, 1216/5037 transitions.
Incomplete random walk after 10000 steps, including 257 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 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 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 182122 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182122 steps, saw 86595 distinct states, run finished after 3003 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-11 23:03:25] [INFO ] Flow matrix only has 1194 transitions (discarded 22 similar events)
// Phase 1: matrix 1194 rows 781 cols
[2023-03-11 23:03:25] [INFO ] Computed 20 place invariants in 20 ms
[2023-03-11 23:03:25] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 23:03:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-11 23:03:26] [INFO ] After 1060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 23:03:26] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-11 23:03:27] [INFO ] After 882ms SMT Verify possible using 175 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-11 23:03:28] [INFO ] Deduced a trap composed of 334 places in 213 ms of which 1 ms to minimize.
[2023-03-11 23:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2023-03-11 23:03:29] [INFO ] After 2254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 950 ms.
[2023-03-11 23:03:30] [INFO ] After 4594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 9 ms.
Support contains 173 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1216/1216 transitions.
Applied a total of 0 rules in 25 ms. Remains 781 /781 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 781/781 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 1216/1216 transitions.
Applied a total of 0 rules in 27 ms. Remains 781 /781 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2023-03-11 23:03:30] [INFO ] Flow matrix only has 1194 transitions (discarded 22 similar events)
[2023-03-11 23:03:30] [INFO ] Invariant cache hit.
[2023-03-11 23:03:30] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-11 23:03:30] [INFO ] Flow matrix only has 1194 transitions (discarded 22 similar events)
[2023-03-11 23:03:30] [INFO ] Invariant cache hit.
[2023-03-11 23:03:30] [INFO ] State equation strengthened by 175 read => feed constraints.
[2023-03-11 23:03:31] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2023-03-11 23:03:31] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-11 23:03:31] [INFO ] Flow matrix only has 1194 transitions (discarded 22 similar events)
[2023-03-11 23:03:31] [INFO ] Invariant cache hit.
[2023-03-11 23:03:32] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1922 ms. Remains : 781/781 places, 1216/1216 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 781 transition count 1180
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 63 place count 767 transition count 1167
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 133 place count 697 transition count 1097
Iterating global reduction 2 with 70 rules applied. Total rules applied 203 place count 697 transition count 1097
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 257 place count 697 transition count 1043
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 697 transition count 1042
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 260 place count 697 transition count 1042
Applied a total of 260 rules in 94 ms. Remains 697 /781 variables (removed 84) and now considering 1042/1216 (removed 174) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 1042 rows 697 cols
[2023-03-11 23:03:32] [INFO ] Computed 20 place invariants in 25 ms
[2023-03-11 23:03:32] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 23:03:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-11 23:03:33] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-11 23:03:34] [INFO ] After 1841ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 733 ms.
[2023-03-11 23:03:35] [INFO ] After 2839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2023-03-11 23:03:35] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-11 23:03:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 781 places, 1216 transitions and 4211 arcs took 11 ms.
[2023-03-11 23:03:35] [INFO ] Flatten gal took : 108 ms
Total runtime 44431 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FlexibleBarrier_PT_18b
(NrP: 781 NrTr: 1216 NrArc: 4211)

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

net check time: 0m 0.000sec

init dd package: 0m 2.786sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 7737352 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098912 kB

BK_TIME_CONFINEMENT_REACHED

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

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

2999 6429 8362 10211 18494 17464 28615 23422 33562 36192 46865 59804 60543 63960 80052 92878 88353 105529 127347 141287 151705 159036 164282 175760 174030 171592 171071 176395

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="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="ReachabilityFireability"
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 FlexibleBarrier-PT-18b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857400567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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