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.r389-oct2-167903713800651.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 itstools
Input is ShieldPPPt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679218668721

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 09:37:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 09:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:37:51] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2023-03-19 09:37:51] [INFO ] Transformed 2343 places.
[2023-03-19 09:37:51] [INFO ] Transformed 2133 transitions.
[2023-03-19 09:37:51] [INFO ] Found NUPN structural information;
[2023-03-19 09:37:51] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 475 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 323 places :
Symmetric choice reduction at 0 with 323 rule applications. Total rules 323 place count 2020 transition count 1810
Iterating global reduction 0 with 323 rules applied. Total rules applied 646 place count 2020 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 647 place count 2019 transition count 1809
Iterating global reduction 0 with 1 rules applied. Total rules applied 648 place count 2019 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 2018 transition count 1808
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 2018 transition count 1808
Applied a total of 650 rules in 968 ms. Remains 2018 /2343 variables (removed 325) and now considering 1808/2133 (removed 325) transitions.
// Phase 1: matrix 1808 rows 2018 cols
[2023-03-19 09:37:53] [INFO ] Computed 331 place invariants in 26 ms
[2023-03-19 09:37:54] [INFO ] Implicit Places using invariants in 1494 ms returned []
[2023-03-19 09:37:54] [INFO ] Invariant cache hit.
[2023-03-19 09:37:57] [INFO ] Implicit Places using invariants and state equation in 3311 ms returned []
Implicit Place search using SMT with State Equation took 4865 ms to find 0 implicit places.
[2023-03-19 09:37:57] [INFO ] Invariant cache hit.
[2023-03-19 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 2105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2018/2343 places, 1808/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7963 ms. Remains : 2018/2343 places, 1808/2133 transitions.
Support contains 23 out of 2018 places after structural reductions.
[2023-03-19 09:38:01] [INFO ] Flatten gal took : 727 ms
[2023-03-19 09:38:01] [INFO ] Flatten gal took : 89 ms
[2023-03-19 09:38:01] [INFO ] Input system was already deterministic with 1808 transitions.
Support contains 22 out of 2018 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 09:38:02] [INFO ] Invariant cache hit.
[2023-03-19 09:38:02] [INFO ] [Real]Absence check using 331 positive place invariants in 200 ms returned sat
[2023-03-19 09:38:03] [INFO ] After 965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 09:38:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 168 ms returned sat
[2023-03-19 09:38:06] [INFO ] After 2369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 09:38:07] [INFO ] Deduced a trap composed of 22 places in 645 ms of which 15 ms to minimize.
[2023-03-19 09:38:08] [INFO ] Deduced a trap composed of 18 places in 1046 ms of which 11 ms to minimize.
[2023-03-19 09:38:08] [INFO ] Deduced a trap composed of 23 places in 463 ms of which 3 ms to minimize.
[2023-03-19 09:38:09] [INFO ] Deduced a trap composed of 17 places in 636 ms of which 2 ms to minimize.
[2023-03-19 09:38:10] [INFO ] Deduced a trap composed of 21 places in 850 ms of which 15 ms to minimize.
[2023-03-19 09:38:11] [INFO ] Deduced a trap composed of 16 places in 471 ms of which 1 ms to minimize.
[2023-03-19 09:38:11] [INFO ] Deduced a trap composed of 18 places in 488 ms of which 2 ms to minimize.
[2023-03-19 09:38:12] [INFO ] Deduced a trap composed of 20 places in 426 ms of which 1 ms to minimize.
[2023-03-19 09:38:12] [INFO ] Deduced a trap composed of 26 places in 397 ms of which 1 ms to minimize.
[2023-03-19 09:38:13] [INFO ] Deduced a trap composed of 27 places in 592 ms of which 1 ms to minimize.
[2023-03-19 09:38:13] [INFO ] Deduced a trap composed of 20 places in 373 ms of which 1 ms to minimize.
[2023-03-19 09:38:14] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2023-03-19 09:38:14] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 0 ms to minimize.
[2023-03-19 09:38:15] [INFO ] Deduced a trap composed of 26 places in 571 ms of which 1 ms to minimize.
[2023-03-19 09:38:15] [INFO ] Deduced a trap composed of 34 places in 449 ms of which 0 ms to minimize.
[2023-03-19 09:38:16] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 1 ms to minimize.
[2023-03-19 09:38:16] [INFO ] Deduced a trap composed of 32 places in 380 ms of which 1 ms to minimize.
[2023-03-19 09:38:17] [INFO ] Deduced a trap composed of 32 places in 309 ms of which 2 ms to minimize.
[2023-03-19 09:38:17] [INFO ] Deduced a trap composed of 36 places in 321 ms of which 1 ms to minimize.
[2023-03-19 09:38:18] [INFO ] Deduced a trap composed of 31 places in 575 ms of which 1 ms to minimize.
[2023-03-19 09:38:18] [INFO ] Deduced a trap composed of 32 places in 325 ms of which 1 ms to minimize.
[2023-03-19 09:38:18] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 0 ms to minimize.
[2023-03-19 09:38:19] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 1 ms to minimize.
[2023-03-19 09:38:19] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 0 ms to minimize.
[2023-03-19 09:38:20] [INFO ] Deduced a trap composed of 29 places in 329 ms of which 0 ms to minimize.
[2023-03-19 09:38:20] [INFO ] Deduced a trap composed of 22 places in 339 ms of which 1 ms to minimize.
[2023-03-19 09:38:20] [INFO ] Deduced a trap composed of 34 places in 410 ms of which 1 ms to minimize.
[2023-03-19 09:38:21] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 1 ms to minimize.
[2023-03-19 09:38:21] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 1 ms to minimize.
[2023-03-19 09:38:22] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 1 ms to minimize.
[2023-03-19 09:38:22] [INFO ] Deduced a trap composed of 37 places in 334 ms of which 1 ms to minimize.
[2023-03-19 09:38:22] [INFO ] Deduced a trap composed of 33 places in 298 ms of which 1 ms to minimize.
[2023-03-19 09:38:23] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 1 ms to minimize.
[2023-03-19 09:38:23] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 1 ms to minimize.
[2023-03-19 09:38:24] [INFO ] Deduced a trap composed of 31 places in 320 ms of which 26 ms to minimize.
[2023-03-19 09:38:24] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 1 ms to minimize.
[2023-03-19 09:38:24] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 0 ms to minimize.
[2023-03-19 09:38:25] [INFO ] Deduced a trap composed of 48 places in 303 ms of which 1 ms to minimize.
[2023-03-19 09:38:25] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 1 ms to minimize.
[2023-03-19 09:38:26] [INFO ] Deduced a trap composed of 30 places in 396 ms of which 19 ms to minimize.
[2023-03-19 09:38:26] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 0 ms to minimize.
[2023-03-19 09:38:26] [INFO ] Deduced a trap composed of 45 places in 335 ms of which 0 ms to minimize.
[2023-03-19 09:38:27] [INFO ] Deduced a trap composed of 48 places in 360 ms of which 15 ms to minimize.
[2023-03-19 09:38:27] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 1 ms to minimize.
[2023-03-19 09:38:27] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 1 ms to minimize.
[2023-03-19 09:38:28] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-19 09:38:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:38:28] [INFO ] After 25148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 616 ms.
Support contains 11 out of 2018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Drop transitions removed 416 transitions
Trivial Post-agglo rules discarded 416 transitions
Performed 416 trivial Post agglomeration. Transition count delta: 416
Iterating post reduction 0 with 416 rules applied. Total rules applied 416 place count 2018 transition count 1392
Reduce places removed 416 places and 0 transitions.
Iterating post reduction 1 with 416 rules applied. Total rules applied 832 place count 1602 transition count 1392
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 832 place count 1602 transition count 1155
Deduced a syphon composed of 237 places in 2 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1306 place count 1365 transition count 1155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1308 place count 1363 transition count 1153
Iterating global reduction 2 with 2 rules applied. Total rules applied 1310 place count 1363 transition count 1153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1310 place count 1363 transition count 1152
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1312 place count 1362 transition count 1152
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 2 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 2 with 1010 rules applied. Total rules applied 2322 place count 857 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2323 place count 857 transition count 646
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2325 place count 856 transition count 645
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2503 place count 767 transition count 645
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2504 place count 767 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2505 place count 766 transition count 644
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2593 place count 766 transition count 644
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2594 place count 765 transition count 643
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2595 place count 764 transition count 643
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2595 place count 764 transition count 641
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2599 place count 762 transition count 641
Applied a total of 2599 rules in 535 ms. Remains 762 /2018 variables (removed 1256) and now considering 641/1808 (removed 1167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 762/2018 places, 641/1808 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 641 rows 762 cols
[2023-03-19 09:38:30] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:38:30] [INFO ] [Real]Absence check using 330 positive place invariants in 52 ms returned sat
[2023-03-19 09:38:30] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:38:30] [INFO ] [Nat]Absence check using 330 positive place invariants in 62 ms returned sat
[2023-03-19 09:38:31] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-19 09:38:31] [INFO ] After 276ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:31] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-19 09:38:32] [INFO ] After 1798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 9 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 641/641 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 760 transition count 639
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 759 transition count 638
Applied a total of 5 rules in 215 ms. Remains 759 /762 variables (removed 3) and now considering 638/641 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 759/762 places, 638/641 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 84235 steps, run timeout after 3006 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84235 steps, saw 70513 distinct states, run finished after 3010 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 638 rows 759 cols
[2023-03-19 09:38:36] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:38:36] [INFO ] [Real]Absence check using 330 positive place invariants in 302 ms returned sat
[2023-03-19 09:38:36] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:38:37] [INFO ] [Nat]Absence check using 330 positive place invariants in 71 ms returned sat
[2023-03-19 09:38:37] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-19 09:38:38] [INFO ] After 289ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:38] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-19 09:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-19 09:38:38] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 267 ms.
[2023-03-19 09:38:39] [INFO ] After 2274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 9 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 638/638 transitions.
Applied a total of 0 rules in 36 ms. Remains 759 /759 variables (removed 0) and now considering 638/638 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 759/759 places, 638/638 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 638/638 transitions.
Applied a total of 0 rules in 46 ms. Remains 759 /759 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-03-19 09:38:39] [INFO ] Invariant cache hit.
[2023-03-19 09:38:39] [INFO ] Implicit Places using invariants in 570 ms returned [742, 746]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 574 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 757/759 places, 638/638 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 755 transition count 636
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 755 transition count 636
Applied a total of 4 rules in 26 ms. Remains 755 /757 variables (removed 2) and now considering 636/638 (removed 2) transitions.
// Phase 1: matrix 636 rows 755 cols
[2023-03-19 09:38:39] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:38:40] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 09:38:40] [INFO ] Invariant cache hit.
[2023-03-19 09:38:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-19 09:38:41] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 755/759 places, 636/638 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2608 ms. Remains : 755/759 places, 636/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 102266 steps, run timeout after 3011 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 102266 steps, saw 86407 distinct states, run finished after 3011 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 09:38:45] [INFO ] Invariant cache hit.
[2023-03-19 09:38:45] [INFO ] [Real]Absence check using 328 positive place invariants in 64 ms returned sat
[2023-03-19 09:38:45] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:38:46] [INFO ] [Nat]Absence check using 328 positive place invariants in 86 ms returned sat
[2023-03-19 09:38:46] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-19 09:38:47] [INFO ] After 242ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:47] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-19 09:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-19 09:38:47] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-19 09:38:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-19 09:38:47] [INFO ] After 970ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-19 09:38:48] [INFO ] After 2289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 9 out of 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 636/636 transitions.
Applied a total of 0 rules in 36 ms. Remains 755 /755 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 755/755 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 636/636 transitions.
Applied a total of 0 rules in 25 ms. Remains 755 /755 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-03-19 09:38:48] [INFO ] Invariant cache hit.
[2023-03-19 09:38:49] [INFO ] Implicit Places using invariants in 673 ms returned []
[2023-03-19 09:38:49] [INFO ] Invariant cache hit.
[2023-03-19 09:38:49] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-19 09:38:50] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
[2023-03-19 09:38:50] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-19 09:38:50] [INFO ] Invariant cache hit.
[2023-03-19 09:38:50] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2546 ms. Remains : 755/755 places, 636/636 transitions.
Partial Free-agglomeration rule applied 177 times.
Drop transitions removed 177 transitions
Iterating global reduction 0 with 177 rules applied. Total rules applied 177 place count 755 transition count 636
Applied a total of 177 rules in 46 ms. Remains 755 /755 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 636 rows 755 cols
[2023-03-19 09:38:50] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-19 09:38:51] [INFO ] [Real]Absence check using 328 positive place invariants in 91 ms returned sat
[2023-03-19 09:38:51] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:38:51] [INFO ] [Nat]Absence check using 328 positive place invariants in 82 ms returned sat
[2023-03-19 09:38:52] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:52] [INFO ] State equation strengthened by 170 read => feed constraints.
[2023-03-19 09:38:53] [INFO ] After 452ms SMT Verify possible using 170 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:38:53] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 0 ms to minimize.
[2023-03-19 09:38:53] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 23 ms to minimize.
[2023-03-19 09:38:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2023-03-19 09:38:54] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 18 ms to minimize.
[2023-03-19 09:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-19 09:38:54] [INFO ] After 1737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-19 09:38:54] [INFO ] After 3374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 478 stabilizing places and 478 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(G(p1)&&X(p0))))'
Support contains 3 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2012 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2012 transition count 1802
Applied a total of 12 rules in 228 ms. Remains 2012 /2018 variables (removed 6) and now considering 1802/1808 (removed 6) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:38:55] [INFO ] Computed 331 place invariants in 6 ms
[2023-03-19 09:38:56] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-19 09:38:56] [INFO ] Invariant cache hit.
[2023-03-19 09:38:58] [INFO ] Implicit Places using invariants and state equation in 2306 ms returned []
Implicit Place search using SMT with State Equation took 3089 ms to find 0 implicit places.
[2023-03-19 09:38:58] [INFO ] Invariant cache hit.
[2023-03-19 09:38:59] [INFO ] Dead Transitions using invariants and state equation in 1230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2018 places, 1802/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4554 ms. Remains : 2012/2018 places, 1802/1808 transitions.
Stuttering acceptance computed with spot in 874 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}]], initial=1, aps=[p1:(EQ s1532 1), p0:(AND (EQ s1829 0) (EQ s1007 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-01 finished in 5528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2011 transition count 1801
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2011 transition count 1801
Applied a total of 14 rules in 293 ms. Remains 2011 /2018 variables (removed 7) and now considering 1801/1808 (removed 7) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-19 09:39:00] [INFO ] Computed 331 place invariants in 28 ms
[2023-03-19 09:39:02] [INFO ] Implicit Places using invariants in 1458 ms returned []
[2023-03-19 09:39:02] [INFO ] Invariant cache hit.
[2023-03-19 09:39:05] [INFO ] Implicit Places using invariants and state equation in 3163 ms returned []
Implicit Place search using SMT with State Equation took 4622 ms to find 0 implicit places.
[2023-03-19 09:39:05] [INFO ] Invariant cache hit.
[2023-03-19 09:39:07] [INFO ] Dead Transitions using invariants and state equation in 2467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2018 places, 1801/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7400 ms. Remains : 2011/2018 places, 1801/1808 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1828 0) (EQ s1306 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 835 steps with 0 reset in 31 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-04 finished in 7602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G((F(p1)&&(!p2 U (p3||G(!p2)))))))))'
Support contains 5 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2012 transition count 1802
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2012 transition count 1802
Applied a total of 12 rules in 324 ms. Remains 2012 /2018 variables (removed 6) and now considering 1802/1808 (removed 6) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-19 09:39:08] [INFO ] Computed 331 place invariants in 27 ms
[2023-03-19 09:39:10] [INFO ] Implicit Places using invariants in 1612 ms returned []
[2023-03-19 09:39:10] [INFO ] Invariant cache hit.
[2023-03-19 09:39:12] [INFO ] Implicit Places using invariants and state equation in 2631 ms returned []
Implicit Place search using SMT with State Equation took 4290 ms to find 0 implicit places.
[2023-03-19 09:39:12] [INFO ] Invariant cache hit.
[2023-03-19 09:39:14] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2018 places, 1802/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6259 ms. Remains : 2012/2018 places, 1802/1808 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p1) (NOT p0) (AND p2 (NOT p3))), (NOT p0), (OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s718 1)), p3:(AND (NEQ s803 1) (NOT (OR (EQ s735 0) (EQ s1230 1)))), p2:(OR (EQ s735 0) (EQ s1230 1)), p1:(AND (EQ s1230 0) (EQ s735 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-07 finished in 6719 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1 U p2))||p0))))'
Support contains 5 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2014 transition count 1804
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2014 transition count 1804
Applied a total of 8 rules in 275 ms. Remains 2014 /2018 variables (removed 4) and now considering 1804/1808 (removed 4) transitions.
// Phase 1: matrix 1804 rows 2014 cols
[2023-03-19 09:39:15] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-19 09:39:16] [INFO ] Implicit Places using invariants in 1143 ms returned []
[2023-03-19 09:39:16] [INFO ] Invariant cache hit.
[2023-03-19 09:39:18] [INFO ] Implicit Places using invariants and state equation in 2009 ms returned []
Implicit Place search using SMT with State Equation took 3155 ms to find 0 implicit places.
[2023-03-19 09:39:18] [INFO ] Invariant cache hit.
[2023-03-19 09:39:19] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2014/2018 places, 1804/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4594 ms. Remains : 2014/2018 places, 1804/1808 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s1990 0) (EQ s1520 1)), p2:(OR (EQ s809 0) (EQ s168 1)), p1:(EQ s1970 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1365 ms.
Product exploration explored 100000 steps with 50000 reset in 1288 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p2 (NOT p1))
Knowledge based reduction with 7 factoid took 398 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-08 finished in 7928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2017 transition count 1387
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1597 transition count 1387
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 840 place count 1597 transition count 1150
Deduced a syphon composed of 237 places in 3 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1314 place count 1360 transition count 1150
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1318 place count 1356 transition count 1146
Iterating global reduction 2 with 4 rules applied. Total rules applied 1322 place count 1356 transition count 1146
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1322 place count 1356 transition count 1143
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1328 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2344 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2345 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2347 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2525 place count 755 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2527 place count 753 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2528 place count 752 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2528 place count 752 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2532 place count 750 transition count 629
Applied a total of 2532 rules in 461 ms. Remains 750 /2018 variables (removed 1268) and now considering 629/1808 (removed 1179) transitions.
// Phase 1: matrix 629 rows 750 cols
[2023-03-19 09:39:23] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-19 09:39:23] [INFO ] Implicit Places using invariants in 436 ms returned [733, 737]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 438 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 748/2018 places, 629/1808 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 746 transition count 627
Applied a total of 4 rules in 33 ms. Remains 746 /748 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 746 cols
[2023-03-19 09:39:23] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-19 09:39:24] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 09:39:24] [INFO ] Invariant cache hit.
[2023-03-19 09:39:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 09:39:25] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/2018 places, 627/1808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2637 ms. Remains : 746/2018 places, 627/1808 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s433 0) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 550 ms.
Stack based approach found an accepted trace after 1399 steps with 0 reset with depth 1400 and stack size 438 in 30 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-13 finished in 3269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2018 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2011 transition count 1801
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2011 transition count 1801
Applied a total of 14 rules in 293 ms. Remains 2011 /2018 variables (removed 7) and now considering 1801/1808 (removed 7) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-19 09:39:26] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-19 09:39:27] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-19 09:39:27] [INFO ] Invariant cache hit.
[2023-03-19 09:39:29] [INFO ] Implicit Places using invariants and state equation in 2895 ms returned []
Implicit Place search using SMT with State Equation took 3714 ms to find 0 implicit places.
[2023-03-19 09:39:30] [INFO ] Invariant cache hit.
[2023-03-19 09:39:31] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2018 places, 1801/1808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5274 ms. Remains : 2011/2018 places, 1801/1808 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s412 0) (EQ s1459 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1013 ms.
Product exploration explored 100000 steps with 33333 reset in 926 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2011 stabilizing places and 478/1801 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030B-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-14 finished in 7579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p1) U (G(p1)&&F(G(p2))))&&p0)))'
Support contains 4 out of 2018 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2018/2018 places, 1808/1808 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2017 transition count 1390
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1600 transition count 1390
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 237 Pre rules applied. Total rules applied 834 place count 1600 transition count 1153
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 2 with 474 rules applied. Total rules applied 1308 place count 1363 transition count 1153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1311 place count 1360 transition count 1150
Iterating global reduction 2 with 3 rules applied. Total rules applied 1314 place count 1360 transition count 1150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1314 place count 1360 transition count 1148
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1318 place count 1358 transition count 1148
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2338 place count 848 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2339 place count 848 transition count 637
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2341 place count 847 transition count 636
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2519 place count 758 transition count 636
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2520 place count 758 transition count 636
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2522 place count 756 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2523 place count 755 transition count 634
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2523 place count 755 transition count 632
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2527 place count 753 transition count 632
Applied a total of 2527 rules in 435 ms. Remains 753 /2018 variables (removed 1265) and now considering 632/1808 (removed 1176) transitions.
// Phase 1: matrix 632 rows 753 cols
[2023-03-19 09:39:34] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-19 09:39:34] [INFO ] Implicit Places using invariants in 476 ms returned [736, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 477 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/2018 places, 632/1808 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 749 transition count 630
Applied a total of 4 rules in 28 ms. Remains 749 /751 variables (removed 2) and now considering 630/632 (removed 2) transitions.
// Phase 1: matrix 630 rows 749 cols
[2023-03-19 09:39:34] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-19 09:39:35] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-19 09:39:35] [INFO ] Invariant cache hit.
[2023-03-19 09:39:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 09:39:36] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 749/2018 places, 630/1808 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2642 ms. Remains : 749/2018 places, 630/1808 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s424 0) (EQ s725 1)), p1:(OR (EQ s210 0) (EQ s655 1)), p2:(OR (EQ s725 0) (EQ s424 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 594 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLCardinality-15 finished in 3439 ms.
All properties solved by simple procedures.
Total runtime 105834 ms.

BK_STOP 1679218780054

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713800651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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