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.r391-oct2-167903715600701.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 lolaxred
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600701
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 21:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 21:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 21:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 21:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.9M Mar 5 18:23 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 ShieldPPPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679281652185

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=ShieldPPPt-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 03:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 03:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 03:07:35] [INFO ] Load time of PNML (sax parser for PT used): 291 ms
[2023-03-20 03:07:35] [INFO ] Transformed 7803 places.
[2023-03-20 03:07:35] [INFO ] Transformed 7103 transitions.
[2023-03-20 03:07:35] [INFO ] Found NUPN structural information;
[2023-03-20 03:07:35] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 781 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-20 03:07:36] [INFO ] Computed 1101 place invariants in 133 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 15) seen :6
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
[2023-03-20 03:07:36] [INFO ] Invariant cache hit.
[2023-03-20 03:07:40] [INFO ] [Real]Absence check using 1101 positive place invariants in 1635 ms returned sat
[2023-03-20 03:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:41] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-20 03:07:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 1190 ms returned sat
[2023-03-20 03:07:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:47] [INFO ] [Real]Absence check using state equation in 1808 ms returned unknown
[2023-03-20 03:07:49] [INFO ] [Real]Absence check using 1101 positive place invariants in 1152 ms returned sat
[2023-03-20 03:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:52] [INFO ] [Real]Absence check using state equation in 2324 ms returned unknown
[2023-03-20 03:07:54] [INFO ] [Real]Absence check using 1101 positive place invariants in 964 ms returned sat
[2023-03-20 03:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:07:57] [INFO ] [Real]Absence check using state equation in 2386 ms returned unknown
[2023-03-20 03:08:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 1604 ms returned sat
[2023-03-20 03:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:08:02] [INFO ] [Real]Absence check using state equation in 1725 ms returned unknown
[2023-03-20 03:08:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 789 ms returned sat
[2023-03-20 03:08:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:08:07] [INFO ] [Real]Absence check using state equation in 2752 ms returned unknown
[2023-03-20 03:08:09] [INFO ] [Real]Absence check using 1101 positive place invariants in 819 ms returned sat
[2023-03-20 03:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:08:12] [INFO ] [Real]Absence check using state equation in 2746 ms returned unknown
[2023-03-20 03:08:14] [INFO ] [Real]Absence check using 1101 positive place invariants in 1150 ms returned sat
[2023-03-20 03:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:08:17] [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: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-20 03:08:19] [INFO ] [Real]Absence check using 1101 positive place invariants in 1048 ms returned sat
[2023-03-20 03:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:08:22] [INFO ] [Real]Absence check using state equation in 2554 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1895 transitions
Trivial Post-agglo rules discarded 1895 transitions
Performed 1895 trivial Post agglomeration. Transition count delta: 1895
Iterating post reduction 0 with 1895 rules applied. Total rules applied 1895 place count 7803 transition count 5208
Reduce places removed 1895 places and 0 transitions.
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 1 with 1897 rules applied. Total rules applied 3792 place count 5908 transition count 5206
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 3797 place count 5907 transition count 5202
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 3801 place count 5903 transition count 5202
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 399 Pre rules applied. Total rules applied 3801 place count 5903 transition count 4803
Deduced a syphon composed of 399 places in 28 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 4 with 798 rules applied. Total rules applied 4599 place count 5504 transition count 4803
Discarding 698 places :
Symmetric choice reduction at 4 with 698 rule applications. Total rules 5297 place count 4806 transition count 4105
Iterating global reduction 4 with 698 rules applied. Total rules applied 5995 place count 4806 transition count 4105
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 299 Pre rules applied. Total rules applied 5995 place count 4806 transition count 3806
Deduced a syphon composed of 299 places in 24 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 6593 place count 4507 transition count 3806
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 9 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 4 with 3396 rules applied. Total rules applied 9989 place count 2809 transition count 2108
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 13 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10191 place count 2708 transition count 2108
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10393 place count 2607 transition count 2108
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 10583 place count 2512 transition count 2108
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10584 place count 2512 transition count 2107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10585 place count 2511 transition count 2107
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 5 with 297 rules applied. Total rules applied 10882 place count 2511 transition count 2107
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10883 place count 2510 transition count 2106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10884 place count 2509 transition count 2106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10884 place count 2509 transition count 2104
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10888 place count 2507 transition count 2104
Applied a total of 10888 rules in 4404 ms. Remains 2507 /7803 variables (removed 5296) and now considering 2104/7103 (removed 4999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4405 ms. Remains : 2507/7803 places, 2104/7103 transitions.
// Phase 1: matrix 2104 rows 2507 cols
[2023-03-20 03:08:26] [INFO ] Computed 1100 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13426 ms. (steps per millisecond=74 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 495021 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 493199 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 526027 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=105 ) properties seen 0
Interrupted Best-First random walk after 525024 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 1
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 534443 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen 0
Interrupted Best-First random walk after 518403 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen 0
Interrupted Best-First random walk after 524796 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen 0
[2023-03-20 03:09:15] [INFO ] Invariant cache hit.
[2023-03-20 03:09:15] [INFO ] [Real]Absence check using 1100 positive place invariants in 342 ms returned sat
[2023-03-20 03:09:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:09:17] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2023-03-20 03:09:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:09:17] [INFO ] [Nat]Absence check using 1100 positive place invariants in 265 ms returned sat
[2023-03-20 03:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:09:19] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2023-03-20 03:09:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 03:09:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-20 03:09:19] [INFO ] Deduced a trap composed of 6 places in 607 ms of which 5 ms to minimize.
[2023-03-20 03:09:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 868 ms
[2023-03-20 03:09:20] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 297 ms.
[2023-03-20 03:09:40] [INFO ] Added : 635 causal constraints over 127 iterations in 20175 ms.(timeout) Result :sat
Minimization took 350 ms.
[2023-03-20 03:09:41] [INFO ] [Real]Absence check using 1100 positive place invariants in 405 ms returned sat
[2023-03-20 03:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:09:42] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2023-03-20 03:09:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:09:43] [INFO ] [Nat]Absence check using 1100 positive place invariants in 222 ms returned sat
[2023-03-20 03:09:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:09:44] [INFO ] [Nat]Absence check using state equation in 1228 ms returned sat
[2023-03-20 03:09:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-20 03:09:44] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 163 ms.
[2023-03-20 03:10:04] [INFO ] Added : 640 causal constraints over 128 iterations in 20094 ms.(timeout) Result :sat
Minimization took 361 ms.
[2023-03-20 03:10:06] [INFO ] [Real]Absence check using 1100 positive place invariants in 410 ms returned sat
[2023-03-20 03:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:10:07] [INFO ] [Real]Absence check using state equation in 1146 ms returned sat
[2023-03-20 03:10:07] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-20 03:10:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:10:07] [INFO ] [Nat]Absence check using 1100 positive place invariants in 265 ms returned sat
[2023-03-20 03:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:10:09] [INFO ] [Nat]Absence check using state equation in 1500 ms returned sat
[2023-03-20 03:10:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-20 03:10:09] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-20 03:10:09] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-20 03:10:10] [INFO ] Deduced a trap composed of 7 places in 360 ms of which 1 ms to minimize.
[2023-03-20 03:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1148 ms
[2023-03-20 03:10:10] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 273 ms.
[2023-03-20 03:10:30] [INFO ] Added : 650 causal constraints over 130 iterations in 20104 ms.(timeout) Result :sat
Minimization took 320 ms.
[2023-03-20 03:10:31] [INFO ] [Real]Absence check using 1100 positive place invariants in 250 ms returned sat
[2023-03-20 03:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:10:33] [INFO ] [Real]Absence check using state equation in 1321 ms returned sat
[2023-03-20 03:10:33] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-20 03:10:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:10:33] [INFO ] [Nat]Absence check using 1100 positive place invariants in 240 ms returned sat
[2023-03-20 03:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:10:35] [INFO ] [Nat]Absence check using state equation in 1243 ms returned sat
[2023-03-20 03:10:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-20 03:10:35] [INFO ] Deduced a trap composed of 6 places in 268 ms of which 1 ms to minimize.
[2023-03-20 03:10:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 509 ms
[2023-03-20 03:10:35] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 150 ms.
[2023-03-20 03:10:55] [INFO ] Added : 620 causal constraints over 124 iterations in 20159 ms.(timeout) Result :sat
Minimization took 307 ms.
[2023-03-20 03:10:56] [INFO ] [Real]Absence check using 1100 positive place invariants in 258 ms returned sat
[2023-03-20 03:10:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:10:58] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2023-03-20 03:10:58] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-20 03:10:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:10:58] [INFO ] [Nat]Absence check using 1100 positive place invariants in 238 ms returned sat
[2023-03-20 03:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:11:00] [INFO ] [Nat]Absence check using state equation in 1526 ms returned sat
[2023-03-20 03:11:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-20 03:11:00] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-20 03:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2023-03-20 03:11:01] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 151 ms.
[2023-03-20 03:11:21] [INFO ] Added : 635 causal constraints over 127 iterations in 20132 ms.(timeout) Result :sat
Minimization took 303 ms.
[2023-03-20 03:11:22] [INFO ] [Real]Absence check using 1100 positive place invariants in 446 ms returned sat
[2023-03-20 03:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:11:23] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2023-03-20 03:11:23] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-20 03:11:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:11:24] [INFO ] [Nat]Absence check using 1100 positive place invariants in 300 ms returned sat
[2023-03-20 03:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:11:25] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2023-03-20 03:11:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-20 03:11:26] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 14 ms to minimize.
[2023-03-20 03:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-20 03:11:26] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 115 ms.
[2023-03-20 03:11:46] [INFO ] Added : 665 causal constraints over 133 iterations in 20111 ms.(timeout) Result :sat
Minimization took 344 ms.
[2023-03-20 03:11:47] [INFO ] [Real]Absence check using 1100 positive place invariants in 300 ms returned sat
[2023-03-20 03:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 03:11:48] [INFO ] [Real]Absence check using state equation in 1367 ms returned sat
[2023-03-20 03:11:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 03:11:49] [INFO ] [Nat]Absence check using 1100 positive place invariants in 399 ms returned sat
[2023-03-20 03:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 03:11:51] [INFO ] [Nat]Absence check using state equation in 1783 ms returned sat
[2023-03-20 03:11:51] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-20 03:11:52] [INFO ] Deduced a trap composed of 6 places in 420 ms of which 1 ms to minimize.
[2023-03-20 03:11:52] [INFO ] Deduced a trap composed of 7 places in 421 ms of which 1 ms to minimize.
[2023-03-20 03:11:53] [INFO ] Deduced a trap composed of 6 places in 649 ms of which 1 ms to minimize.
[2023-03-20 03:11:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1879 ms
[2023-03-20 03:11:53] [INFO ] Computed and/alt/rep : 2100/4962/2100 causal constraints (skipped 0 transitions) in 140 ms.
[2023-03-20 03:12:13] [INFO ] Added : 625 causal constraints over 125 iterations in 20138 ms.(timeout) Result :sat
Minimization took 388 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 282889 ms.
ITS solved all properties within timeout

BK_STOP 1679281938325

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ShieldPPPt-PT-100B"
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 ShieldPPPt-PT-100B, 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 r391-oct2-167903715600701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B 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 ;