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.r395-oct2-167903719100701.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719100701
=====================================================================

--------------------
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 1679579659419

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 13:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:54:21] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2023-03-23 13:54:22] [INFO ] Transformed 7803 places.
[2023-03-23 13:54:22] [INFO ] Transformed 7103 transitions.
[2023-03-23 13:54:22] [INFO ] Found NUPN structural information;
[2023-03-23 13:54:22] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 722 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 7103 rows 7803 cols
[2023-03-23 13:54:22] [INFO ] Computed 1101 place invariants in 115 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 15) seen :7
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 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 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 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 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 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
[2023-03-23 13:54:22] [INFO ] Invariant cache hit.
[2023-03-23 13:54:26] [INFO ] [Real]Absence check using 1101 positive place invariants in 1562 ms returned sat
[2023-03-23 13:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:28] [INFO ] [Real]Absence check using state equation in 1829 ms returned unknown
[2023-03-23 13:54:30] [INFO ] [Real]Absence check using 1101 positive place invariants in 1140 ms returned sat
[2023-03-23 13:54:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:33] [INFO ] [Real]Absence check using state equation in 2445 ms returned unknown
[2023-03-23 13:54:35] [INFO ] [Real]Absence check using 1101 positive place invariants in 1116 ms returned sat
[2023-03-23 13:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:38] [INFO ] [Real]Absence check using state equation in 2375 ms returned unknown
[2023-03-23 13:54:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 773 ms returned sat
[2023-03-23 13:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:43] [INFO ] [Real]Absence check using state equation in 3152 ms returned unknown
[2023-03-23 13:54:45] [INFO ] [Real]Absence check using 1101 positive place invariants in 963 ms returned sat
[2023-03-23 13:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:48] [INFO ] [Real]Absence check using state equation in 2965 ms returned unknown
[2023-03-23 13:54:50] [INFO ] [Real]Absence check using 1101 positive place invariants in 811 ms returned sat
[2023-03-23 13:54:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:53] [INFO ] [Real]Absence check using state equation in 2782 ms returned unknown
[2023-03-23 13:54:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 1032 ms returned sat
[2023-03-23 13:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:54:58] [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 6
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-23 13:55:00] [INFO ] [Real]Absence check using 1101 positive place invariants in 1114 ms returned sat
[2023-03-23 13:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:55:03] [INFO ] [Real]Absence check using state equation in 2592 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 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions removed 1897 transitions
Trivial Post-agglo rules discarded 1897 transitions
Performed 1897 trivial Post agglomeration. Transition count delta: 1897
Iterating post reduction 0 with 1897 rules applied. Total rules applied 1897 place count 7803 transition count 5206
Reduce places removed 1897 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 1899 rules applied. Total rules applied 3796 place count 5906 transition count 5204
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 3799 place count 5905 transition count 5202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3801 place count 5903 transition count 5202
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 400 Pre rules applied. Total rules applied 3801 place count 5903 transition count 4802
Deduced a syphon composed of 400 places in 29 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 4 with 800 rules applied. Total rules applied 4601 place count 5503 transition count 4802
Discarding 698 places :
Symmetric choice reduction at 4 with 698 rule applications. Total rules 5299 place count 4805 transition count 4104
Iterating global reduction 4 with 698 rules applied. Total rules applied 5997 place count 4805 transition count 4104
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 299 Pre rules applied. Total rules applied 5997 place count 4805 transition count 3805
Deduced a syphon composed of 299 places in 31 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 598 rules applied. Total rules applied 6595 place count 4506 transition count 3805
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 26 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 4 with 3398 rules applied. Total rules applied 9993 place count 2807 transition count 2106
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 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10195 place count 2706 transition count 2106
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10397 place count 2605 transition count 2106
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 4 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 4 with 190 rules applied. Total rules applied 10587 place count 2510 transition count 2106
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10588 place count 2510 transition count 2105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10589 place count 2509 transition count 2105
Partial Free-agglomeration rule applied 297 times.
Drop transitions removed 297 transitions
Iterating global reduction 5 with 297 rules applied. Total rules applied 10886 place count 2509 transition count 2105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10887 place count 2508 transition count 2104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10888 place count 2507 transition count 2104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10888 place count 2507 transition count 2102
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 10892 place count 2505 transition count 2102
Applied a total of 10892 rules in 3221 ms. Remains 2505 /7803 variables (removed 5298) and now considering 2102/7103 (removed 5001) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3224 ms. Remains : 2505/7803 places, 2102/7103 transitions.
// Phase 1: matrix 2102 rows 2505 cols
[2023-03-23 13:55:06] [INFO ] Computed 1100 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12728 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 545050 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen 0
Interrupted Best-First random walk after 537598 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=107 ) properties seen 0
Interrupted Best-First random walk after 522616 steps, including 1 resets, run timeout after 5015 ms. (steps per millisecond=104 ) properties seen 0
Interrupted Best-First random walk after 498436 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
Interrupted Best-First random walk after 490993 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 508184 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 0
Interrupted Best-First random walk after 491254 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=98 ) properties seen 0
Interrupted Best-First random walk after 486367 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=97 ) properties seen 0
[2023-03-23 13:55:59] [INFO ] Invariant cache hit.
[2023-03-23 13:55:59] [INFO ] [Real]Absence check using 1100 positive place invariants in 194 ms returned sat
[2023-03-23 13:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:56:01] [INFO ] [Real]Absence check using state equation in 1572 ms returned sat
[2023-03-23 13:56:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:56:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 224 ms returned sat
[2023-03-23 13:56:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:56:03] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2023-03-23 13:56:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-23 13:56:03] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-23 13:56:03] [INFO ] Deduced a trap composed of 5 places in 346 ms of which 4 ms to minimize.
[2023-03-23 13:56:04] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-23 13:56:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1002 ms
[2023-03-23 13:56:04] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 163 ms.
[2023-03-23 13:56:24] [INFO ] Added : 620 causal constraints over 124 iterations in 20064 ms.(timeout) Result :sat
Minimization took 328 ms.
[2023-03-23 13:56:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 291 ms returned sat
[2023-03-23 13:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:56:26] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2023-03-23 13:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:56:27] [INFO ] [Nat]Absence check using 1100 positive place invariants in 259 ms returned sat
[2023-03-23 13:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:56:28] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2023-03-23 13:56:28] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2023-03-23 13:56:29] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2023-03-23 13:56:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-23 13:56:29] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 100 ms.
[2023-03-23 13:56:49] [INFO ] Added : 745 causal constraints over 149 iterations in 20065 ms.(timeout) Result :sat
Minimization took 409 ms.
[2023-03-23 13:56:50] [INFO ] [Real]Absence check using 1100 positive place invariants in 253 ms returned sat
[2023-03-23 13:56:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:56:51] [INFO ] [Real]Absence check using state equation in 1128 ms returned sat
[2023-03-23 13:56:51] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-23 13:56:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:56:52] [INFO ] [Nat]Absence check using 1100 positive place invariants in 338 ms returned sat
[2023-03-23 13:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:56:53] [INFO ] [Nat]Absence check using state equation in 1414 ms returned sat
[2023-03-23 13:56:53] [INFO ] [Nat]Added 3 Read/Feed constraints in 28 ms returned sat
[2023-03-23 13:56:54] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 145 ms.
[2023-03-23 13:57:14] [INFO ] Added : 675 causal constraints over 135 iterations in 20245 ms.(timeout) Result :sat
Minimization took 403 ms.
[2023-03-23 13:57:15] [INFO ] [Real]Absence check using 1100 positive place invariants in 261 ms returned sat
[2023-03-23 13:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:57:16] [INFO ] [Real]Absence check using state equation in 1112 ms returned sat
[2023-03-23 13:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:57:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 221 ms returned sat
[2023-03-23 13:57:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:57:18] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2023-03-23 13:57:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-23 13:57:18] [INFO ] Deduced a trap composed of 5 places in 477 ms of which 2 ms to minimize.
[2023-03-23 13:57:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 667 ms
[2023-03-23 13:57:18] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 132 ms.
[2023-03-23 13:57:38] [INFO ] Added : 635 causal constraints over 127 iterations in 20119 ms.(timeout) Result :sat
Minimization took 315 ms.
[2023-03-23 13:57:40] [INFO ] [Real]Absence check using 1100 positive place invariants in 635 ms returned sat
[2023-03-23 13:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:57:41] [INFO ] [Real]Absence check using state equation in 1135 ms returned sat
[2023-03-23 13:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:57:42] [INFO ] [Nat]Absence check using 1100 positive place invariants in 251 ms returned sat
[2023-03-23 13:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:57:43] [INFO ] [Nat]Absence check using state equation in 1157 ms returned sat
[2023-03-23 13:57:43] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-23 13:57:43] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-23 13:57:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2023-03-23 13:57:44] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 152 ms.
[2023-03-23 13:58:04] [INFO ] Added : 590 causal constraints over 118 iterations in 20124 ms.(timeout) Result :sat
Minimization took 318 ms.
[2023-03-23 13:58:05] [INFO ] [Real]Absence check using 1100 positive place invariants in 254 ms returned sat
[2023-03-23 13:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:58:06] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2023-03-23 13:58:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:58:06] [INFO ] [Nat]Absence check using 1100 positive place invariants in 255 ms returned sat
[2023-03-23 13:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:58:08] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2023-03-23 13:58:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-23 13:58:08] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 160 ms.
[2023-03-23 13:58:28] [INFO ] Added : 555 causal constraints over 111 iterations in 20082 ms.(timeout) Result :sat
Minimization took 341 ms.
[2023-03-23 13:58:29] [INFO ] [Real]Absence check using 1100 positive place invariants in 261 ms returned sat
[2023-03-23 13:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:58:30] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2023-03-23 13:58:30] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-03-23 13:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:58:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 277 ms returned sat
[2023-03-23 13:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:58:32] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2023-03-23 13:58:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 23 ms returned sat
[2023-03-23 13:58:33] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 140 ms.
[2023-03-23 13:58:53] [INFO ] Added : 565 causal constraints over 113 iterations in 20037 ms.(timeout) Result :sat
Minimization took 297 ms.
[2023-03-23 13:58:54] [INFO ] [Real]Absence check using 1100 positive place invariants in 250 ms returned sat
[2023-03-23 13:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:58:55] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2023-03-23 13:58:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:58:55] [INFO ] [Nat]Absence check using 1100 positive place invariants in 249 ms returned sat
[2023-03-23 13:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:58:57] [INFO ] [Nat]Absence check using state equation in 1217 ms returned sat
[2023-03-23 13:58:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-03-23 13:58:57] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-23 13:58:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 517 ms
[2023-03-23 13:58:57] [INFO ] Computed and/alt/rep : 2098/4960/2098 causal constraints (skipped 0 transitions) in 218 ms.
[2023-03-23 13:59:17] [INFO ] Added : 540 causal constraints over 108 iterations in 20112 ms.(timeout) Result :sat
Minimization took 370 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 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-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 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-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 300585 ms.
ITS solved all properties within timeout

BK_STOP 1679579962234

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.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="smartxred"
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 smartxred"
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 r395-oct2-167903719100701"
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 ;