About the Execution of LTSMin+red for ShieldIIPt-PT-100B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2009.000 | 293725.00 | 336778.00 | 37.60 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716900349.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900349
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 25 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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.7M 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 ShieldIIPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-100B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679442794150
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:53:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 23:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:53:17] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2023-03-21 23:53:17] [INFO ] Transformed 7003 places.
[2023-03-21 23:53:17] [INFO ] Transformed 6503 transitions.
[2023-03-21 23:53:17] [INFO ] Found NUPN structural information;
[2023-03-21 23:53:17] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 827 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 6503 rows 7003 cols
[2023-03-21 23:53:17] [INFO ] Computed 901 place invariants in 112 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
[2023-03-21 23:53:18] [INFO ] Invariant cache hit.
[2023-03-21 23:53:20] [INFO ] [Real]Absence check using 901 positive place invariants in 1136 ms returned sat
[2023-03-21 23:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:23] [INFO ] [Real]Absence check using state equation in 2359 ms returned unknown
[2023-03-21 23:53:25] [INFO ] [Real]Absence check using 901 positive place invariants in 824 ms returned sat
[2023-03-21 23:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:28] [INFO ] [Real]Absence check using state equation in 2912 ms returned unknown
[2023-03-21 23:53:30] [INFO ] [Real]Absence check using 901 positive place invariants in 648 ms returned sat
[2023-03-21 23:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:33] [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 2
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-21 23:53:35] [INFO ] [Real]Absence check using 901 positive place invariants in 658 ms returned sat
[2023-03-21 23:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:38] [INFO ] [Real]Absence check using state equation in 3288 ms returned unknown
[2023-03-21 23:53:40] [INFO ] [Real]Absence check using 901 positive place invariants in 922 ms returned sat
[2023-03-21 23:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:43] [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 4
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.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-21 23:53:45] [INFO ] [Real]Absence check using 901 positive place invariants in 778 ms returned sat
[2023-03-21 23:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:48] [INFO ] [Real]Absence check using state equation in 3049 ms returned unknown
[2023-03-21 23:53:50] [INFO ] [Real]Absence check using 901 positive place invariants in 671 ms returned sat
[2023-03-21 23:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:53] [INFO ] [Real]Absence check using state equation in 3173 ms returned unknown
[2023-03-21 23:53:55] [INFO ] [Real]Absence check using 901 positive place invariants in 725 ms returned sat
[2023-03-21 23:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:53:58] [INFO ] [Real]Absence check using state equation in 3085 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions removed 1699 transitions
Trivial Post-agglo rules discarded 1699 transitions
Performed 1699 trivial Post agglomeration. Transition count delta: 1699
Iterating post reduction 0 with 1699 rules applied. Total rules applied 1699 place count 7003 transition count 4804
Reduce places removed 1699 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 1701 rules applied. Total rules applied 3400 place count 5304 transition count 4802
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3401 place count 5303 transition count 4802
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 3401 place count 5303 transition count 4402
Deduced a syphon composed of 400 places in 20 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 4201 place count 4903 transition count 4402
Discarding 696 places :
Symmetric choice reduction at 3 with 696 rule applications. Total rules 4897 place count 4207 transition count 3706
Iterating global reduction 3 with 696 rules applied. Total rules applied 5593 place count 4207 transition count 3706
Performed 298 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 298 Pre rules applied. Total rules applied 5593 place count 4207 transition count 3408
Deduced a syphon composed of 298 places in 43 ms
Reduce places removed 298 places and 0 transitions.
Iterating global reduction 3 with 596 rules applied. Total rules applied 6189 place count 3909 transition count 3408
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 8 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 3 with 3402 rules applied. Total rules applied 9591 place count 2208 transition count 1707
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9793 place count 2107 transition count 1773
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9995 place count 2006 transition count 1838
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 10187 place count 1910 transition count 1903
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10188 place count 1910 transition count 1902
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10189 place count 1910 transition count 1901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10190 place count 1909 transition count 1901
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 10290 place count 1909 transition count 1901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10291 place count 1908 transition count 1900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 10293 place count 1906 transition count 1900
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 10293 place count 1906 transition count 1899
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 10295 place count 1905 transition count 1899
Applied a total of 10295 rules in 2782 ms. Remains 1905 /7003 variables (removed 5098) and now considering 1899/6503 (removed 4604) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2782 ms. Remains : 1905/7003 places, 1899/6503 transitions.
// Phase 1: matrix 1899 rows 1905 cols
[2023-03-21 23:54:01] [INFO ] Computed 899 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 14141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 491404 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 464451 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 502548 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=100 ) properties seen 0
Interrupted Best-First random walk after 495009 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 505620 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 474171 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 485847 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
Interrupted Best-First random walk after 479691 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=95 ) properties seen 0
[2023-03-21 23:54:55] [INFO ] Invariant cache hit.
[2023-03-21 23:54:56] [INFO ] [Real]Absence check using 899 positive place invariants in 203 ms returned sat
[2023-03-21 23:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:54:56] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2023-03-21 23:54:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:54:57] [INFO ] [Nat]Absence check using 899 positive place invariants in 188 ms returned sat
[2023-03-21 23:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:54:58] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2023-03-21 23:54:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:54:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-21 23:54:58] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 176 ms.
[2023-03-21 23:55:18] [INFO ] Added : 640 causal constraints over 128 iterations in 20142 ms.(timeout) Result :sat
Minimization took 335 ms.
[2023-03-21 23:55:19] [INFO ] [Real]Absence check using 899 positive place invariants in 350 ms returned sat
[2023-03-21 23:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:55:20] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2023-03-21 23:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:55:21] [INFO ] [Nat]Absence check using 899 positive place invariants in 270 ms returned sat
[2023-03-21 23:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:55:22] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-03-21 23:55:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 23:55:22] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 135 ms.
[2023-03-21 23:55:42] [INFO ] Added : 620 causal constraints over 124 iterations in 20193 ms.(timeout) Result :sat
Minimization took 281 ms.
[2023-03-21 23:55:43] [INFO ] [Real]Absence check using 899 positive place invariants in 194 ms returned sat
[2023-03-21 23:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:55:44] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-21 23:55:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:55:45] [INFO ] [Nat]Absence check using 899 positive place invariants in 193 ms returned sat
[2023-03-21 23:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:55:46] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2023-03-21 23:55:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2023-03-21 23:55:46] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 127 ms.
[2023-03-21 23:56:06] [INFO ] Added : 665 causal constraints over 133 iterations in 20043 ms.(timeout) Result :sat
Minimization took 316 ms.
[2023-03-21 23:56:07] [INFO ] [Real]Absence check using 899 positive place invariants in 168 ms returned sat
[2023-03-21 23:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:56:07] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2023-03-21 23:56:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:56:08] [INFO ] [Nat]Absence check using 899 positive place invariants in 176 ms returned sat
[2023-03-21 23:56:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:56:09] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2023-03-21 23:56:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2023-03-21 23:56:09] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-21 23:56:29] [INFO ] Added : 630 causal constraints over 126 iterations in 20187 ms.(timeout) Result :sat
Minimization took 337 ms.
[2023-03-21 23:56:30] [INFO ] [Real]Absence check using 899 positive place invariants in 298 ms returned sat
[2023-03-21 23:56:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:56:31] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2023-03-21 23:56:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:56:32] [INFO ] [Nat]Absence check using 899 positive place invariants in 349 ms returned sat
[2023-03-21 23:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:56:33] [INFO ] [Nat]Absence check using state equation in 1039 ms returned sat
[2023-03-21 23:56:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2023-03-21 23:56:33] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 119 ms.
[2023-03-21 23:56:53] [INFO ] Added : 665 causal constraints over 133 iterations in 20272 ms.(timeout) Result :sat
Minimization took 328 ms.
[2023-03-21 23:56:54] [INFO ] [Real]Absence check using 899 positive place invariants in 224 ms returned sat
[2023-03-21 23:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:56:55] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2023-03-21 23:56:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:56:56] [INFO ] [Nat]Absence check using 899 positive place invariants in 173 ms returned sat
[2023-03-21 23:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:56:57] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2023-03-21 23:56:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-21 23:56:57] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-21 23:57:17] [INFO ] Added : 620 causal constraints over 124 iterations in 20080 ms.(timeout) Result :sat
Minimization took 319 ms.
[2023-03-21 23:57:18] [INFO ] [Real]Absence check using 899 positive place invariants in 258 ms returned sat
[2023-03-21 23:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:57:19] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2023-03-21 23:57:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:57:19] [INFO ] [Nat]Absence check using 899 positive place invariants in 180 ms returned sat
[2023-03-21 23:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:57:20] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2023-03-21 23:57:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-21 23:57:20] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-21 23:57:40] [INFO ] Added : 665 causal constraints over 133 iterations in 20058 ms.(timeout) Result :sat
Minimization took 362 ms.
[2023-03-21 23:57:41] [INFO ] [Real]Absence check using 899 positive place invariants in 211 ms returned sat
[2023-03-21 23:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:57:42] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2023-03-21 23:57:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:57:43] [INFO ] [Nat]Absence check using 899 positive place invariants in 175 ms returned sat
[2023-03-21 23:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:57:43] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2023-03-21 23:57:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 23:57:44] [INFO ] Computed and/alt/rep : 1896/3390/1896 causal constraints (skipped 0 transitions) in 121 ms.
[2023-03-21 23:58:04] [INFO ] Added : 640 causal constraints over 128 iterations in 20039 ms.(timeout) Result :sat
Minimization took 386 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA ShieldIIPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 291151 ms.
ITS solved all properties within timeout
BK_STOP 1679443087875
--------------------
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="ShieldIIPt-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-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 r393-oct2-167903716900349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-100B.tgz
mv ShieldIIPt-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 '
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 ;