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

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

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 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 25K 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.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 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 279K 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 1679005475798

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-02a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 22:24:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-16 22:24:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:24:39] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-16 22:24:39] [INFO ] Transformed 626 places.
[2023-03-16 22:24:39] [INFO ] Transformed 1008 transitions.
[2023-03-16 22:24:39] [INFO ] Found NUPN structural information;
[2023-03-16 22:24:39] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 280 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 626/626 places, 1008/1008 transitions.
Ensure Unique test removed 8 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 124 place count 563 transition count 947
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 124 place count 563 transition count 898
Deduced a syphon composed of 49 places in 5 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 241 place count 495 transition count 898
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 242 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 494 transition count 897
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 271 place count 480 transition count 883
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 479 transition count 886
Applied a total of 273 rules in 73 ms. Remains 479 /626 variables (removed 147) and now considering 886/1008 (removed 122) transitions.
// Phase 1: matrix 886 rows 479 cols
[2023-03-16 22:24:39] [INFO ] Computed 87 place invariants in 129 ms
[2023-03-16 22:24:41] [INFO ] Implicit Places using invariants in 1973 ms returned [1, 19, 20, 21, 24, 54, 72, 152, 166, 167, 168, 169, 189, 207, 287, 292, 303, 304, 305, 306, 307, 342, 344, 347, 365, 366, 367, 368, 380, 386, 392, 398, 404, 410, 416, 422, 428, 434, 440, 478]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2005 ms to find 40 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 439/626 places, 886/1008 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 439 transition count 840
Reduce places removed 46 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 49 rules applied. Total rules applied 95 place count 393 transition count 837
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 391 transition count 837
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 97 place count 391 transition count 812
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 148 place count 365 transition count 812
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 155 place count 362 transition count 808
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 159 place count 358 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 159 place count 358 transition count 807
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 357 transition count 807
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 235 place count 320 transition count 770
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 240 place count 320 transition count 765
Applied a total of 240 rules in 65 ms. Remains 320 /439 variables (removed 119) and now considering 765/886 (removed 121) transitions.
// Phase 1: matrix 765 rows 320 cols
[2023-03-16 22:24:41] [INFO ] Computed 43 place invariants in 11 ms
[2023-03-16 22:24:41] [INFO ] Implicit Places using invariants in 289 ms returned [97, 103, 108, 109, 195, 201, 206, 207, 212, 305, 308, 311, 314, 317]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 292 ms to find 14 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 306/626 places, 765/1008 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 293 transition count 752
Applied a total of 26 rules in 10 ms. Remains 293 /306 variables (removed 13) and now considering 752/765 (removed 13) transitions.
// Phase 1: matrix 752 rows 293 cols
[2023-03-16 22:24:41] [INFO ] Computed 29 place invariants in 6 ms
[2023-03-16 22:24:43] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2023-03-16 22:24:43] [INFO ] Invariant cache hit.
[2023-03-16 22:24:44] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 293/626 places, 752/1008 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 4953 ms. Remains : 293/626 places, 752/1008 transitions.
Discarding 35 transitions out of 752. Remains 717
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 1051 ms. (steps per millisecond=9 ) properties (out of 716) seen :202
Running SMT prover for 514 properties.
[2023-03-16 22:24:45] [INFO ] Invariant cache hit.
[2023-03-16 22:24:55] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-16 22:24:55] [INFO ] [Real]Absence check using 11 positive and 18 generalized place invariants in 17 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:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 22:25:10] [INFO ] After 25051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 514 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 172 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 752/752 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 279 transition count 738
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 279 transition count 738
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 28 place count 279 transition count 737
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 278 transition count 737
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 276 transition count 735
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 276 transition count 735
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 276 transition count 731
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 272 transition count 731
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 272 transition count 730
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 271 transition count 730
Applied a total of 44 rules in 158 ms. Remains 271 /293 variables (removed 22) and now considering 730/752 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 271/293 places, 730/752 transitions.
Interrupted random walk after 372008 steps, including 8505 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 35
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 93 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 99 resets, run finished after 301 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 479) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 479) seen :0
Interrupted probabilistic random walk after 4897012 steps, run timeout after 135001 ms. (steps per millisecond=36 ) properties seen :{454=1, 455=1, 457=1, 458=1, 462=1, 465=1}
Probabilistic random walk after 4897012 steps, saw 1521216 distinct states, run finished after 135004 ms. (steps per millisecond=36 ) properties seen :6
Running SMT prover for 473 properties.
// Phase 1: matrix 730 rows 271 cols
[2023-03-16 22:28:12] [INFO ] Computed 29 place invariants in 5 ms
[2023-03-16 22:28:16] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 22:28:16] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-16 22:28:43] [INFO ] After 31102ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0 real:463
[2023-03-16 22:28:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-16 22:28:48] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-16 22:31:19] [INFO ] After 147273ms SMT Verify possible using state equation in natural domain returned unsat :450 sat :15
[2023-03-16 22:31:19] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 31 ms to minimize.
[2023-03-16 22:31:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 278 ms
[2023-03-16 22:31:20] [INFO ] Deduced a trap composed of 38 places in 1085 ms of which 2 ms to minimize.
[2023-03-16 22:31:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 1136 ms
[2023-03-16 22:31:24] [INFO ] Deduced a trap composed of 29 places in 554 ms of which 27 ms to minimize.
[2023-03-16 22:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 723 ms
[2023-03-16 22:31:25] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 26 ms to minimize.
[2023-03-16 22:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 160 ms
[2023-03-16 22:31:27] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 10 ms to minimize.
[2023-03-16 22:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 251 ms
[2023-03-16 22:31:27] [INFO ] After 155506ms SMT Verify possible using trap constraints in natural domain returned unsat :461 sat :4
Attempting to minimize the solution found.
Minimization took 1584 ms.
[2023-03-16 22:31:29] [INFO ] After 165732ms SMT Verify possible using all constraints in natural domain returned unsat :461 sat :4
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK STRUCTURAL_REDUCTION TOPOLOGICAL INITIAL_STATE SAT_SMT
Total runtime 410395 ms.
ITS solved all properties within timeout

BK_STOP 1679005889655

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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-02a"
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-02a, 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-167813611400017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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