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.r267-smll-167863541700334.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 smartxred
Input is NoC3x3-PT-7B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863541700334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 09:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 130K Feb 26 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 NoC3x3-PT-7B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-7B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678856838498

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-7B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 05:07:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-15 05:07:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 05:07:22] [INFO ] Load time of PNML (sax parser for PT used): 707 ms
[2023-03-15 05:07:22] [INFO ] Transformed 7014 places.
[2023-03-15 05:07:22] [INFO ] Transformed 8833 transitions.
[2023-03-15 05:07:22] [INFO ] Found NUPN structural information;
[2023-03-15 05:07:23] [INFO ] Parsed PT model containing 7014 places and 8833 transitions and 19619 arcs in 1009 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 800 ms. (steps per millisecond=12 ) properties (out of 14) seen :3
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :1
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 8833 rows 7014 cols
[2023-03-15 05:07:24] [INFO ] Computed 66 place invariants in 108 ms
[2023-03-15 05:07:29] [INFO ] After 3953ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 05:07:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 122 ms returned sat
[2023-03-15 05:07:49] [INFO ] After 14985ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 05:07:51] [INFO ] Deduced a trap composed of 200 places in 1397 ms of which 11 ms to minimize.
[2023-03-15 05:07:53] [INFO ] Deduced a trap composed of 225 places in 1363 ms of which 3 ms to minimize.
[2023-03-15 05:07:54] [INFO ] Deduced a trap composed of 197 places in 1174 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-15 05:07:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 05:07:54] [INFO ] After 25570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 9 different solutions.
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 1224 ms.
Support contains 7 out of 7014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7014/7014 places, 8833/8833 transitions.
Graph (trivial) has 7804 edges and 7014 vertex of which 4836 / 7014 are part of one of the 33 SCC in 32 ms
Free SCC test removed 4803 places
Drop transitions removed 5889 transitions
Reduce isomorphic transitions removed 5889 transitions.
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 374 rules applied. Total rules applied 375 place count 2211 transition count 2570
Reduce places removed 374 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 380 rules applied. Total rules applied 755 place count 1837 transition count 2564
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 759 place count 1833 transition count 2564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 759 place count 1833 transition count 2563
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 761 place count 1832 transition count 2563
Discarding 765 places :
Symmetric choice reduction at 3 with 765 rule applications. Total rules 1526 place count 1067 transition count 1797
Iterating global reduction 3 with 765 rules applied. Total rules applied 2291 place count 1067 transition count 1797
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2294 place count 1067 transition count 1794
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 2294 place count 1067 transition count 1729
Deduced a syphon composed of 65 places in 6 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 2424 place count 1002 transition count 1729
Discarding 488 places :
Symmetric choice reduction at 4 with 488 rule applications. Total rules 2912 place count 514 transition count 1019
Iterating global reduction 4 with 488 rules applied. Total rules applied 3400 place count 514 transition count 1019
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 427 transitions.
Iterating post reduction 4 with 427 rules applied. Total rules applied 3827 place count 514 transition count 592
Performed 112 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 5 with 224 rules applied. Total rules applied 4051 place count 402 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4052 place count 402 transition count 478
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 4062 place count 397 transition count 493
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 4066 place count 397 transition count 489
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 7 with 17 rules applied. Total rules applied 4083 place count 397 transition count 472
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 4087 place count 393 transition count 467
Iterating global reduction 7 with 4 rules applied. Total rules applied 4091 place count 393 transition count 467
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 4093 place count 392 transition count 478
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 4097 place count 392 transition count 474
Free-agglomeration rule applied 205 times.
Iterating global reduction 7 with 205 rules applied. Total rules applied 4302 place count 392 transition count 269
Reduce places removed 205 places and 0 transitions.
Drop transitions removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Graph (complete) has 509 edges and 187 vertex of which 44 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Iterating post reduction 7 with 243 rules applied. Total rules applied 4545 place count 44 transition count 120
Drop transitions removed 71 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 8 with 74 rules applied. Total rules applied 4619 place count 44 transition count 46
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 4623 place count 44 transition count 42
Graph (complete) has 90 edges and 44 vertex of which 36 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 4624 place count 36 transition count 37
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 4626 place count 36 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 4626 place count 36 transition count 34
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4628 place count 35 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4629 place count 35 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 4630 place count 34 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4631 place count 33 transition count 32
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 14 edges and 26 vertex of which 9 / 26 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 9 rules applied. Total rules applied 4640 place count 19 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 13 with 13 rules applied. Total rules applied 4653 place count 18 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 4654 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4655 place count 17 transition count 18
Applied a total of 4655 rules in 806 ms. Remains 17 /7014 variables (removed 6997) and now considering 18/8833 (removed 8815) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 806 ms. Remains : 17/7014 places, 18/8833 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-7B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 34666 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running NoC3x3 (PT), instance 7B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 7014 places, 8833 transitions, 19619 arcs.
Final Score: 2767469.615
Took : 75 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( (tk(P1423)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P57)) ) | (! ( ( ( ( (tk(P2269)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P2614)) )) ) & ( ( (tk(P2537)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P6868)) ) | ( ( 1 ) <= (tk(P438)) ) ) ) ) & ( (tk(P6015)) <= (tk(P5751)) ) )) ) ) & ( ( ( 1 ) <= (tk(P1256)) ) | ( ( ( ( 1 ) <= (tk(P5598)) ) | (! ( (tk(P2782)) <= (tk(P2989)) )) ) | ( (! ( (! ( ( 1 ) <= (tk(P4984)) )) & (! ( ( 1 ) <= (tk(P6010)) )) )) | ( (tk(P6560)) <= (tk(P3514)) ) ) ) ) ) | ( ( (! ( (tk(P4547)) <= (tk(P3982)) )) | ( ( (tk(P5164)) <= (tk(P6432)) ) & (! ( ( (! ( (tk(P129)) <= (tk(P5602)) )) | ( ( ( 1 ) <= (tk(P813)) ) & ( (tk(P880)) <= ( 0 ) ) ) ) & ( (tk(P4416)) <= (tk(P2254)) ) )) ) ) | ( ( ( (! ( ( 1 ) <= (tk(P1550)) )) & ( (! ( ( 1 ) <= (tk(P6129)) )) & ( ( ( ( (tk(P5301)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P2597)) ) ) | (! ( (tk(P5983)) <= ( 1 ) )) ) | ( (tk(P2166)) <= (tk(P4043)) ) ) ) ) & ( (tk(P2915)) <= (tk(P1831)) ) ) & (! ( ( ( (! ( ( (tk(P5681)) <= (tk(P2561)) ) & ( (tk(P810)) <= ( 1 ) ) )) | ( ( ( (tk(P4309)) <= (tk(P739)) ) | ( ( 1 ) <= (tk(P4576)) ) ) | ( ( ( 1 ) <= (tk(P1566)) ) & ( ( 1 ) <= (tk(P657)) ) ) ) ) | ( (! ( ( (tk(P2736)) <= ( 1 ) ) & ( (tk(P4501)) <= ( 1 ) ) )) | ( (tk(P1533)) <= ( 0 ) ) ) ) | (! ( ( ( ( ( 1 ) <= (tk(P781)) ) | ( (tk(P208)) <= ( 1 ) ) ) | ( (tk(P3308)) <= ( 1 ) ) ) & ( (! ( ( 1 ) <= (tk(P5397)) )) & (! ( (tk(P381)) <= ( 0 ) )) ) )) )) ) ) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-01 (reachable & potential((! ( ( (tk(P6699)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P4115)) ) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-02 (reachable &!potential( (! ( ( 1 ) <= (tk(P2961)) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-03 (reachable &!potential( ( (tk(P6909)) <= ( 0 ) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-04 (reachable &!potential( ( (tk(P341)) <= (tk(P2035)) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-05 (reachable &!potential( ( ( ( (tk(P4767)) <= ( 1 ) ) | ( (tk(P6263)) <= (tk(P4053)) ) ) | (! ( ( 1 ) <= (tk(P405)) )) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-06 (reachable &!potential( ( (tk(P3087)) <= ( 0 ) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-07 (reachable & potential((! ( (tk(P3616)) <= ( 0 ) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-08 (reachable & potential((! ( (tk(P4263)) <= (tk(P202)) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-09 (reachable & potential(( ( 1 ) <= (tk(P3573)) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P1159)) <= (tk(P2601)) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-11 (reachable & potential((! ( (tk(P4594)) <= ( 0 ) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-12 (reachable &!potential( ( (tk(P6642)) <= (tk(P885)) )))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-13 (reachable & potential((! ( ( ( (! ( ( ( (! ( ( 1 ) <= (tk(P1091)) )) | ( ( (tk(P5944)) <= ( 1 ) ) | ( (tk(P423)) <= ( 0 ) ) ) ) & ( (! ( (tk(P6136)) <= ( 0 ) )) | ( (tk(P3232)) <= ( 1 ) ) ) ) & ( ( 1 ) <= (tk(P543)) ) )) & ( (tk(P6601)) <= ( 0 ) ) ) & ( (! ( (! ( ( 1 ) <= (tk(P963)) )) | (! ( (tk(P3327)) <= ( 0 ) )) )) | ( (tk(P819)) <= (tk(P4464)) ) ) ) | (! ( (! ( (! ( ( 1 ) <= (tk(P2858)) )) | ( ( (! ( (tk(P6571)) <= (tk(P3921)) )) & ( ( ( 1 ) <= (tk(P6364)) ) & ( (tk(P5979)) <= (tk(P5363)) ) ) ) & ( (! ( (tk(P6530)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P5784)) ) | ( (tk(P4710)) <= ( 0 ) ) ) ) ) )) | ( ( ( ( ( ( (tk(P6103)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P2834)) ) ) & ( (tk(P313)) <= (tk(P4171)) ) ) | ( (! ( ( 1 ) <= (tk(P1261)) )) | (! ( (tk(P3983)) <= (tk(P5163)) )) ) ) | (! ( (tk(P1556)) <= (tk(P4076)) )) ) | ( (! ( ( ( 1 ) <= (tk(P6890)) ) & ( ( (tk(P1258)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P2910)) ) ) )) | ( ( ( ( ( 1 ) <= (tk(P688)) ) | ( (tk(P4187)) <= ( 0 ) ) ) & (! ( ( 1 ) <= (tk(P2825)) )) ) & ( ( (tk(P2370)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1991)) ) ) ) ) ) )) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-14 (reachable &!potential( (! ( ( 1 ) <= (tk(P6854)) ))))
PROPERTY: NoC3x3-PT-7B-ReachabilityCardinality-15 (reachable &!potential( ( ( ( (tk(P1250)) <= (tk(P3036)) ) & ( ( ( (tk(P3375)) <= ( 1 ) ) | (! ( (tk(P6371)) <= (tk(P6182)) )) ) | ( ( (tk(P2731)) <= ( 1 ) ) & ( ( ( ( ( ( ( 1 ) <= (tk(P544)) ) & ( (tk(P6785)) <= ( 0 ) ) ) & ( ( ( 1 ) <= (tk(P1128)) ) & ( (tk(P6145)) <= ( 0 ) ) ) ) & ( (tk(P1889)) <= ( 1 ) ) ) & ( ( (! ( ( 1 ) <= (tk(P33)) )) | ( ( ( 1 ) <= (tk(P4605)) ) & ( (tk(P5876)) <= (tk(P1852)) ) ) ) & ( (tk(P4883)) <= ( 1 ) ) ) ) & ( ( (tk(P6674)) <= ( 0 ) ) | (! ( (! ( (tk(P270)) <= (tk(P500)) )) & ( ( (tk(P6512)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P1772)) ) ) )) ) ) ) ) ) | (! ( ( (tk(P5844)) <= (tk(P2722)) ) & ( ( 1 ) <= (tk(P3321)) ) )) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13236680 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16105292 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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="NoC3x3-PT-7B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is NoC3x3-PT-7B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-167863541700334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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