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.r103-tall-167814478800805.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DLCshifumi-PT-2b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478800805
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K Feb 26 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:51 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:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 729K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-00
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-01
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-02
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-03
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-04
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-05
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-06
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-07
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-08
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-09
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-10
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-11
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-12
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-13
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-14
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678280299894

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 12:58:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 12:58:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:58:21] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-08 12:58:21] [INFO ] Transformed 2483 places.
[2023-03-08 12:58:21] [INFO ] Transformed 3183 transitions.
[2023-03-08 12:58:21] [INFO ] Found NUPN structural information;
[2023-03-08 12:58:21] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 3183 rows 2483 cols
[2023-03-08 12:58:21] [INFO ] Computed 79 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :14
FORMULA DLCshifumi-PT-2b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
[2023-03-08 12:58:21] [INFO ] Invariant cache hit.
[2023-03-08 12:58:22] [INFO ] [Real]Absence check using 79 positive place invariants in 76 ms returned sat
[2023-03-08 12:58:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:58:23] [INFO ] [Real]Absence check using state equation in 1055 ms returned sat
[2023-03-08 12:58:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:58:24] [INFO ] [Nat]Absence check using 79 positive place invariants in 72 ms returned sat
[2023-03-08 12:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:58:25] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2023-03-08 12:58:26] [INFO ] Deduced a trap composed of 67 places in 876 ms of which 5 ms to minimize.
[2023-03-08 12:58:27] [INFO ] Deduced a trap composed of 59 places in 808 ms of which 5 ms to minimize.
[2023-03-08 12:58:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1999 ms
[2023-03-08 12:58:27] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 145 ms.
[2023-03-08 12:58:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-08 12:58:29] [INFO ] [Real]Absence check using 79 positive place invariants in 58 ms returned sat
[2023-03-08 12:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:58:30] [INFO ] [Real]Absence check using state equation in 1017 ms returned sat
[2023-03-08 12:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:58:30] [INFO ] [Nat]Absence check using 79 positive place invariants in 60 ms returned sat
[2023-03-08 12:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:58:31] [INFO ] [Nat]Absence check using state equation in 1010 ms returned sat
[2023-03-08 12:58:32] [INFO ] Deduced a trap composed of 66 places in 844 ms of which 2 ms to minimize.
[2023-03-08 12:58:33] [INFO ] Deduced a trap composed of 113 places in 832 ms of which 4 ms to minimize.
[2023-03-08 12:58:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1967 ms
[2023-03-08 12:58:33] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 167 ms.
[2023-03-08 12:58:36] [INFO ] Deduced a trap composed of 16 places in 1080 ms of which 2 ms to minimize.
[2023-03-08 12:58:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Graph (trivial) has 2445 edges and 2483 vertex of which 352 / 2483 are part of one of the 23 SCC in 12 ms
Free SCC test removed 329 places
Drop transitions removed 371 transitions
Reduce isomorphic transitions removed 371 transitions.
Drop transitions removed 1254 transitions
Trivial Post-agglo rules discarded 1254 transitions
Performed 1254 trivial Post agglomeration. Transition count delta: 1254
Iterating post reduction 0 with 1254 rules applied. Total rules applied 1255 place count 2154 transition count 1558
Reduce places removed 1254 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1352 rules applied. Total rules applied 2607 place count 900 transition count 1460
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 77 rules applied. Total rules applied 2684 place count 852 transition count 1431
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 15 rules applied. Total rules applied 2699 place count 838 transition count 1430
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2700 place count 837 transition count 1430
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 17 Pre rules applied. Total rules applied 2700 place count 837 transition count 1413
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 2734 place count 820 transition count 1413
Discarding 233 places :
Symmetric choice reduction at 5 with 233 rule applications. Total rules 2967 place count 587 transition count 1180
Iterating global reduction 5 with 233 rules applied. Total rules applied 3200 place count 587 transition count 1180
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 82 Pre rules applied. Total rules applied 3200 place count 587 transition count 1098
Deduced a syphon composed of 82 places in 8 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 5 with 164 rules applied. Total rules applied 3364 place count 505 transition count 1098
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 3407 place count 462 transition count 816
Iterating global reduction 5 with 43 rules applied. Total rules applied 3450 place count 462 transition count 816
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 3483 place count 462 transition count 783
Performed 116 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 116 places in 0 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 6 with 232 rules applied. Total rules applied 3715 place count 346 transition count 665
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3717 place count 346 transition count 663
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 3817 place count 296 transition count 730
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 3827 place count 296 transition count 720
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 3842 place count 281 transition count 657
Iterating global reduction 8 with 15 rules applied. Total rules applied 3857 place count 281 transition count 657
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 3888 place count 281 transition count 626
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 3914 place count 281 transition count 600
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3918 place count 277 transition count 596
Iterating global reduction 9 with 4 rules applied. Total rules applied 3922 place count 277 transition count 596
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3926 place count 273 transition count 530
Iterating global reduction 9 with 4 rules applied. Total rules applied 3930 place count 273 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3934 place count 273 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3938 place count 271 transition count 524
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3940 place count 269 transition count 491
Iterating global reduction 10 with 2 rules applied. Total rules applied 3942 place count 269 transition count 491
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3944 place count 269 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3952 place count 265 transition count 516
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3957 place count 265 transition count 511
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 3979 place count 265 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3987 place count 261 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3993 place count 261 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 4014 place count 261 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 4022 place count 257 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 4028 place count 257 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 4049 place count 257 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 4057 place count 253 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4063 place count 253 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 4084 place count 253 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4092 place count 249 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 4098 place count 249 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 4119 place count 249 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4127 place count 245 transition count 518
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 4133 place count 245 transition count 512
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 4154 place count 245 transition count 491
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 4162 place count 241 transition count 518
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 4168 place count 241 transition count 512
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 4189 place count 241 transition count 491
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 4197 place count 237 transition count 518
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 4203 place count 237 transition count 512
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 4224 place count 237 transition count 491
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 4232 place count 233 transition count 519
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 4238 place count 233 transition count 513
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 4259 place count 233 transition count 492
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 4267 place count 229 transition count 519
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 4273 place count 229 transition count 513
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 4294 place count 229 transition count 492
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 4302 place count 225 transition count 519
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 4308 place count 225 transition count 513
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 4329 place count 225 transition count 492
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 4337 place count 221 transition count 519
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 4343 place count 221 transition count 513
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 4364 place count 221 transition count 492
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 4372 place count 217 transition count 519
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 4378 place count 217 transition count 513
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 4399 place count 217 transition count 492
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 4407 place count 213 transition count 520
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 4413 place count 213 transition count 514
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 4434 place count 213 transition count 493
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 4438 place count 211 transition count 498
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 4440 place count 211 transition count 496
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 26 with 5 rules applied. Total rules applied 4445 place count 211 transition count 491
Free-agglomeration rule applied 50 times.
Iterating global reduction 26 with 50 rules applied. Total rules applied 4495 place count 211 transition count 441
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Graph (complete) has 457 edges and 161 vertex of which 27 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.1 ms
Discarding 134 places :
Also discarding 182 output transitions
Drop transitions removed 182 transitions
Iterating post reduction 26 with 205 rules applied. Total rules applied 4700 place count 27 transition count 105
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 27 with 56 rules applied. Total rules applied 4756 place count 27 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 28 with 4 rules applied. Total rules applied 4760 place count 27 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 28 with 1 rules applied. Total rules applied 4761 place count 26 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 4763 place count 24 transition count 44
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 29 with 12 rules applied. Total rules applied 4775 place count 16 transition count 40
Drop transitions removed 4 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 29 with 16 rules applied. Total rules applied 4791 place count 16 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 30 with 12 rules applied. Total rules applied 4803 place count 8 transition count 20
Drop transitions removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 6 edges and 8 vertex of which 4 / 8 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 30 with 11 rules applied. Total rules applied 4814 place count 6 transition count 10
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 4818 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 32 with 2 Pre rules applied. Total rules applied 4818 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 4822 place count 4 transition count 4
Applied a total of 4822 rules in 690 ms. Remains 4 /2483 variables (removed 2479) and now considering 4/3183 (removed 3179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 691 ms. Remains : 4/2483 places, 4/3183 transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-08 12:58:37] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 2) seen :2
FORMULA DLCshifumi-PT-2b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 16193 ms.
ITS solved all properties within timeout

BK_STOP 1678280318393

--------------------
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 UpperBounds -timeout 360 -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="DLCshifumi-PT-2b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DLCshifumi-PT-2b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478800805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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