Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800207.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is ShieldIIPt-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800207
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 860K May 18 16:43 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 ShieldIIPt-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716957099351

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 04:31:41] [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]
[2024-05-29 04:31:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:31:41] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-29 04:31:41] [INFO ] Transformed 3503 places.
[2024-05-29 04:31:41] [INFO ] Transformed 3253 transitions.
[2024-05-29 04:31:41] [INFO ] Found NUPN structural information;
[2024-05-29 04:31:41] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 542 places :
Symmetric choice reduction at 0 with 542 rule applications. Total rules 542 place count 2961 transition count 2711
Iterating global reduction 0 with 542 rules applied. Total rules applied 1084 place count 2961 transition count 2711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1085 place count 2960 transition count 2710
Iterating global reduction 0 with 1 rules applied. Total rules applied 1086 place count 2960 transition count 2710
Applied a total of 1086 rules in 1020 ms. Remains 2960 /3503 variables (removed 543) and now considering 2710/3253 (removed 543) transitions.
// Phase 1: matrix 2710 rows 2960 cols
[2024-05-29 04:31:43] [INFO ] Computed 451 invariants in 49 ms
[2024-05-29 04:31:44] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2024-05-29 04:31:44] [INFO ] Invariant cache hit.
[2024-05-29 04:31:47] [INFO ] Implicit Places using invariants and state equation in 3270 ms returned []
Implicit Place search using SMT with State Equation took 4304 ms to find 0 implicit places.
[2024-05-29 04:31:47] [INFO ] Invariant cache hit.
[2024-05-29 04:31:49] [INFO ] Dead Transitions using invariants and state equation in 1960 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2960/3503 places, 2710/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7289 ms. Remains : 2960/3503 places, 2710/3253 transitions.
Support contains 35 out of 2960 places after structural reductions.
[2024-05-29 04:31:49] [INFO ] Flatten gal took : 184 ms
[2024-05-29 04:31:49] [INFO ] Flatten gal took : 107 ms
[2024-05-29 04:31:49] [INFO ] Input system was already deterministic with 2710 transitions.
Support contains 33 out of 2960 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-29 04:31:50] [INFO ] Invariant cache hit.
[2024-05-29 04:31:51] [INFO ] [Real]Absence check using 451 positive place invariants in 185 ms returned sat
[2024-05-29 04:31:51] [INFO ] After 1023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 04:31:52] [INFO ] [Nat]Absence check using 451 positive place invariants in 184 ms returned sat
[2024-05-29 04:31:55] [INFO ] After 2345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 04:31:56] [INFO ] Deduced a trap composed of 20 places in 1058 ms of which 8 ms to minimize.
[2024-05-29 04:31:57] [INFO ] Deduced a trap composed of 22 places in 981 ms of which 2 ms to minimize.
[2024-05-29 04:31:58] [INFO ] Deduced a trap composed of 25 places in 957 ms of which 3 ms to minimize.
[2024-05-29 04:31:59] [INFO ] Deduced a trap composed of 21 places in 993 ms of which 3 ms to minimize.
[2024-05-29 04:32:00] [INFO ] Deduced a trap composed of 17 places in 897 ms of which 2 ms to minimize.
[2024-05-29 04:32:01] [INFO ] Deduced a trap composed of 20 places in 949 ms of which 2 ms to minimize.
[2024-05-29 04:32:02] [INFO ] Deduced a trap composed of 17 places in 869 ms of which 1 ms to minimize.
[2024-05-29 04:32:03] [INFO ] Deduced a trap composed of 18 places in 877 ms of which 2 ms to minimize.
[2024-05-29 04:32:04] [INFO ] Deduced a trap composed of 18 places in 854 ms of which 2 ms to minimize.
[2024-05-29 04:32:05] [INFO ] Deduced a trap composed of 32 places in 947 ms of which 5 ms to minimize.
[2024-05-29 04:32:06] [INFO ] Deduced a trap composed of 29 places in 930 ms of which 2 ms to minimize.
[2024-05-29 04:32:07] [INFO ] Deduced a trap composed of 29 places in 933 ms of which 2 ms to minimize.
[2024-05-29 04:32:08] [INFO ] Deduced a trap composed of 31 places in 947 ms of which 2 ms to minimize.
[2024-05-29 04:32:09] [INFO ] Deduced a trap composed of 25 places in 882 ms of which 5 ms to minimize.
[2024-05-29 04:32:10] [INFO ] Deduced a trap composed of 23 places in 876 ms of which 1 ms to minimize.
[2024-05-29 04:32:11] [INFO ] Deduced a trap composed of 33 places in 910 ms of which 1 ms to minimize.
[2024-05-29 04:32:12] [INFO ] Deduced a trap composed of 31 places in 854 ms of which 2 ms to minimize.
[2024-05-29 04:32:13] [INFO ] Deduced a trap composed of 27 places in 823 ms of which 2 ms to minimize.
[2024-05-29 04:32:14] [INFO ] Deduced a trap composed of 29 places in 834 ms of which 2 ms to minimize.
[2024-05-29 04:32:15] [INFO ] Deduced a trap composed of 32 places in 836 ms of which 1 ms to minimize.
[2024-05-29 04:32:16] [INFO ] Deduced a trap composed of 25 places in 838 ms of which 2 ms to minimize.
[2024-05-29 04:32:17] [INFO ] Deduced a trap composed of 35 places in 804 ms of which 2 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 04:32:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:32:17] [INFO ] After 25448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 556 ms.
Support contains 16 out of 2960 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Drop transitions removed 589 transitions
Trivial Post-agglo rules discarded 589 transitions
Performed 589 trivial Post agglomeration. Transition count delta: 589
Iterating post reduction 0 with 589 rules applied. Total rules applied 589 place count 2960 transition count 2121
Reduce places removed 589 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 593 rules applied. Total rules applied 1182 place count 2371 transition count 2117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1186 place count 2367 transition count 2117
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1186 place count 2367 transition count 1722
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 1976 place count 1972 transition count 1722
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1979 place count 1969 transition count 1719
Iterating global reduction 3 with 3 rules applied. Total rules applied 1982 place count 1969 transition count 1719
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1982 place count 1969 transition count 1717
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1986 place count 1967 transition count 1717
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 9 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 3 with 1694 rules applied. Total rules applied 3680 place count 1120 transition count 870
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3681 place count 1120 transition count 869
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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3683 place count 1119 transition count 868
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 3885 place count 1018 transition count 933
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 3973 place count 974 transition count 961
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3974 place count 974 transition count 960
Partial Free-agglomeration rule applied 49 times.
Drop transitions removed 49 transitions
Iterating global reduction 5 with 49 rules applied. Total rules applied 4023 place count 974 transition count 960
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4024 place count 973 transition count 959
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4025 place count 972 transition count 959
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4025 place count 972 transition count 958
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4027 place count 971 transition count 958
Applied a total of 4027 rules in 1182 ms. Remains 971 /2960 variables (removed 1989) and now considering 958/2710 (removed 1752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1185 ms. Remains : 971/2960 places, 958/2710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 958 rows 971 cols
[2024-05-29 04:32:19] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 04:32:20] [INFO ] [Real]Absence check using 450 positive place invariants in 78 ms returned sat
[2024-05-29 04:32:20] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:32:20] [INFO ] [Nat]Absence check using 450 positive place invariants in 70 ms returned sat
[2024-05-29 04:32:21] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:32:21] [INFO ] State equation strengthened by 348 read => feed constraints.
[2024-05-29 04:32:25] [INFO ] After 4476ms SMT Verify possible using 348 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:32:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-05-29 04:32:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2024-05-29 04:32:32] [INFO ] After 11138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4470 ms.
[2024-05-29 04:32:36] [INFO ] After 16536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 355 ms.
Support contains 10 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 958/958 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 971 transition count 956
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 969 transition count 956
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 8 place count 967 transition count 954
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 966 transition count 954
Applied a total of 10 rules in 64 ms. Remains 966 /971 variables (removed 5) and now considering 954/958 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 966/971 places, 954/958 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 109449 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109449 steps, saw 70086 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 954 rows 966 cols
[2024-05-29 04:32:40] [INFO ] Computed 450 invariants in 3 ms
[2024-05-29 04:32:41] [INFO ] [Real]Absence check using 450 positive place invariants in 66 ms returned sat
[2024-05-29 04:32:41] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:32:41] [INFO ] [Nat]Absence check using 450 positive place invariants in 68 ms returned sat
[2024-05-29 04:32:41] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:32:41] [INFO ] State equation strengthened by 351 read => feed constraints.
[2024-05-29 04:32:50] [INFO ] After 8381ms SMT Verify possible using 351 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:32:59] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 04:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2024-05-29 04:32:59] [INFO ] After 17936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 146 ms.
[2024-05-29 04:33:00] [INFO ] After 19016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 241 ms.
Support contains 10 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 954/954 transitions.
Applied a total of 0 rules in 35 ms. Remains 966 /966 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 966/966 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 954/954 transitions.
Applied a total of 0 rules in 58 ms. Remains 966 /966 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2024-05-29 04:33:00] [INFO ] Invariant cache hit.
[2024-05-29 04:33:01] [INFO ] Implicit Places using invariants in 1035 ms returned [954]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1048 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 965/966 places, 954/954 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 964 transition count 953
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 964 transition count 953
Applied a total of 2 rules in 33 ms. Remains 964 /965 variables (removed 1) and now considering 953/954 (removed 1) transitions.
// Phase 1: matrix 953 rows 964 cols
[2024-05-29 04:33:01] [INFO ] Computed 449 invariants in 3 ms
[2024-05-29 04:33:02] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-05-29 04:33:02] [INFO ] Invariant cache hit.
[2024-05-29 04:33:02] [INFO ] State equation strengthened by 350 read => feed constraints.
[2024-05-29 04:33:06] [INFO ] Implicit Places using invariants and state equation in 4014 ms returned []
Implicit Place search using SMT with State Equation took 4682 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 964/966 places, 953/954 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5824 ms. Remains : 964/966 places, 953/954 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 107336 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 107336 steps, saw 68151 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:33:09] [INFO ] Invariant cache hit.
[2024-05-29 04:33:09] [INFO ] [Real]Absence check using 449 positive place invariants in 123 ms returned sat
[2024-05-29 04:33:10] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:33:10] [INFO ] [Nat]Absence check using 449 positive place invariants in 70 ms returned sat
[2024-05-29 04:33:10] [INFO ] After 589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:33:10] [INFO ] State equation strengthened by 350 read => feed constraints.
[2024-05-29 04:33:20] [INFO ] After 9301ms SMT Verify possible using 350 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 04:33:20] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-29 04:33:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-29 04:33:20] [INFO ] After 9614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-29 04:33:20] [INFO ] After 10647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 317 ms.
Support contains 10 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 953/953 transitions.
Applied a total of 0 rules in 35 ms. Remains 964 /964 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 964/964 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 953/953 transitions.
Applied a total of 0 rules in 85 ms. Remains 964 /964 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2024-05-29 04:33:21] [INFO ] Invariant cache hit.
[2024-05-29 04:33:21] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-05-29 04:33:21] [INFO ] Invariant cache hit.
[2024-05-29 04:33:22] [INFO ] State equation strengthened by 350 read => feed constraints.
[2024-05-29 04:33:25] [INFO ] Implicit Places using invariants and state equation in 4008 ms returned []
Implicit Place search using SMT with State Equation took 4800 ms to find 0 implicit places.
[2024-05-29 04:33:25] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-29 04:33:25] [INFO ] Invariant cache hit.
[2024-05-29 04:33:26] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5532 ms. Remains : 964/964 places, 953/953 transitions.
Graph (complete) has 2871 edges and 964 vertex of which 963 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 214 times.
Drop transitions removed 214 transitions
Iterating global reduction 0 with 214 rules applied. Total rules applied 215 place count 963 transition count 953
Applied a total of 215 rules in 74 ms. Remains 963 /964 variables (removed 1) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 953 rows 963 cols
[2024-05-29 04:33:26] [INFO ] Computed 448 invariants in 8 ms
[2024-05-29 04:33:27] [INFO ] [Real]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-05-29 04:33:27] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:33:27] [INFO ] [Nat]Absence check using 448 positive place invariants in 94 ms returned sat
[2024-05-29 04:33:28] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:33:28] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-05-29 04:33:29] [INFO ] After 1601ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:33:30] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 04:33:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-29 04:33:31] [INFO ] After 3050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 925 ms.
[2024-05-29 04:33:32] [INFO ] After 4906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldIIPt-PT-050B-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldIIPt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 802 stabilizing places and 802 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((X(!p0) U p1))))))'
Support contains 3 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2952 transition count 2702
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2952 transition count 2702
Applied a total of 16 rules in 342 ms. Remains 2952 /2960 variables (removed 8) and now considering 2702/2710 (removed 8) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2024-05-29 04:33:32] [INFO ] Computed 451 invariants in 11 ms
[2024-05-29 04:33:33] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2024-05-29 04:33:33] [INFO ] Invariant cache hit.
[2024-05-29 04:33:36] [INFO ] Implicit Places using invariants and state equation in 3009 ms returned []
Implicit Place search using SMT with State Equation took 4075 ms to find 0 implicit places.
[2024-05-29 04:33:36] [INFO ] Invariant cache hit.
[2024-05-29 04:33:38] [INFO ] Dead Transitions using invariants and state equation in 2024 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2960 places, 2702/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6443 ms. Remains : 2952/2960 places, 2702/2710 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s2778 1), p0:(OR (EQ s2131 0) (EQ s1846 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1 reset in 977 ms.
Stack based approach found an accepted trace after 3413 steps with 0 reset with depth 3414 and stack size 3414 in 49 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-01 finished in 7783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2952 transition count 2702
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2952 transition count 2702
Applied a total of 16 rules in 328 ms. Remains 2952 /2960 variables (removed 8) and now considering 2702/2710 (removed 8) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2024-05-29 04:33:40] [INFO ] Computed 451 invariants in 16 ms
[2024-05-29 04:33:41] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2024-05-29 04:33:41] [INFO ] Invariant cache hit.
[2024-05-29 04:33:44] [INFO ] Implicit Places using invariants and state equation in 2890 ms returned []
Implicit Place search using SMT with State Equation took 3981 ms to find 0 implicit places.
[2024-05-29 04:33:44] [INFO ] Invariant cache hit.
[2024-05-29 04:33:46] [INFO ] Dead Transitions using invariants and state equation in 1991 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2960 places, 2702/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6302 ms. Remains : 2952/2960 places, 2702/2710 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-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:(AND (NEQ s103 0) (NEQ s1961 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 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-04 finished in 6430 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2952 transition count 2702
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2952 transition count 2702
Applied a total of 16 rules in 329 ms. Remains 2952 /2960 variables (removed 8) and now considering 2702/2710 (removed 8) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2024-05-29 04:33:46] [INFO ] Computed 451 invariants in 8 ms
[2024-05-29 04:33:47] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2024-05-29 04:33:47] [INFO ] Invariant cache hit.
[2024-05-29 04:33:50] [INFO ] Implicit Places using invariants and state equation in 2957 ms returned []
Implicit Place search using SMT with State Equation took 4035 ms to find 0 implicit places.
[2024-05-29 04:33:50] [INFO ] Invariant cache hit.
[2024-05-29 04:33:52] [INFO ] Dead Transitions using invariants and state equation in 2070 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2960 places, 2702/2710 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6450 ms. Remains : 2952/2960 places, 2702/2710 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2316 0) (EQ s429 1)), p1:(AND (EQ s1429 0) (EQ s2336 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 1 reset in 859 ms.
Stack based approach found an accepted trace after 2691 steps with 0 reset with depth 2692 and stack size 2692 in 25 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-05 finished in 7464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2959 transition count 2113
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2363 transition count 2113
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1192 place count 2363 transition count 1714
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1990 place count 1964 transition count 1714
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1995 place count 1959 transition count 1709
Iterating global reduction 2 with 5 rules applied. Total rules applied 2000 place count 1959 transition count 1709
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2000 place count 1959 transition count 1705
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 2008 place count 1955 transition count 1705
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3704 place count 1107 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3705 place count 1107 transition count 856
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 3707 place count 1106 transition count 855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3909 place count 1005 transition count 921
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4003 place count 958 transition count 952
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4005 place count 956 transition count 950
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4007 place count 954 transition count 950
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4007 place count 954 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4009 place count 953 transition count 949
Applied a total of 4009 rules in 790 ms. Remains 953 /2960 variables (removed 2007) and now considering 949/2710 (removed 1761) transitions.
// Phase 1: matrix 949 rows 953 cols
[2024-05-29 04:33:54] [INFO ] Computed 449 invariants in 14 ms
[2024-05-29 04:33:55] [INFO ] Implicit Places using invariants in 751 ms returned [942]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 759 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 952/2960 places, 949/2710 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 948
Applied a total of 2 rules in 41 ms. Remains 951 /952 variables (removed 1) and now considering 948/949 (removed 1) transitions.
// Phase 1: matrix 948 rows 951 cols
[2024-05-29 04:33:55] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:33:56] [INFO ] Implicit Places using invariants in 774 ms returned []
[2024-05-29 04:33:56] [INFO ] Invariant cache hit.
[2024-05-29 04:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:33:57] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 951/2960 places, 948/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3495 ms. Remains : 951/2960 places, 948/2710 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-08 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 s915 0) (EQ s327 1) (EQ s379 0) (EQ s271 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 767 ms.
Product exploration explored 100000 steps with 0 reset in 983 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205833 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205833 steps, saw 126640 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:34:02] [INFO ] Invariant cache hit.
[2024-05-29 04:34:02] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:34:02] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-05-29 04:34:03] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:03] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-29 04:34:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2024-05-29 04:34:03] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 04:34:03] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 948/948 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 951 transition count 947
Applied a total of 1 rules in 20 ms. Remains 951 /951 variables (removed 0) and now considering 947/948 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 951/951 places, 947/948 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207812 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207812 steps, saw 131848 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 947 rows 951 cols
[2024-05-29 04:34:06] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:34:06] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:34:07] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-05-29 04:34:07] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:07] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 04:34:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-29 04:34:07] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 04:34:07] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 18 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 951/951 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 17 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2024-05-29 04:34:07] [INFO ] Invariant cache hit.
[2024-05-29 04:34:08] [INFO ] Implicit Places using invariants in 848 ms returned []
[2024-05-29 04:34:08] [INFO ] Invariant cache hit.
[2024-05-29 04:34:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:09] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2024-05-29 04:34:09] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 04:34:09] [INFO ] Invariant cache hit.
[2024-05-29 04:34:10] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2660 ms. Remains : 951/951 places, 947/947 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 951 transition count 947
Applied a total of 101 rules in 40 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 947 rows 951 cols
[2024-05-29 04:34:10] [INFO ] Computed 448 invariants in 2 ms
[2024-05-29 04:34:10] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:34:10] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-05-29 04:34:11] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:11] [INFO ] After 35ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:11] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-29 04:34:11] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 951/951 places, 948/948 transitions.
Applied a total of 0 rules in 21 ms. Remains 951 /951 variables (removed 0) and now considering 948/948 (removed 0) transitions.
// Phase 1: matrix 948 rows 951 cols
[2024-05-29 04:34:11] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:34:12] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-29 04:34:12] [INFO ] Invariant cache hit.
[2024-05-29 04:34:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:13] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2024-05-29 04:34:13] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 04:34:13] [INFO ] Invariant cache hit.
[2024-05-29 04:34:14] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2602 ms. Remains : 951/951 places, 948/948 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200259 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200259 steps, saw 123251 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:34:17] [INFO ] Invariant cache hit.
[2024-05-29 04:34:17] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:34:17] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-05-29 04:34:18] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:18] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:18] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-29 04:34:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-29 04:34:18] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-05-29 04:34:18] [INFO ] After 1073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 948/948 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 951 transition count 947
Applied a total of 1 rules in 21 ms. Remains 951 /951 variables (removed 0) and now considering 947/948 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 951/951 places, 947/948 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 203706 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203706 steps, saw 129075 distinct states, run finished after 3002 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 947 rows 951 cols
[2024-05-29 04:34:21] [INFO ] Computed 448 invariants in 4 ms
[2024-05-29 04:34:22] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:34:22] [INFO ] [Nat]Absence check using 448 positive place invariants in 68 ms returned sat
[2024-05-29 04:34:22] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:22] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-29 04:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-29 04:34:22] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-29 04:34:23] [INFO ] After 847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 29 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 951/951 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 947/947 transitions.
Applied a total of 0 rules in 17 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2024-05-29 04:34:23] [INFO ] Invariant cache hit.
[2024-05-29 04:34:23] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-29 04:34:23] [INFO ] Invariant cache hit.
[2024-05-29 04:34:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:25] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2024-05-29 04:34:25] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 04:34:25] [INFO ] Invariant cache hit.
[2024-05-29 04:34:25] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2675 ms. Remains : 951/951 places, 947/947 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 951 transition count 947
Applied a total of 101 rules in 39 ms. Remains 951 /951 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 947 rows 951 cols
[2024-05-29 04:34:25] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:34:25] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:34:26] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2024-05-29 04:34:26] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:26] [INFO ] After 34ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:34:26] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 04:34:26] [INFO ] After 713ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 793 ms.
Product exploration explored 100000 steps with 0 reset in 1059 ms.
Built C files in :
/tmp/ltsmin9387379839672920395
[2024-05-29 04:34:28] [INFO ] Computing symmetric may disable matrix : 948 transitions.
[2024-05-29 04:34:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:34:28] [INFO ] Computing symmetric may enable matrix : 948 transitions.
[2024-05-29 04:34:28] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:34:28] [INFO ] Computing Do-Not-Accords matrix : 948 transitions.
[2024-05-29 04:34:28] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:34:28] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9387379839672920395
Running compilation step : cd /tmp/ltsmin9387379839672920395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2971 ms.
Running link step : cd /tmp/ltsmin9387379839672920395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin9387379839672920395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6076177951548579955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 951/951 places, 948/948 transitions.
Applied a total of 0 rules in 16 ms. Remains 951 /951 variables (removed 0) and now considering 948/948 (removed 0) transitions.
// Phase 1: matrix 948 rows 951 cols
[2024-05-29 04:34:43] [INFO ] Computed 448 invariants in 1 ms
[2024-05-29 04:34:44] [INFO ] Implicit Places using invariants in 604 ms returned []
[2024-05-29 04:34:44] [INFO ] Invariant cache hit.
[2024-05-29 04:34:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:34:45] [INFO ] Implicit Places using invariants and state equation in 1157 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
[2024-05-29 04:34:45] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:34:45] [INFO ] Invariant cache hit.
[2024-05-29 04:34:45] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2340 ms. Remains : 951/951 places, 948/948 transitions.
Built C files in :
/tmp/ltsmin2655099353755559058
[2024-05-29 04:34:46] [INFO ] Computing symmetric may disable matrix : 948 transitions.
[2024-05-29 04:34:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:34:46] [INFO ] Computing symmetric may enable matrix : 948 transitions.
[2024-05-29 04:34:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:34:46] [INFO ] Computing Do-Not-Accords matrix : 948 transitions.
[2024-05-29 04:34:46] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:34:46] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2655099353755559058
Running compilation step : cd /tmp/ltsmin2655099353755559058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2698 ms.
Running link step : cd /tmp/ltsmin2655099353755559058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2655099353755559058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2079976632412551616.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:35:01] [INFO ] Flatten gal took : 74 ms
[2024-05-29 04:35:01] [INFO ] Flatten gal took : 59 ms
[2024-05-29 04:35:01] [INFO ] Time to serialize gal into /tmp/LTL10561703320785954021.gal : 14 ms
[2024-05-29 04:35:01] [INFO ] Time to serialize properties into /tmp/LTL44719820999669785.prop : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10561703320785954021.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4862961734453267475.hoa' '-atoms' '/tmp/LTL44719820999669785.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL44719820999669785.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4862961734453267475.hoa
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t52, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...176
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:35:16] [INFO ] Flatten gal took : 56 ms
[2024-05-29 04:35:16] [INFO ] Flatten gal took : 70 ms
[2024-05-29 04:35:16] [INFO ] Time to serialize gal into /tmp/LTL9913487771748933870.gal : 7 ms
[2024-05-29 04:35:16] [INFO ] Time to serialize properties into /tmp/LTL15483279810181437207.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9913487771748933870.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15483279810181437207.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p3340==0)||(p1220==1))||((p1402==0)||(p1030==1)))"))))
Formula 0 simplified : GF!"(((p3340==0)||(p1220==1))||((p1402==0)||(p1030==1)))"
Reverse transition relation is NOT exact ! Due to transitions t46, t49, t52, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...176
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:35:31] [INFO ] Flatten gal took : 45 ms
[2024-05-29 04:35:31] [INFO ] Applying decomposition
[2024-05-29 04:35:31] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14561105166903864055.txt' '-o' '/tmp/graph14561105166903864055.bin' '-w' '/tmp/graph14561105166903864055.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14561105166903864055.bin' '-l' '-1' '-v' '-w' '/tmp/graph14561105166903864055.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:35:32] [INFO ] Decomposing Gal with order
[2024-05-29 04:35:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:35:32] [INFO ] Removed a total of 1073 redundant transitions.
[2024-05-29 04:35:33] [INFO ] Flatten gal took : 587 ms
[2024-05-29 04:35:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 460 labels/synchronizations in 40 ms.
[2024-05-29 04:35:33] [INFO ] Time to serialize gal into /tmp/LTL12773416406587154951.gal : 37 ms
[2024-05-29 04:35:33] [INFO ] Time to serialize properties into /tmp/LTL9246235657691489655.ltl : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12773416406587154951.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9246235657691489655.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i25.i1.i2.u383.p3340==0)||(i9.u135.p1220==1))||((i10.i1.i2.u158.p1402==0)||(i8.i0.i0.u114.p1030==1)))"))))
Formula 0 simplified : GF!"(((i25.i1.i2.u383.p3340==0)||(i9.u135.p1220==1))||((i10.i1.i2.u158.p1402==0)||(i8.i0.i0.u114.p1030==1)))"
Reverse transition relation is NOT exact ! Due to transitions i8.i0.i0.t52, i25.i1.t46, i25.i1.i2.u383.t49, Intersection with reachable at each step enabl...207
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6609916970615413080
[2024-05-29 04:35:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6609916970615413080
Running compilation step : cd /tmp/ltsmin6609916970615413080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1648 ms.
Running link step : cd /tmp/ltsmin6609916970615413080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6609916970615413080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-08 finished in 129404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2959 transition count 2113
Reduce places removed 596 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 597 rules applied. Total rules applied 1193 place count 2363 transition count 2112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1194 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1194 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1992 place count 1963 transition count 1713
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1999 place count 1956 transition count 1706
Iterating global reduction 3 with 7 rules applied. Total rules applied 2006 place count 1956 transition count 1706
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2006 place count 1956 transition count 1702
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2014 place count 1952 transition count 1702
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 1 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 3 with 1688 rules applied. Total rules applied 3702 place count 1108 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3703 place count 1108 transition count 857
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 4 with 2 rules applied. Total rules applied 3705 place count 1107 transition count 856
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3907 place count 1006 transition count 922
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4001 place count 959 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4003 place count 957 transition count 951
Applied a total of 4003 rules in 522 ms. Remains 957 /2960 variables (removed 2003) and now considering 951/2710 (removed 1759) transitions.
// Phase 1: matrix 951 rows 957 cols
[2024-05-29 04:36:03] [INFO ] Computed 451 invariants in 3 ms
[2024-05-29 04:36:04] [INFO ] Implicit Places using invariants in 729 ms returned []
[2024-05-29 04:36:04] [INFO ] Invariant cache hit.
[2024-05-29 04:36:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 04:36:05] [INFO ] Implicit Places using invariants and state equation in 1125 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
[2024-05-29 04:36:05] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 04:36:05] [INFO ] Invariant cache hit.
[2024-05-29 04:36:06] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 957/2960 places, 951/2710 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3013 ms. Remains : 957/2960 places, 951/2710 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (AND (EQ s952 0) (EQ s952 1)) (EQ s952 1)), p0:(OR (EQ s947 1) (EQ s764 0) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 24618 reset in 1095 ms.
Product exploration explored 100000 steps with 24587 reset in 1164 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/957 stabilizing places and 4/951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 1749 steps, including 0 resets, run visited all 3 properties in 21 ms. (steps per millisecond=83 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 367 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 951/951 transitions.
Applied a total of 0 rules in 16 ms. Remains 957 /957 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 04:36:09] [INFO ] Invariant cache hit.
[2024-05-29 04:36:10] [INFO ] Implicit Places using invariants in 618 ms returned []
[2024-05-29 04:36:10] [INFO ] Invariant cache hit.
[2024-05-29 04:36:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 04:36:11] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
[2024-05-29 04:36:11] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 04:36:11] [INFO ] Invariant cache hit.
[2024-05-29 04:36:12] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2434 ms. Remains : 957/957 places, 951/951 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Computed a total of 6 stabilizing places and 4 stable transitions
Detected a total of 6/957 stabilizing places and 4/951 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 324 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 817 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 364 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 24818 reset in 1043 ms.
Product exploration explored 100000 steps with 24684 reset in 1195 ms.
Built C files in :
/tmp/ltsmin16621725792726047041
[2024-05-29 04:36:15] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 04:36:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:36:15] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 04:36:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:36:15] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 04:36:15] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:36:15] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621725792726047041
Running compilation step : cd /tmp/ltsmin16621725792726047041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2674 ms.
Running link step : cd /tmp/ltsmin16621725792726047041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16621725792726047041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17390417976569173323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 957 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 957/957 places, 951/951 transitions.
Applied a total of 0 rules in 16 ms. Remains 957 /957 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2024-05-29 04:36:30] [INFO ] Invariant cache hit.
[2024-05-29 04:36:31] [INFO ] Implicit Places using invariants in 714 ms returned []
[2024-05-29 04:36:31] [INFO ] Invariant cache hit.
[2024-05-29 04:36:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 04:36:32] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
[2024-05-29 04:36:32] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:36:32] [INFO ] Invariant cache hit.
[2024-05-29 04:36:32] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2473 ms. Remains : 957/957 places, 951/951 transitions.
Built C files in :
/tmp/ltsmin5595254792348638234
[2024-05-29 04:36:32] [INFO ] Computing symmetric may disable matrix : 951 transitions.
[2024-05-29 04:36:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:36:32] [INFO ] Computing symmetric may enable matrix : 951 transitions.
[2024-05-29 04:36:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:36:33] [INFO ] Computing Do-Not-Accords matrix : 951 transitions.
[2024-05-29 04:36:33] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:36:33] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5595254792348638234
Running compilation step : cd /tmp/ltsmin5595254792348638234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2669 ms.
Running link step : cd /tmp/ltsmin5595254792348638234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5595254792348638234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17336006381767571569.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:36:48] [INFO ] Flatten gal took : 25 ms
[2024-05-29 04:36:48] [INFO ] Flatten gal took : 25 ms
[2024-05-29 04:36:48] [INFO ] Time to serialize gal into /tmp/LTL15987792983747808464.gal : 5 ms
[2024-05-29 04:36:48] [INFO ] Time to serialize properties into /tmp/LTL7923852931568216029.prop : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15987792983747808464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12934026871147350705.hoa' '-atoms' '/tmp/LTL7923852931568216029.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7923852931568216029.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12934026871147350705.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2255
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:37:03] [INFO ] Flatten gal took : 24 ms
[2024-05-29 04:37:03] [INFO ] Flatten gal took : 24 ms
[2024-05-29 04:37:03] [INFO ] Time to serialize gal into /tmp/LTL7040643240560947525.gal : 5 ms
[2024-05-29 04:37:03] [INFO ] Time to serialize properties into /tmp/LTL1269198579954237810.ltl : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7040643240560947525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1269198579954237810.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(((p3458==1)||(p2808==0))||(p92==1))"))||(F("(((p3479==0)&&(p3479==1))||(p3479==1))"))))
Formula 0 simplified : F!"(((p3458==1)||(p2808==0))||(p92==1))" & G!"(((p3479==0)&&(p3479==1))||(p3479==1))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2255
Detected timeout of ITS tools.
[2024-05-29 04:37:18] [INFO ] Flatten gal took : 27 ms
[2024-05-29 04:37:18] [INFO ] Applying decomposition
[2024-05-29 04:37:18] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15721003884522587947.txt' '-o' '/tmp/graph15721003884522587947.bin' '-w' '/tmp/graph15721003884522587947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15721003884522587947.bin' '-l' '-1' '-v' '-w' '/tmp/graph15721003884522587947.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:37:18] [INFO ] Decomposing Gal with order
[2024-05-29 04:37:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:37:18] [INFO ] Removed a total of 1072 redundant transitions.
[2024-05-29 04:37:18] [INFO ] Flatten gal took : 54 ms
[2024-05-29 04:37:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 466 labels/synchronizations in 13 ms.
[2024-05-29 04:37:18] [INFO ] Time to serialize gal into /tmp/LTL8028497012691586089.gal : 9 ms
[2024-05-29 04:37:18] [INFO ] Time to serialize properties into /tmp/LTL3559359527288721211.ltl : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8028497012691586089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3559359527288721211.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("(((i27.i1.i1.u396.p3458==1)||(i21.u319.p2808==0))||(i0.i0.i0.u7.p92==1))"))||(F("(((i27.i1.i0.u397.p3479==0)&&(i27.i1.i0.u397.p...197
Formula 0 simplified : F!"(((i27.i1.i1.u396.p3458==1)||(i21.u319.p2808==0))||(i0.i0.i0.u7.p92==1))" & G!"(((i27.i1.i0.u397.p3479==0)&&(i27.i1.i0.u397.p3479...189
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t602_t203_t209, i0.i0.i0.u1.t605, i0.i0.i1.t603_t207_t209, i0.i1.t1, i0.i1.t6...3977
Computing Next relation with stutter on 6.21554e+61 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7172628838917142918
[2024-05-29 04:37:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7172628838917142918
Running compilation step : cd /tmp/ltsmin7172628838917142918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1653 ms.
Running link step : cd /tmp/ltsmin7172628838917142918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7172628838917142918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-09 finished in 105452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2959 transition count 2113
Reduce places removed 596 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 599 rules applied. Total rules applied 1195 place count 2363 transition count 2110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1198 place count 2360 transition count 2110
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 1198 place count 2360 transition count 1714
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1990 place count 1964 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1997 place count 1957 transition count 1707
Iterating global reduction 3 with 7 rules applied. Total rules applied 2004 place count 1957 transition count 1707
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 2004 place count 1957 transition count 1703
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2012 place count 1953 transition count 1703
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 2 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 3 with 1690 rules applied. Total rules applied 3702 place count 1108 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3703 place count 1108 transition count 857
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 21 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3705 place count 1107 transition count 856
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3907 place count 1006 transition count 923
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4001 place count 959 transition count 954
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4003 place count 957 transition count 952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4005 place count 955 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4005 place count 955 transition count 951
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4007 place count 954 transition count 951
Applied a total of 4007 rules in 541 ms. Remains 954 /2960 variables (removed 2006) and now considering 951/2710 (removed 1759) transitions.
// Phase 1: matrix 951 rows 954 cols
[2024-05-29 04:37:49] [INFO ] Computed 449 invariants in 4 ms
[2024-05-29 04:37:50] [INFO ] Implicit Places using invariants in 564 ms returned [943]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 567 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 953/2960 places, 951/2710 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 950
Applied a total of 2 rules in 31 ms. Remains 952 /953 variables (removed 1) and now considering 950/951 (removed 1) transitions.
// Phase 1: matrix 950 rows 952 cols
[2024-05-29 04:37:50] [INFO ] Computed 448 invariants in 3 ms
[2024-05-29 04:37:50] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-29 04:37:50] [INFO ] Invariant cache hit.
[2024-05-29 04:37:51] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 952/2960 places, 950/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2975 ms. Remains : 952/2960 places, 950/2710 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s839 0) (EQ s173 1)), p1:(OR (EQ s438 0) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 877 ms.
Product exploration explored 100000 steps with 0 reset in 1191 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 160 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Finished Best-First random walk after 6183 steps, including 1 resets, run visited all 1 properties in 52 ms. (steps per millisecond=118 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 952 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 950/950 transitions.
Applied a total of 0 rules in 21 ms. Remains 952 /952 variables (removed 0) and now considering 950/950 (removed 0) transitions.
[2024-05-29 04:37:54] [INFO ] Invariant cache hit.
[2024-05-29 04:37:55] [INFO ] Implicit Places using invariants in 595 ms returned []
[2024-05-29 04:37:55] [INFO ] Invariant cache hit.
[2024-05-29 04:37:56] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2024-05-29 04:37:56] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:37:56] [INFO ] Invariant cache hit.
[2024-05-29 04:37:57] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2320 ms. Remains : 952/952 places, 950/950 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181527 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181527 steps, saw 111455 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:38:00] [INFO ] Invariant cache hit.
[2024-05-29 04:38:00] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:38:00] [INFO ] [Nat]Absence check using 448 positive place invariants in 70 ms returned sat
[2024-05-29 04:38:01] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:38:01] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 04:38:01] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 972 steps, including 38 resets, run visited all 1 properties in 10 ms. (steps per millisecond=97 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 879 ms.
Product exploration explored 100000 steps with 0 reset in 1431 ms.
Built C files in :
/tmp/ltsmin14376583006432815623
[2024-05-29 04:38:03] [INFO ] Computing symmetric may disable matrix : 950 transitions.
[2024-05-29 04:38:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:38:03] [INFO ] Computing symmetric may enable matrix : 950 transitions.
[2024-05-29 04:38:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:38:04] [INFO ] Computing Do-Not-Accords matrix : 950 transitions.
[2024-05-29 04:38:04] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:38:04] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14376583006432815623
Running compilation step : cd /tmp/ltsmin14376583006432815623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2776 ms.
Running link step : cd /tmp/ltsmin14376583006432815623;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14376583006432815623;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2266402339898231170.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 952/952 places, 950/950 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 952 transition count 948
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 950 transition count 948
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 0 with 2 rules applied. Total rules applied 6 place count 949 transition count 947
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 0 with 2 rules applied. Total rules applied 8 place count 948 transition count 948
Applied a total of 8 rules in 46 ms. Remains 948 /952 variables (removed 4) and now considering 948/950 (removed 2) transitions.
// Phase 1: matrix 948 rows 948 cols
[2024-05-29 04:38:19] [INFO ] Computed 448 invariants in 1 ms
[2024-05-29 04:38:19] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-05-29 04:38:19] [INFO ] Invariant cache hit.
[2024-05-29 04:38:20] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
[2024-05-29 04:38:20] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 04:38:20] [INFO ] Invariant cache hit.
[2024-05-29 04:38:21] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/952 places, 948/950 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2432 ms. Remains : 948/952 places, 948/950 transitions.
Built C files in :
/tmp/ltsmin11665356024905406190
[2024-05-29 04:38:21] [INFO ] Computing symmetric may disable matrix : 948 transitions.
[2024-05-29 04:38:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:38:21] [INFO ] Computing symmetric may enable matrix : 948 transitions.
[2024-05-29 04:38:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:38:21] [INFO ] Computing Do-Not-Accords matrix : 948 transitions.
[2024-05-29 04:38:21] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:38:21] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11665356024905406190
Running compilation step : cd /tmp/ltsmin11665356024905406190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2812 ms.
Running link step : cd /tmp/ltsmin11665356024905406190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin11665356024905406190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14694791789893311659.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:38:36] [INFO ] Flatten gal took : 23 ms
[2024-05-29 04:38:36] [INFO ] Flatten gal took : 22 ms
[2024-05-29 04:38:36] [INFO ] Time to serialize gal into /tmp/LTL562939232438890093.gal : 5 ms
[2024-05-29 04:38:36] [INFO ] Time to serialize properties into /tmp/LTL16018932216783990545.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL562939232438890093.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12379672051643120222.hoa' '-atoms' '/tmp/LTL16018932216783990545.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16018932216783990545.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12379672051643120222.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 6.21554e+61 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
643 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.55534,178684,1,0,9,1.12068e+06,24,5,26260,260304,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-13 finished in 54971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(p1)))'
Support contains 4 out of 2960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2960/2960 places, 2710/2710 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 2959 transition count 2112
Reduce places removed 597 places and 0 transitions.
Iterating post reduction 1 with 597 rules applied. Total rules applied 1194 place count 2362 transition count 2112
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 397 Pre rules applied. Total rules applied 1194 place count 2362 transition count 1715
Deduced a syphon composed of 397 places in 3 ms
Reduce places removed 397 places and 0 transitions.
Iterating global reduction 2 with 794 rules applied. Total rules applied 1988 place count 1965 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1994 place count 1959 transition count 1709
Iterating global reduction 2 with 6 rules applied. Total rules applied 2000 place count 1959 transition count 1709
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2000 place count 1959 transition count 1706
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2006 place count 1956 transition count 1706
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3702 place count 1108 transition count 858
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1108 transition count 857
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 3705 place count 1107 transition count 856
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3907 place count 1006 transition count 923
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3999 place count 960 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4001 place count 958 transition count 951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4002 place count 957 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4002 place count 957 transition count 950
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4004 place count 956 transition count 950
Applied a total of 4004 rules in 505 ms. Remains 956 /2960 variables (removed 2004) and now considering 950/2710 (removed 1760) transitions.
// Phase 1: matrix 950 rows 956 cols
[2024-05-29 04:38:44] [INFO ] Computed 450 invariants in 5 ms
[2024-05-29 04:38:44] [INFO ] Implicit Places using invariants in 556 ms returned [944]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 557 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 955/2960 places, 950/2710 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 954 transition count 949
Applied a total of 2 rules in 28 ms. Remains 954 /955 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 954 cols
[2024-05-29 04:38:44] [INFO ] Computed 449 invariants in 2 ms
[2024-05-29 04:38:45] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-05-29 04:38:45] [INFO ] Invariant cache hit.
[2024-05-29 04:38:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 04:38:46] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 954/2960 places, 949/2710 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2895 ms. Remains : 954/2960 places, 949/2710 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s689 0) (EQ s18 1)), p0:(OR (EQ s307 0) (EQ s940 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 67758 steps with 6 reset in 585 ms.
FORMULA ShieldIIPt-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLCardinality-14 finished in 3637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
[2024-05-29 04:38:47] [INFO ] Flatten gal took : 51 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin684815028443434073
[2024-05-29 04:38:47] [INFO ] Too many transitions (2710) to apply POR reductions. Disabling POR matrices.
[2024-05-29 04:38:47] [INFO ] Applying decomposition
[2024-05-29 04:38:47] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin684815028443434073
Running compilation step : cd /tmp/ltsmin684815028443434073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 04:38:47] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11084735111524352131.txt' '-o' '/tmp/graph11084735111524352131.bin' '-w' '/tmp/graph11084735111524352131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11084735111524352131.bin' '-l' '-1' '-v' '-w' '/tmp/graph11084735111524352131.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:38:48] [INFO ] Decomposing Gal with order
[2024-05-29 04:38:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:38:48] [INFO ] Removed a total of 489 redundant transitions.
[2024-05-29 04:38:48] [INFO ] Flatten gal took : 108 ms
[2024-05-29 04:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 04:38:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality2184386552358425375.gal : 22 ms
[2024-05-29 04:38:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality2939029599086423895.ltl : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2184386552358425375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2939029599086423895.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F(G("(((i47.u1050.p3340==0)||(i17.u387.p1220==1))||((i20.u443.p1402==0)||(i15.u327.p1030==1)))"))))
Formula 0 simplified : GF!"(((i47.u1050.p3340==0)||(i17.u387.p1220==1))||((i20.u443.p1402==0)||(i15.u327.p1030==1)))"
Compilation finished in 6562 ms.
Running link step : cd /tmp/ltsmin684815028443434073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin684815028443434073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 05:01:12] [INFO ] Applying decomposition
[2024-05-29 05:01:12] [INFO ] Flatten gal took : 146 ms
[2024-05-29 05:01:12] [INFO ] Decomposing Gal with order
[2024-05-29 05:01:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:01:13] [INFO ] Removed a total of 147 redundant transitions.
[2024-05-29 05:01:13] [INFO ] Flatten gal took : 206 ms
[2024-05-29 05:01:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 05:01:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality2366075936815419398.gal : 59 ms
[2024-05-29 05:01:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality954000781798741648.ltl : 2 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2366075936815419398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality954000781798741648.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 2 LTL properties
Checking formula 0 : !((F(G("(((i0.i0.i1.i0.i0.u864.p3340==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...452
Formula 0 simplified : GF!"(((i0.i0.i1.i0.i0.u864.p3340==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....446
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin684815028443434073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin684815028443434073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp1==true))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 05:23:37] [INFO ] Flatten gal took : 126 ms
[2024-05-29 05:23:37] [INFO ] Input system was already deterministic with 2710 transitions.
[2024-05-29 05:23:37] [INFO ] Transformed 2960 places.
[2024-05-29 05:23:37] [INFO ] Transformed 2710 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 05:23:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality17294122991344856760.gal : 20 ms
[2024-05-29 05:23:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality10993898839824109979.ltl : 0 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17294122991344856760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10993898839824109979.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((p3340==0)||(p1220==1))||((p1402==0)||(p1030==1)))"))))
Formula 0 simplified : GF!"(((p3340==0)||(p1220==1))||((p1402==0)||(p1030==1)))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10892184 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040292 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="ShieldIIPt-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-050B, 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 r373-tall-171683788800207"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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