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

About the Execution of Smart+red for ASLink-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1085.495 387253.00 455498.00 84.80 F?T??F?FFT?F??F? 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.r011-oct2-167813599800159.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ASLink-PT-10a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599800159
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 920K 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 ASLink-PT-10a-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-10a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678729178043

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=ASLink-PT-10a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:39:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:39:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:39:41] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-13 17:39:41] [INFO ] Transformed 2186 places.
[2023-03-13 17:39:41] [INFO ] Transformed 3192 transitions.
[2023-03-13 17:39:41] [INFO ] Found NUPN structural information;
[2023-03-13 17:39:41] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) 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 16) seen :0
Interrupted probabilistic random walk after 117818 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117818 steps, saw 34010 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-13 17:39:45] [INFO ] Computed 422 place invariants in 235 ms
[2023-03-13 17:39:47] [INFO ] [Real]Absence check using 105 positive place invariants in 143 ms returned sat
[2023-03-13 17:39:47] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 339 ms returned sat
[2023-03-13 17:39:47] [INFO ] After 2141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 17:39:48] [INFO ] [Nat]Absence check using 105 positive place invariants in 80 ms returned sat
[2023-03-13 17:39:49] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 628 ms returned sat
[2023-03-13 17:40:12] [INFO ] After 22194ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-13 17:40:12] [INFO ] After 22209ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :12
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 17:40:12] [INFO ] After 25094ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :12
FORMULA ASLink-PT-10a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 188 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 38 places
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 2129 transition count 2981
Reduce places removed 177 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 184 rules applied. Total rules applied 418 place count 1952 transition count 2974
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 425 place count 1945 transition count 2974
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 425 place count 1945 transition count 2783
Deduced a syphon composed of 191 places in 14 ms
Ensure Unique test removed 76 places
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 458 rules applied. Total rules applied 883 place count 1678 transition count 2783
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 884 place count 1678 transition count 2782
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 885 place count 1677 transition count 2782
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 894 place count 1668 transition count 2735
Ensure Unique test removed 1 places
Iterating global reduction 5 with 10 rules applied. Total rules applied 904 place count 1667 transition count 2735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 910 place count 1666 transition count 2730
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 913 place count 1663 transition count 2730
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 11 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 1019 place count 1610 transition count 2677
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1023 place count 1610 transition count 2673
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1027 place count 1606 transition count 2673
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1035 place count 1606 transition count 2665
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 1043 place count 1598 transition count 2665
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1050 place count 1598 transition count 2665
Applied a total of 1050 rules in 963 ms. Remains 1598 /2186 variables (removed 588) and now considering 2665/3158 (removed 493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 963 ms. Remains : 1598/2186 places, 2665/3158 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 429 ms. (steps per millisecond=23 ) 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 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 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 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 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 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 2 resets, run finished after 4 ms. (steps per millisecond=250 ) 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 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 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 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 113233 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113233 steps, saw 30590 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 2665 rows 1598 cols
[2023-03-13 17:40:17] [INFO ] Computed 287 place invariants in 153 ms
[2023-03-13 17:40:18] [INFO ] After 707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-13 17:40:19] [INFO ] [Nat]Absence check using 84 positive place invariants in 103 ms returned sat
[2023-03-13 17:40:19] [INFO ] [Nat]Absence check using 84 positive and 203 generalized place invariants in 100 ms returned sat
[2023-03-13 17:40:43] [INFO ] After 23463ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :9
[2023-03-13 17:40:43] [INFO ] State equation strengthened by 53 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-13 17:40:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:40:43] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
FORMULA ASLink-PT-10a-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-10a-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 116 out of 1598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1598/1598 places, 2665/2665 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1596 transition count 2662
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 1593 transition count 2662
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 8 place count 1593 transition count 2652
Deduced a syphon composed of 10 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 1580 transition count 2652
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 1576 transition count 2648
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 1576 transition count 2646
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 1574 transition count 2646
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 1574 transition count 2644
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 1572 transition count 2644
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 1572 transition count 2644
Applied a total of 48 rules in 367 ms. Remains 1572 /1598 variables (removed 26) and now considering 2644/2665 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 1572/1598 places, 2644/2665 transitions.
Incomplete random walk after 10000 steps, including 81 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 122075 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122075 steps, saw 32473 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2644 rows 1572 cols
[2023-03-13 17:40:48] [INFO ] Computed 282 place invariants in 26 ms
[2023-03-13 17:40:48] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 17:40:49] [INFO ] [Nat]Absence check using 80 positive place invariants in 44 ms returned sat
[2023-03-13 17:40:49] [INFO ] [Nat]Absence check using 80 positive and 202 generalized place invariants in 102 ms returned sat
[2023-03-13 17:41:13] [INFO ] After 23669ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 17:41:13] [INFO ] State equation strengthened by 54 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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-13 17:41:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 17:41:13] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ASLink-PT-10a-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 8 different solutions.
FORMULA ASLink-PT-10a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1278 ms.
Support contains 106 out of 1572 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1572/1572 places, 2644/2644 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1572 transition count 2642
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1570 transition count 2642
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1570 transition count 2640
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1568 transition count 2640
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 1566 transition count 2638
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 1566 transition count 2638
Applied a total of 14 rules in 231 ms. Remains 1566 /1572 variables (removed 6) and now considering 2638/2644 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1566/1572 places, 2638/2644 transitions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 113432 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113432 steps, saw 31066 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2638 rows 1566 cols
[2023-03-13 17:41:19] [INFO ] Computed 282 place invariants in 25 ms
[2023-03-13 17:41:19] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-13 17:41:20] [INFO ] [Nat]Absence check using 84 positive place invariants in 21 ms returned sat
[2023-03-13 17:41:20] [INFO ] [Nat]Absence check using 84 positive and 198 generalized place invariants in 95 ms returned sat
[2023-03-13 17:41:39] [INFO ] After 19059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 17:41:39] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-13 17:41:44] [INFO ] After 5074ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 17:41:44] [INFO ] After 5075ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:41:44] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 2111 ms.
Support contains 106 out of 1566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1566/1566 places, 2638/2638 transitions.
Applied a total of 0 rules in 60 ms. Remains 1566 /1566 variables (removed 0) and now considering 2638/2638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1566/1566 places, 2638/2638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1566/1566 places, 2638/2638 transitions.
Applied a total of 0 rules in 64 ms. Remains 1566 /1566 variables (removed 0) and now considering 2638/2638 (removed 0) transitions.
[2023-03-13 17:41:47] [INFO ] Invariant cache hit.
[2023-03-13 17:41:48] [INFO ] Implicit Places using invariants in 1095 ms returned [1, 19, 20, 22, 51, 69, 121, 151, 164, 165, 166, 167, 168, 186, 204, 285, 300, 301, 302, 303, 304, 322, 410, 422, 435, 436, 437, 438, 439, 457, 475, 555, 570, 571, 572, 573, 574, 592, 610, 693, 707, 708, 709, 730, 748, 828, 843, 848, 849, 850, 868, 886, 922, 969, 982, 983, 984, 985, 1023, 1104, 1119, 1120, 1121, 1160, 1253, 1254, 1255, 1256, 1257, 1275, 1293, 1353, 1378, 1383, 1394, 1395, 1396, 1397, 1398, 1434, 1437, 1455, 1456, 1457, 1458, 1470, 1476, 1482, 1488, 1494, 1500, 1506, 1512, 1518, 1524, 1530]
Discarding 96 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 96 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1470/1566 places, 2638/2638 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1470 transition count 2539
Reduce places removed 99 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 119 rules applied. Total rules applied 218 place count 1371 transition count 2519
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 238 place count 1351 transition count 2519
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 238 place count 1351 transition count 2450
Deduced a syphon composed of 69 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 377 place count 1281 transition count 2450
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 40 rules applied. Total rules applied 417 place count 1262 transition count 2429
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 438 place count 1241 transition count 2429
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 438 place count 1241 transition count 2428
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 440 place count 1240 transition count 2428
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 459 place count 1221 transition count 2409
Iterating global reduction 5 with 19 rules applied. Total rules applied 478 place count 1221 transition count 2409
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 483 place count 1221 transition count 2404
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 483 place count 1221 transition count 2403
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 485 place count 1220 transition count 2403
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 490 place count 1215 transition count 2398
Iterating global reduction 6 with 5 rules applied. Total rules applied 495 place count 1215 transition count 2398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 496 place count 1215 transition count 2397
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 499 place count 1212 transition count 2394
Iterating global reduction 7 with 3 rules applied. Total rules applied 502 place count 1212 transition count 2394
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 503 place count 1211 transition count 2393
Iterating global reduction 7 with 1 rules applied. Total rules applied 504 place count 1211 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 505 place count 1210 transition count 2392
Iterating global reduction 7 with 1 rules applied. Total rules applied 506 place count 1210 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 507 place count 1209 transition count 2391
Iterating global reduction 7 with 1 rules applied. Total rules applied 508 place count 1209 transition count 2391
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 4 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 7 with 114 rules applied. Total rules applied 622 place count 1152 transition count 2334
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 627 place count 1147 transition count 2329
Iterating global reduction 7 with 5 rules applied. Total rules applied 632 place count 1147 transition count 2329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 635 place count 1147 transition count 2326
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 636 place count 1147 transition count 2325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 638 place count 1146 transition count 2324
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 643 place count 1146 transition count 2319
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 651 place count 1141 transition count 2316
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 9 with 33 rules applied. Total rules applied 684 place count 1141 transition count 2283
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 9 with 34 rules applied. Total rules applied 718 place count 1107 transition count 2283
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 719 place count 1106 transition count 2282
Iterating global reduction 10 with 1 rules applied. Total rules applied 720 place count 1106 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 721 place count 1106 transition count 2281
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 722 place count 1106 transition count 2280
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 11 with 18 rules applied. Total rules applied 740 place count 1106 transition count 2280
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 743 place count 1106 transition count 2280
Applied a total of 743 rules in 1101 ms. Remains 1106 /1470 variables (removed 364) and now considering 2280/2638 (removed 358) transitions.
// Phase 1: matrix 2280 rows 1106 cols
[2023-03-13 17:41:49] [INFO ] Computed 165 place invariants in 20 ms
[2023-03-13 17:41:50] [INFO ] Implicit Places using invariants in 913 ms returned [77, 108, 114, 115, 121, 122, 175, 196, 202, 204, 207, 214, 219, 220, 274, 292, 298, 301, 307, 312, 314, 367, 384, 390, 393, 395, 396, 403, 456, 489, 495, 500, 501, 580, 586, 589, 591, 592, 598, 605, 606, 662, 682, 688, 691, 693, 695, 700, 702, 759, 807, 813, 882, 907, 915, 921, 922, 927, 932, 933, 985, 1002, 1017, 1018]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 915 ms to find 64 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1042/1566 places, 2280/2638 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1042 transition count 2278
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1040 transition count 2278
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 25 place count 1019 transition count 2257
Iterating global reduction 2 with 21 rules applied. Total rules applied 46 place count 1019 transition count 2257
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 1012 transition count 2250
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 1012 transition count 2250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 1010 transition count 2248
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 1010 transition count 2248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1009 transition count 2247
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1009 transition count 2247
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 104 place count 990 transition count 2228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 986 transition count 2221
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 986 transition count 2221
Free-agglomeration rule applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 137 place count 986 transition count 2196
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 162 place count 961 transition count 2196
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 961 transition count 2193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 168 place count 958 transition count 2193
Applied a total of 168 rules in 235 ms. Remains 958 /1042 variables (removed 84) and now considering 2193/2280 (removed 87) transitions.
// Phase 1: matrix 2193 rows 958 cols
[2023-03-13 17:41:50] [INFO ] Computed 101 place invariants in 18 ms
[2023-03-13 17:41:50] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-13 17:41:50] [INFO ] Invariant cache hit.
[2023-03-13 17:41:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 17:41:55] [INFO ] Implicit Places using invariants and state equation in 4410 ms returned []
Implicit Place search using SMT with State Equation took 4976 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 958/1566 places, 2193/2638 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8404 ms. Remains : 958/1566 places, 2193/2638 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 9) seen :1
FORMULA ASLink-PT-10a-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 17:41:56] [INFO ] Invariant cache hit.
[2023-03-13 17:41:56] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 17:41:56] [INFO ] [Nat]Absence check using 26 positive place invariants in 16 ms returned sat
[2023-03-13 17:41:56] [INFO ] [Nat]Absence check using 26 positive and 75 generalized place invariants in 85 ms returned sat
[2023-03-13 17:42:11] [INFO ] After 14118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:42:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 17:42:21] [INFO ] After 10223ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-13 17:42:21] [INFO ] After 10226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:42:21] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 1095 ms.
Support contains 63 out of 958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 958/958 places, 2193/2193 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 958 transition count 2184
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 949 transition count 2184
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 949 transition count 2180
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 945 transition count 2180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 942 transition count 2169
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 942 transition count 2169
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 934 transition count 2161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 933 transition count 2160
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 933 transition count 2160
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 933 transition count 2159
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 933 transition count 2152
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 65 place count 926 transition count 2152
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 926 transition count 2152
Applied a total of 68 rules in 228 ms. Remains 926 /958 variables (removed 32) and now considering 2152/2193 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 926/958 places, 2152/2193 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 80676 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80676 steps, saw 57270 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2152 rows 926 cols
[2023-03-13 17:42:26] [INFO ] Computed 101 place invariants in 17 ms
[2023-03-13 17:42:26] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 17:42:27] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2023-03-13 17:42:27] [INFO ] [Nat]Absence check using 27 positive and 74 generalized place invariants in 41 ms returned sat
[2023-03-13 17:42:47] [INFO ] After 19561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:42:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-13 17:42:50] [INFO ] After 3752ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 17:42:51] [INFO ] After 4863ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 17:42:51] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 421 ms.
Support contains 63 out of 926 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 926/926 places, 2152/2152 transitions.
Applied a total of 0 rules in 29 ms. Remains 926 /926 variables (removed 0) and now considering 2152/2152 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 926/926 places, 2152/2152 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 926/926 places, 2152/2152 transitions.
Applied a total of 0 rules in 35 ms. Remains 926 /926 variables (removed 0) and now considering 2152/2152 (removed 0) transitions.
[2023-03-13 17:42:52] [INFO ] Invariant cache hit.
[2023-03-13 17:42:53] [INFO ] Implicit Places using invariants in 673 ms returned [97, 328, 421, 503, 578, 686, 706, 838]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 676 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 918/926 places, 2152/2152 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 918 transition count 2142
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 908 transition count 2141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 21 place count 908 transition count 2135
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 902 transition count 2135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 901 transition count 2134
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 901 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 900 transition count 2133
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 900 transition count 2133
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 892 transition count 2125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 892 transition count 2124
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 891 transition count 2123
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 891 transition count 2123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 890 transition count 2122
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 890 transition count 2122
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 890 transition count 2120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 888 transition count 2120
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 888 transition count 2119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 887 transition count 2119
Applied a total of 64 rules in 202 ms. Remains 887 /918 variables (removed 31) and now considering 2119/2152 (removed 33) transitions.
// Phase 1: matrix 2119 rows 887 cols
[2023-03-13 17:42:53] [INFO ] Computed 93 place invariants in 45 ms
[2023-03-13 17:42:54] [INFO ] Implicit Places using invariants in 923 ms returned [482, 483, 632, 640, 646]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 938 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 882/926 places, 2119/2152 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 880 transition count 2117
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 880 transition count 2117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 878 transition count 2115
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 878 transition count 2115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 877 transition count 2114
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 877 transition count 2114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 875 transition count 2112
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 875 transition count 2109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 872 transition count 2109
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 872 transition count 2108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 871 transition count 2108
Applied a total of 22 rules in 158 ms. Remains 871 /882 variables (removed 11) and now considering 2108/2119 (removed 11) transitions.
// Phase 1: matrix 2108 rows 871 cols
[2023-03-13 17:42:54] [INFO ] Computed 88 place invariants in 44 ms
[2023-03-13 17:42:55] [INFO ] Implicit Places using invariants in 876 ms returned []
[2023-03-13 17:42:55] [INFO ] Invariant cache hit.
[2023-03-13 17:42:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:42:58] [INFO ] Implicit Places using invariants and state equation in 3268 ms returned []
Implicit Place search using SMT with State Equation took 4147 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 871/926 places, 2108/2152 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6157 ms. Remains : 871/926 places, 2108/2152 transitions.
Incomplete random walk after 10000 steps, including 157 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 81282 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81282 steps, saw 55748 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-13 17:43:02] [INFO ] Invariant cache hit.
[2023-03-13 17:43:02] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 17:43:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 131 ms returned sat
[2023-03-13 17:43:03] [INFO ] [Nat]Absence check using 17 positive and 71 generalized place invariants in 50 ms returned sat
[2023-03-13 17:43:17] [INFO ] After 14002ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:43:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:43:27] [INFO ] After 10230ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 17:43:27] [INFO ] After 10389ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-13 17:43:27] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 716 ms.
Support contains 63 out of 871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 2108/2108 transitions.
Applied a total of 0 rules in 30 ms. Remains 871 /871 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 871/871 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 2108/2108 transitions.
Applied a total of 0 rules in 29 ms. Remains 871 /871 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-03-13 17:43:28] [INFO ] Invariant cache hit.
[2023-03-13 17:43:29] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2023-03-13 17:43:29] [INFO ] Invariant cache hit.
[2023-03-13 17:43:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 17:43:32] [INFO ] Implicit Places using invariants and state equation in 2992 ms returned []
Implicit Place search using SMT with State Equation took 4392 ms to find 0 implicit places.
[2023-03-13 17:43:33] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-13 17:43:33] [INFO ] Invariant cache hit.
[2023-03-13 17:43:34] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5645 ms. Remains : 871/871 places, 2108/2108 transitions.
Applied a total of 0 rules in 53 ms. Remains 871 /871 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-13 17:43:34] [INFO ] Invariant cache hit.
[2023-03-13 17:43:34] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 17:43:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-13 17:43:34] [INFO ] [Nat]Absence check using 17 positive and 71 generalized place invariants in 30 ms returned sat
[2023-03-13 17:43:49] [INFO ] After 14735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 17:43:50] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 19 ms to minimize.
[2023-03-13 17:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-13 17:43:51] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 1 ms to minimize.
[2023-03-13 17:43:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-13 17:44:01] [INFO ] After 26205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 11246 ms.
[2023-03-13 17:44:12] [INFO ] After 37993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-13 17:44:12] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 17:44:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 871 places, 2108 transitions and 8519 arcs took 9 ms.
[2023-03-13 17:44:13] [INFO ] Flatten gal took : 186 ms
Total runtime 272281 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 10a
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: 871 places, 2108 transitions, 8519 arcs.
Final Score: 89624.948
Took : 111 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678729565296

--------------------
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
ERROR in file model.sm near line 11505:
syntax error

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="ASLink-PT-10a"
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 ASLink-PT-10a, 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 r011-oct2-167813599800159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-10a.tgz
mv ASLink-PT-10a 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 ;