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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
695.415 380987.00 532254.00 113.10 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.r025-oct2-167813611400027.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-03a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-oct2-167813611400027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 357K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679005497048

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-03a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 22:25:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-16 22:25:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:25:00] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-16 22:25:00] [INFO ] Transformed 821 places.
[2023-03-16 22:25:00] [INFO ] Transformed 1281 transitions.
[2023-03-16 22:25:00] [INFO ] Found NUPN structural information;
[2023-03-16 22:25:00] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 287 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 821/821 places, 1281/1281 transitions.
Ensure Unique test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 803 transition count 1198
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 171 place count 733 transition count 1198
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 171 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 7 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 336 place count 637 transition count 1129
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 338 place count 636 transition count 1128
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 380 place count 615 transition count 1107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 382 place count 614 transition count 1110
Applied a total of 382 rules in 117 ms. Remains 614 /821 variables (removed 207) and now considering 1110/1281 (removed 171) transitions.
// Phase 1: matrix 1110 rows 614 cols
[2023-03-16 22:25:00] [INFO ] Computed 111 place invariants in 43 ms
[2023-03-16 22:25:02] [INFO ] Implicit Places using invariants in 1990 ms returned [1, 19, 20, 21, 24, 54, 72, 152, 166, 167, 168, 169, 189, 207, 287, 301, 302, 303, 304, 324, 342, 422, 427, 438, 439, 440, 441, 442, 477, 479, 482, 500, 501, 502, 503, 515, 521, 527, 533, 539, 545, 551, 557, 563, 569, 575, 613]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 2023 ms to find 47 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 567/821 places, 1110/1281 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 567 transition count 1055
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 113 place count 512 transition count 1052
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 510 transition count 1052
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 115 place count 510 transition count 1018
Deduced a syphon composed of 34 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 69 rules applied. Total rules applied 184 place count 475 transition count 1018
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 10 rules applied. Total rules applied 194 place count 471 transition count 1012
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 200 place count 465 transition count 1012
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 200 place count 465 transition count 1011
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 202 place count 464 transition count 1011
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 288 place count 421 transition count 968
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 293 place count 421 transition count 963
Applied a total of 293 rules in 83 ms. Remains 421 /567 variables (removed 146) and now considering 963/1110 (removed 147) transitions.
// Phase 1: matrix 963 rows 421 cols
[2023-03-16 22:25:02] [INFO ] Computed 59 place invariants in 17 ms
[2023-03-16 22:25:03] [INFO ] Implicit Places using invariants in 363 ms returned [97, 103, 108, 109, 195, 201, 206, 207, 212, 296, 302, 307, 308, 313, 406, 409, 412, 415, 418]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 365 ms to find 19 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 402/821 places, 963/1281 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 385 transition count 946
Applied a total of 34 rules in 11 ms. Remains 385 /402 variables (removed 17) and now considering 946/963 (removed 17) transitions.
// Phase 1: matrix 946 rows 385 cols
[2023-03-16 22:25:03] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-16 22:25:03] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-16 22:25:03] [INFO ] Invariant cache hit.
[2023-03-16 22:25:06] [INFO ] Implicit Places using invariants and state equation in 2858 ms returned []
Implicit Place search using SMT with State Equation took 3244 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 385/821 places, 946/1281 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 5845 ms. Remains : 385/821 places, 946/1281 transitions.
Discarding 45 transitions out of 946. Remains 901
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 184 resets, run finished after 961 ms. (steps per millisecond=10 ) properties (out of 900) seen :209
Running SMT prover for 691 properties.
[2023-03-16 22:25:07] [INFO ] Invariant cache hit.
[2023-03-16 22:25:18] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-16 22:25:18] [INFO ] [Real]Absence check using 11 positive and 29 generalized place invariants in 27 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-16 22:25:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 22:25:33] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 691 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 259 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 946/946 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 380 transition count 941
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 380 transition count 941
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 380 transition count 940
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 379 transition count 940
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 379 transition count 936
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 375 transition count 936
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 375 transition count 934
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 373 transition count 934
Applied a total of 24 rules in 119 ms. Remains 373 /385 variables (removed 12) and now considering 934/946 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 373/385 places, 934/946 transitions.
Interrupted random walk after 374771 steps, including 7755 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 58
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 633) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 633) seen :0
Probabilistic random walk after 1000001 steps, saw 375746 distinct states, run finished after 38943 ms. (steps per millisecond=25 ) properties seen :9
Running SMT prover for 624 properties.
// Phase 1: matrix 934 rows 373 cols
[2023-03-16 22:26:44] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-16 22:26:51] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2023-03-16 22:26:51] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 72 ms returned sat
[2023-03-16 22:27:33] [INFO ] After 48714ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:609
[2023-03-16 22:27:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-16 22:27:40] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 49 ms returned sat
[2023-03-16 22:30:39] [INFO ] After 172573ms SMT Verify possible using state equation in natural domain returned unsat :570 sat :47
[2023-03-16 22:30:39] [INFO ] Deduced a trap composed of 33 places in 234 ms of which 6 ms to minimize.
[2023-03-16 22:30:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
[2023-03-16 22:30:41] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 1 ms to minimize.
[2023-03-16 22:30:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 192 ms
[2023-03-16 22:30:41] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2023-03-16 22:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-16 22:30:46] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 1 ms to minimize.
[2023-03-16 22:30:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 288 ms
[2023-03-16 22:30:53] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 1 ms to minimize.
[2023-03-16 22:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-16 22:30:57] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 0 ms to minimize.
[2023-03-16 22:30:57] [INFO ] Deduced a trap composed of 31 places in 779 ms of which 14 ms to minimize.
[2023-03-16 22:30:58] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 39 ms to minimize.
[2023-03-16 22:30:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1380 ms
[2023-03-16 22:31:04] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 1 ms to minimize.
[2023-03-16 22:31:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 258 ms
[2023-03-16 22:31:04] [INFO ] After 197619ms SMT Verify possible using trap constraints in natural domain returned unsat :582 sat :35
Attempting to minimize the solution found.
Minimization took 13185 ms.
[2023-03-16 22:31:17] [INFO ] After 224538ms SMT Verify possible using all constraints in natural domain returned unsat :582 sat :35
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK STRUCTURAL_REDUCTION TOPOLOGICAL INITIAL_STATE SAT_SMT
Total runtime 377605 ms.
ITS solved all properties within timeout

BK_STOP 1679005878035

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 QuasiLiveness -timeout 180 -rebuildPNML

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-03a"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-03a, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-oct2-167813611400027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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