fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r198-tall-174894533000597
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ShieldIIPt-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 277078.00 0.00 0.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533000597.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
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 r198-tall-174894533000597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:32 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

echo here is the order used to build the result vector(from xml 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 1749180040012

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-06 03:20:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 03:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 03:20:41] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2025-06-06 03:20:41] [INFO ] Transformed 7003 places.
[2025-06-06 03:20:41] [INFO ] Transformed 6503 transitions.
[2025-06-06 03:20:41] [INFO ] Found NUPN structural information;
[2025-06-06 03:20:41] [INFO ] Parsed PT model containing 7003 places and 6503 transitions and 16206 arcs in 666 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 6503 rows 7003 cols
[2025-06-06 03:20:42] [INFO ] Computed 901 invariants in 78 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 189 ms. (52 steps per ms)
FORMULA ShieldIIPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 132 ms. (676 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-06 03:20:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:20:44] [INFO ] [Real]Absence check using 901 positive place invariants in 691 ms returned sat
[2025-06-06 03:20:47] [INFO ] [Real]Absence check using state equation in 2953 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:20:49] [INFO ] [Real]Absence check using 901 positive place invariants in 690 ms returned sat
[2025-06-06 03:20:52] [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 1
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:20:54] [INFO ] [Real]Absence check using 901 positive place invariants in 676 ms returned sat
[2025-06-06 03:20:57] [INFO ] [Real]Absence check using state equation in 3286 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:20:59] [INFO ] [Real]Absence check using 901 positive place invariants in 680 ms returned sat
[2025-06-06 03:21:02] [INFO ] [Real]Absence check using state equation in 3163 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:21:04] [INFO ] [Real]Absence check using 901 positive place invariants in 709 ms returned sat
[2025-06-06 03:21:07] [INFO ] [Real]Absence check using state equation in 3137 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:21:09] [INFO ] [Real]Absence check using 901 positive place invariants in 694 ms returned sat
[2025-06-06 03:21:12] [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 5
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:21:14] [INFO ] [Real]Absence check using 901 positive place invariants in 702 ms returned sat
[2025-06-06 03:21:17] [INFO ] [Real]Absence check using state equation in 3196 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:21:19] [INFO ] [Real]Absence check using 901 positive place invariants in 681 ms returned sat
[2025-06-06 03:21:22] [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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-06 03:21:24] [INFO ] [Real]Absence check using 901 positive place invariants in 689 ms returned sat
[2025-06-06 03:21:27] [INFO ] [Real]Absence check using state equation in 3126 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 7003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7003/7003 places, 6503/6503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1697 transitions
Trivial Post-agglo rules discarded 1697 transitions
Performed 1697 trivial Post agglomeration. Transition count delta: 1697
Iterating post reduction 0 with 1697 rules applied. Total rules applied 1697 place count 7003 transition count 4806
Reduce places removed 1697 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1699 rules applied. Total rules applied 3396 place count 5306 transition count 4804
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 3399 place count 5305 transition count 4802
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 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 4 with 400 Pre rules applied. Total rules applied 3401 place count 5303 transition count 4402
Deduced a syphon composed of 400 places in 21 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 4 with 800 rules applied. Total rules applied 4201 place count 4903 transition count 4402
Discarding 696 places :
Symmetric choice reduction at 4 with 696 rule applications. Total rules 4897 place count 4207 transition count 3706
Iterating global reduction 4 with 696 rules applied. Total rules applied 5593 place count 4207 transition count 3706
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 296 Pre rules applied. Total rules applied 5593 place count 4207 transition count 3410
Deduced a syphon composed of 296 places in 16 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 6185 place count 3911 transition count 3410
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 5 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 4 with 3402 rules applied. Total rules applied 9587 place count 2210 transition count 1709
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 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9789 place count 2109 transition count 1775
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 9991 place count 2008 transition count 1840
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -62
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 10181 place count 1913 transition count 1902
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10182 place count 1913 transition count 1901
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10183 place count 1913 transition count 1900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10184 place count 1912 transition count 1900
Partial Free-agglomeration rule applied 100 times.
Drop transitions (Partial Free agglomeration) removed 100 transitions
Iterating global reduction 6 with 100 rules applied. Total rules applied 10284 place count 1912 transition count 1900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10285 place count 1911 transition count 1899
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 10287 place count 1909 transition count 1899
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 10287 place count 1909 transition count 1898
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 10289 place count 1908 transition count 1898
Applied a total of 10289 rules in 2567 ms. Remains 1908 /7003 variables (removed 5095) and now considering 1898/6503 (removed 4605) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2579 ms. Remains : 1908/7003 places, 1898/6503 transitions.
// Phase 1: matrix 1898 rows 1908 cols
[2025-06-06 03:21:30] [INFO ] Computed 899 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 13850 ms. (72 steps per ms)
FORMULA ShieldIIPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3436063 steps (7 resets) in 35007 ms. (98 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-06 03:22:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:22:19] [INFO ] [Real]Absence check using 899 positive place invariants in 141 ms returned sat
[2025-06-06 03:22:20] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2025-06-06 03:22:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-06 03:22:20] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-06 03:22:20] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 89 ms.
[2025-06-06 03:22:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:22:21] [INFO ] [Nat]Absence check using 899 positive place invariants in 140 ms returned sat
[2025-06-06 03:22:21] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2025-06-06 03:22:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-06 03:22:22] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 85 ms.
[2025-06-06 03:22:42] [INFO ] Added : 910 causal constraints over 182 iterations in 20075 ms.(timeout) Result :sat
Minimization took 1041 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:22:43] [INFO ] [Real]Absence check using 899 positive place invariants in 140 ms returned sat
[2025-06-06 03:22:44] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2025-06-06 03:22:44] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-06 03:22:44] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 85 ms.
[2025-06-06 03:22:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:22:45] [INFO ] [Nat]Absence check using 899 positive place invariants in 147 ms returned sat
[2025-06-06 03:22:45] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2025-06-06 03:22:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:22:45] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 85 ms.
[2025-06-06 03:23:05] [INFO ] Added : 890 causal constraints over 178 iterations in 20161 ms.(timeout) Result :sat
Minimization took 982 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:23:07] [INFO ] [Real]Absence check using 899 positive place invariants in 154 ms returned sat
[2025-06-06 03:23:08] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2025-06-06 03:23:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:23:08] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 89 ms.
[2025-06-06 03:23:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:23:08] [INFO ] [Nat]Absence check using 899 positive place invariants in 157 ms returned sat
[2025-06-06 03:23:09] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2025-06-06 03:23:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:23:09] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 88 ms.
[2025-06-06 03:23:29] [INFO ] Added : 905 causal constraints over 181 iterations in 20191 ms.(timeout) Result :sat
Minimization took 965 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:23:31] [INFO ] [Real]Absence check using 899 positive place invariants in 140 ms returned sat
[2025-06-06 03:23:31] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2025-06-06 03:23:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:23:32] [INFO ] [Nat]Absence check using 899 positive place invariants in 153 ms returned sat
[2025-06-06 03:23:33] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2025-06-06 03:23:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:23:33] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 92 ms.
[2025-06-06 03:23:53] [INFO ] Added : 900 causal constraints over 180 iterations in 20084 ms.(timeout) Result :sat
Minimization took 1028 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:23:54] [INFO ] [Real]Absence check using 899 positive place invariants in 149 ms returned sat
[2025-06-06 03:23:55] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2025-06-06 03:23:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-06 03:23:55] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 89 ms.
[2025-06-06 03:23:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:23:56] [INFO ] [Nat]Absence check using 899 positive place invariants in 154 ms returned sat
[2025-06-06 03:23:57] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2025-06-06 03:23:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-06 03:23:57] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 78 ms.
[2025-06-06 03:24:17] [INFO ] Added : 910 causal constraints over 182 iterations in 20113 ms.(timeout) Result :sat
Minimization took 1053 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:24:18] [INFO ] [Real]Absence check using 899 positive place invariants in 137 ms returned sat
[2025-06-06 03:24:19] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2025-06-06 03:24:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:24:19] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 97 ms.
[2025-06-06 03:24:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:24:20] [INFO ] [Nat]Absence check using 899 positive place invariants in 154 ms returned sat
[2025-06-06 03:24:20] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2025-06-06 03:24:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:24:21] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 96 ms.
[2025-06-06 03:24:41] [INFO ] Added : 930 causal constraints over 186 iterations in 20100 ms.(timeout) Result :sat
Minimization took 959 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:24:42] [INFO ] [Real]Absence check using 899 positive place invariants in 142 ms returned sat
[2025-06-06 03:24:43] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2025-06-06 03:24:43] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-06 03:24:43] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 83 ms.
[2025-06-06 03:24:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-06 03:24:43] [INFO ] [Nat]Absence check using 899 positive place invariants in 143 ms returned sat
[2025-06-06 03:24:44] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2025-06-06 03:24:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-06 03:24:44] [INFO ] Computed and/alt/rep : 1895/3385/1895 causal constraints (skipped 0 transitions) in 71 ms.
[2025-06-06 03:25:04] [INFO ] Added : 925 causal constraints over 185 iterations in 20193 ms.(timeout) Result :sat
Minimization took 1063 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldIIPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-100B-UpperBounds-10 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-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-06 03:25:16] [INFO ] Flatten gal took : 206 ms
[2025-06-06 03:25:16] [INFO ] Flatten gal took : 107 ms
[2025-06-06 03:25:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10632084335326966905.gal : 41 ms
[2025-06-06 03:25:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11978409182604046583.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10632084335326966905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11978409182604046583.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 275860 ms.

BK_STOP 1749180317090

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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-5832"
echo " Executing tool itstools"
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 r198-tall-174894533000597"
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.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 ;