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.r023-oct2-167813610000013.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 ltsminxred
Input is ASLink-PT-01b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r023-oct2-167813610000013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 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 293K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1678985831870

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=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 16:57:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 16:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 16:57:14] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-16 16:57:14] [INFO ] Transformed 846 places.
[2023-03-16 16:57:14] [INFO ] Transformed 1148 transitions.
[2023-03-16 16:57:14] [INFO ] Found NUPN structural information;
[2023-03-16 16:57:14] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 278 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 12 ms.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 750) seen :660
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 90) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 90) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 90) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 84) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 84) seen :7
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 77) 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 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) 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 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) 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 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 77) 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 77) 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 77) 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 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 77) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 77) 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 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 77) 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 77) 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 77) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 77) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 76) 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 76) 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 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 76) 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 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 76) 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 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 76) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 74) 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 74) 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 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 74) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 74) 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 74) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 74) seen :0
Running SMT prover for 74 properties.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-16 16:57:16] [INFO ] Computed 82 place invariants in 57 ms
[2023-03-16 16:57:19] [INFO ] After 2948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:74
[2023-03-16 16:57:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 45 ms returned sat
[2023-03-16 16:57:22] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 58 ms returned sat
[2023-03-16 16:57:34] [INFO ] After 9467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :74
[2023-03-16 16:57:35] [INFO ] Deduced a trap composed of 139 places in 668 ms of which 6 ms to minimize.
[2023-03-16 16:57:36] [INFO ] Deduced a trap composed of 173 places in 419 ms of which 1 ms to minimize.
[2023-03-16 16:57:36] [INFO ] Deduced a trap composed of 146 places in 299 ms of which 1 ms to minimize.
[2023-03-16 16:57:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1599 ms
[2023-03-16 16:57:37] [INFO ] Deduced a trap composed of 156 places in 243 ms of which 1 ms to minimize.
[2023-03-16 16:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2023-03-16 16:57:39] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 2 ms to minimize.
[2023-03-16 16:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2023-03-16 16:57:46] [INFO ] Deduced a trap composed of 76 places in 3653 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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 16:57:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 16:57:46] [INFO ] After 26904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:74
Parikh walk visited 38 properties in 17103 ms.
Support contains 36 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 846 transition count 972
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 186 rules applied. Total rules applied 362 place count 670 transition count 962
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 365 place count 667 transition count 962
Performed 186 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 186 Pre rules applied. Total rules applied 365 place count 667 transition count 776
Deduced a syphon composed of 186 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 385 rules applied. Total rules applied 750 place count 468 transition count 776
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 761 place count 467 transition count 766
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 771 place count 457 transition count 766
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 771 place count 457 transition count 762
Deduced a syphon composed of 4 places in 5 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 783 place count 449 transition count 762
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 783 place count 449 transition count 758
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 791 place count 445 transition count 758
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 816 place count 420 transition count 733
Iterating global reduction 5 with 25 rules applied. Total rules applied 841 place count 420 transition count 733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 842 place count 420 transition count 732
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 842 place count 420 transition count 722
Deduced a syphon composed of 10 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 21 rules applied. Total rules applied 863 place count 409 transition count 722
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 863 place count 409 transition count 721
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 866 place count 407 transition count 721
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 868 place count 405 transition count 706
Iterating global reduction 6 with 2 rules applied. Total rules applied 870 place count 405 transition count 706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 870 place count 405 transition count 705
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 872 place count 404 transition count 705
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 873 place count 403 transition count 697
Iterating global reduction 6 with 1 rules applied. Total rules applied 874 place count 403 transition count 697
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 875 place count 402 transition count 689
Iterating global reduction 6 with 1 rules applied. Total rules applied 876 place count 402 transition count 689
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 877 place count 401 transition count 681
Iterating global reduction 6 with 1 rules applied. Total rules applied 878 place count 401 transition count 681
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 879 place count 400 transition count 673
Iterating global reduction 6 with 1 rules applied. Total rules applied 880 place count 400 transition count 673
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 881 place count 399 transition count 665
Iterating global reduction 6 with 1 rules applied. Total rules applied 882 place count 399 transition count 665
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 883 place count 398 transition count 657
Iterating global reduction 6 with 1 rules applied. Total rules applied 884 place count 398 transition count 657
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 885 place count 397 transition count 649
Iterating global reduction 6 with 1 rules applied. Total rules applied 886 place count 397 transition count 649
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 887 place count 396 transition count 641
Iterating global reduction 6 with 1 rules applied. Total rules applied 888 place count 396 transition count 641
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 889 place count 395 transition count 633
Iterating global reduction 6 with 1 rules applied. Total rules applied 890 place count 395 transition count 633
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 891 place count 394 transition count 625
Iterating global reduction 6 with 1 rules applied. Total rules applied 892 place count 394 transition count 625
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 893 place count 393 transition count 617
Iterating global reduction 6 with 1 rules applied. Total rules applied 894 place count 393 transition count 617
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 895 place count 392 transition count 609
Iterating global reduction 6 with 1 rules applied. Total rules applied 896 place count 392 transition count 609
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 897 place count 391 transition count 601
Iterating global reduction 6 with 1 rules applied. Total rules applied 898 place count 391 transition count 601
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 899 place count 390 transition count 593
Iterating global reduction 6 with 1 rules applied. Total rules applied 900 place count 390 transition count 593
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 901 place count 389 transition count 585
Iterating global reduction 6 with 1 rules applied. Total rules applied 902 place count 389 transition count 585
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 903 place count 388 transition count 577
Iterating global reduction 6 with 1 rules applied. Total rules applied 904 place count 388 transition count 577
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 986 place count 347 transition count 536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 987 place count 346 transition count 535
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 989 place count 345 transition count 535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 990 place count 344 transition count 534
Iterating global reduction 6 with 1 rules applied. Total rules applied 991 place count 344 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 993 place count 344 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 994 place count 343 transition count 532
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 996 place count 342 transition count 541
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 998 place count 342 transition count 539
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1000 place count 340 transition count 539
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1001 place count 340 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1002 place count 339 transition count 538
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 1005 place count 337 transition count 537
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1006 place count 336 transition count 537
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1006 place count 336 transition count 534
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 1013 place count 332 transition count 534
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 1015 place count 330 transition count 534
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1015 place count 330 transition count 533
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1017 place count 329 transition count 533
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1023 place count 326 transition count 530
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1024 place count 325 transition count 529
Iterating global reduction 12 with 1 rules applied. Total rules applied 1025 place count 325 transition count 529
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1026 place count 325 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1027 place count 324 transition count 528
Applied a total of 1027 rules in 498 ms. Remains 324 /846 variables (removed 522) and now considering 528/1148 (removed 620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 324/846 places, 528/1148 transitions.
Incomplete random walk after 1000000 steps, including 21114 resets, run finished after 8849 ms. (steps per millisecond=113 ) properties (out of 36) seen :33
Incomplete Best-First random walk after 1000000 steps, including 9207 resets, run finished after 3446 ms. (steps per millisecond=290 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9249 resets, run finished after 3664 ms. (steps per millisecond=272 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9230 resets, run finished after 3662 ms. (steps per millisecond=273 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 528 rows 324 cols
[2023-03-16 16:58:23] [INFO ] Computed 56 place invariants in 10 ms
[2023-03-16 16:58:23] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-16 16:58:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 17 ms returned sat
[2023-03-16 16:58:23] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 11 ms returned sat
[2023-03-16 16:58:24] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-16 16:58:24] [INFO ] After 432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-16 16:58:24] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 495 ms.
Support contains 3 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 528/528 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 324 transition count 517
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 313 transition count 517
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 22 place count 313 transition count 512
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 308 transition count 512
Applied a total of 32 rules in 21 ms. Remains 308 /324 variables (removed 16) and now considering 512/528 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 308/324 places, 512/528 transitions.
Incomplete random walk after 1000000 steps, including 21339 resets, run finished after 12122 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9290 resets, run finished after 3963 ms. (steps per millisecond=252 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9369 resets, run finished after 4546 ms. (steps per millisecond=219 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 512 rows 308 cols
[2023-03-16 16:58:45] [INFO ] Computed 56 place invariants in 12 ms
[2023-03-16 16:58:45] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 16:58:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-16 16:58:45] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 87 ms returned sat
[2023-03-16 16:58:46] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 16:58:46] [INFO ] After 451ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-16 16:58:46] [INFO ] After 858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 403 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 512/512 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 308 transition count 511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 307 transition count 511
Applied a total of 2 rules in 19 ms. Remains 307 /308 variables (removed 1) and now considering 511/512 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 307/308 places, 511/512 transitions.
Incomplete random walk after 1000000 steps, including 21249 resets, run finished after 11942 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9268 resets, run finished after 4961 ms. (steps per millisecond=201 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9266 resets, run finished after 4849 ms. (steps per millisecond=206 ) properties (out of 2) seen :0
Finished probabilistic random walk after 102070 steps, run visited all 2 properties in 735 ms. (steps per millisecond=138 )
Probabilistic random walk after 102070 steps, saw 37813 distinct states, run finished after 735 ms. (steps per millisecond=138 ) properties seen :2
Able to resolve query StableMarking after proving 751 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 114915 ms.
ITS solved all properties within timeout

BK_STOP 1678985949693

--------------------
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 StableMarking -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-01b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-01b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r023-oct2-167813610000013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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