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

About the Execution of Smart+red for FlexibleBarrier-PT-22b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1443.275 3600000.00 3677426.00 12839.90 TFTTFTFTFTFTFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838858800599.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 FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858800599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 12:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:33 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.9K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:08 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.8M 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-22b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679486024707

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-22b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 11:53:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 11:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:53:46] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-22 11:53:46] [INFO ] Transformed 6478 places.
[2023-03-22 11:53:46] [INFO ] Transformed 7469 transitions.
[2023-03-22 11:53:46] [INFO ] Found NUPN structural information;
[2023-03-22 11:53:46] [INFO ] Parsed PT model containing 6478 places and 7469 transitions and 18797 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 69 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 16) seen :1
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 1 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 107131 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107131 steps, saw 65771 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 7469 rows 6478 cols
[2023-03-22 11:53:50] [INFO ] Computed 24 place invariants in 249 ms
[2023-03-22 11:53:53] [INFO ] [Real]Absence check using 24 positive place invariants in 55 ms returned sat
[2023-03-22 11:53:53] [INFO ] After 2702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 11:53:55] [INFO ] [Nat]Absence check using 24 positive place invariants in 51 ms returned sat
[2023-03-22 11:54:05] [INFO ] After 8904ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :13
[2023-03-22 11:54:12] [INFO ] Deduced a trap composed of 2428 places in 4998 ms of which 12 ms to minimize.
[2023-03-22 11:54:17] [INFO ] Deduced a trap composed of 2369 places in 4935 ms of which 4 ms to minimize.
[2023-03-22 11:54:22] [INFO ] Deduced a trap composed of 2304 places in 4634 ms of which 4 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-22 11:54:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 11:54:22] [INFO ] After 28651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 13 different solutions.
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 285 ms.
Support contains 52 out of 6478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6478/6478 places, 7469/7469 transitions.
Graph (trivial) has 6090 edges and 6478 vertex of which 98 / 6478 are part of one of the 16 SCC in 34 ms
Free SCC test removed 82 places
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Drop transitions removed 1544 transitions
Trivial Post-agglo rules discarded 1544 transitions
Performed 1544 trivial Post agglomeration. Transition count delta: 1544
Iterating post reduction 0 with 1544 rules applied. Total rules applied 1545 place count 6396 transition count 5826
Reduce places removed 1544 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 1556 rules applied. Total rules applied 3101 place count 4852 transition count 5814
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 3113 place count 4840 transition count 5814
Performed 454 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 454 Pre rules applied. Total rules applied 3113 place count 4840 transition count 5360
Deduced a syphon composed of 454 places in 4 ms
Reduce places removed 454 places and 0 transitions.
Iterating global reduction 3 with 908 rules applied. Total rules applied 4021 place count 4386 transition count 5360
Discarding 2661 places :
Symmetric choice reduction at 3 with 2661 rule applications. Total rules 6682 place count 1725 transition count 2699
Iterating global reduction 3 with 2661 rules applied. Total rules applied 9343 place count 1725 transition count 2699
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 9343 place count 1725 transition count 2681
Deduced a syphon composed of 18 places in 22 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 9379 place count 1707 transition count 2681
Discarding 423 places :
Symmetric choice reduction at 3 with 423 rule applications. Total rules 9802 place count 1284 transition count 2258
Iterating global reduction 3 with 423 rules applied. Total rules applied 10225 place count 1284 transition count 2258
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 412 transitions.
Iterating post reduction 3 with 412 rules applied. Total rules applied 10637 place count 1284 transition count 1846
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 10893 place count 1156 transition count 1718
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 10929 place count 1156 transition count 1682
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 10950 place count 1135 transition count 1661
Iterating global reduction 5 with 21 rules applied. Total rules applied 10971 place count 1135 transition count 1661
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 10983 place count 1129 transition count 1661
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 10995 place count 1129 transition count 1649
Free-agglomeration rule applied 813 times.
Iterating global reduction 5 with 813 rules applied. Total rules applied 11808 place count 1129 transition count 836
Reduce places removed 813 places and 0 transitions.
Drop transitions removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 5 with 976 rules applied. Total rules applied 12784 place count 316 transition count 673
Drop transitions removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 12882 place count 316 transition count 575
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 12888 place count 316 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 12889 place count 315 transition count 574
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 106 edges and 314 vertex of which 26 / 314 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 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 6 with 3 rules applied. Total rules applied 12892 place count 301 transition count 573
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 12919 place count 300 transition count 547
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 12919 place count 300 transition count 525
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 12963 place count 278 transition count 525
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 12985 place count 278 transition count 503
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 9 with 74 rules applied. Total rules applied 13059 place count 241 transition count 466
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 13065 place count 241 transition count 460
Free-agglomeration rule applied 13 times.
Iterating global reduction 10 with 13 rules applied. Total rules applied 13078 place count 241 transition count 447
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 13115 place count 225 transition count 426
Discarding 18 places :
Symmetric choice reduction at 11 with 18 rule applications. Total rules 13133 place count 207 transition count 408
Iterating global reduction 11 with 18 rules applied. Total rules applied 13151 place count 207 transition count 408
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 13169 place count 207 transition count 390
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 12 with 42 rules applied. Total rules applied 13211 place count 207 transition count 348
Applied a total of 13211 rules in 2176 ms. Remains 207 /6478 variables (removed 6271) and now considering 348/7469 (removed 7121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2178 ms. Remains : 207/6478 places, 348/7469 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :7
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 348 rows 207 cols
[2023-03-22 11:54:24] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-22 11:54:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:54:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-22 11:54:25] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:54:25] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 11:54:25] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 38815 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 22b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 6478 places, 7469 transitions, 18797 arcs.
Final Score: 9342405.142
Took : 56 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14707192 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103828 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
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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
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 FlexibleBarrier-PT-22b, 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 r171-tall-167838858800599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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 ;