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-171683789300428.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 ShieldPPPt-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300428
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 955K 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 ShieldPPPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716990834370

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 13:53:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 13:53:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:53:56] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2024-05-29 13:53:56] [INFO ] Transformed 3903 places.
[2024-05-29 13:53:56] [INFO ] Transformed 3553 transitions.
[2024-05-29 13:53:56] [INFO ] Found NUPN structural information;
[2024-05-29 13:53:56] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 544 places :
Symmetric choice reduction at 0 with 544 rule applications. Total rules 544 place count 3359 transition count 3009
Iterating global reduction 0 with 544 rules applied. Total rules applied 1088 place count 3359 transition count 3009
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1089 place count 3358 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 1090 place count 3358 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1091 place count 3357 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 1092 place count 3357 transition count 3007
Applied a total of 1092 rules in 1337 ms. Remains 3357 /3903 variables (removed 546) and now considering 3007/3553 (removed 546) transitions.
// Phase 1: matrix 3007 rows 3357 cols
[2024-05-29 13:53:58] [INFO ] Computed 551 invariants in 55 ms
[2024-05-29 13:53:59] [INFO ] Implicit Places using invariants in 1225 ms returned []
[2024-05-29 13:53:59] [INFO ] Invariant cache hit.
[2024-05-29 13:54:03] [INFO ] Implicit Places using invariants and state equation in 3706 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2024-05-29 13:54:03] [INFO ] Invariant cache hit.
[2024-05-29 13:54:05] [INFO ] Dead Transitions using invariants and state equation in 2358 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3357/3903 places, 3007/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8657 ms. Remains : 3357/3903 places, 3007/3553 transitions.
Support contains 30 out of 3357 places after structural reductions.
[2024-05-29 13:54:05] [INFO ] Flatten gal took : 192 ms
[2024-05-29 13:54:06] [INFO ] Flatten gal took : 114 ms
[2024-05-29 13:54:06] [INFO ] Input system was already deterministic with 3007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 26) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-29 13:54:07] [INFO ] Invariant cache hit.
[2024-05-29 13:54:08] [INFO ] [Real]Absence check using 551 positive place invariants in 195 ms returned sat
[2024-05-29 13:54:08] [INFO ] After 1383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 13:54:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 220 ms returned sat
[2024-05-29 13:54:13] [INFO ] After 2832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 13:54:14] [INFO ] Deduced a trap composed of 30 places in 876 ms of which 11 ms to minimize.
[2024-05-29 13:54:15] [INFO ] Deduced a trap composed of 16 places in 903 ms of which 3 ms to minimize.
[2024-05-29 13:54:15] [INFO ] Deduced a trap composed of 21 places in 853 ms of which 3 ms to minimize.
[2024-05-29 13:54:16] [INFO ] Deduced a trap composed of 18 places in 823 ms of which 3 ms to minimize.
[2024-05-29 13:54:17] [INFO ] Deduced a trap composed of 19 places in 817 ms of which 2 ms to minimize.
[2024-05-29 13:54:18] [INFO ] Deduced a trap composed of 38 places in 823 ms of which 1 ms to minimize.
[2024-05-29 13:54:19] [INFO ] Deduced a trap composed of 22 places in 788 ms of which 1 ms to minimize.
[2024-05-29 13:54:20] [INFO ] Deduced a trap composed of 38 places in 800 ms of which 2 ms to minimize.
[2024-05-29 13:54:21] [INFO ] Deduced a trap composed of 20 places in 776 ms of which 1 ms to minimize.
[2024-05-29 13:54:22] [INFO ] Deduced a trap composed of 21 places in 794 ms of which 2 ms to minimize.
[2024-05-29 13:54:23] [INFO ] Deduced a trap composed of 24 places in 773 ms of which 1 ms to minimize.
[2024-05-29 13:54:24] [INFO ] Deduced a trap composed of 16 places in 772 ms of which 1 ms to minimize.
[2024-05-29 13:54:24] [INFO ] Deduced a trap composed of 23 places in 770 ms of which 2 ms to minimize.
[2024-05-29 13:54:25] [INFO ] Deduced a trap composed of 17 places in 742 ms of which 1 ms to minimize.
[2024-05-29 13:54:26] [INFO ] Deduced a trap composed of 35 places in 747 ms of which 2 ms to minimize.
[2024-05-29 13:54:27] [INFO ] Deduced a trap composed of 26 places in 718 ms of which 2 ms to minimize.
[2024-05-29 13:54:28] [INFO ] Deduced a trap composed of 34 places in 704 ms of which 1 ms to minimize.
[2024-05-29 13:54:29] [INFO ] Deduced a trap composed of 24 places in 716 ms of which 1 ms to minimize.
[2024-05-29 13:54:29] [INFO ] Deduced a trap composed of 29 places in 701 ms of which 2 ms to minimize.
[2024-05-29 13:54:30] [INFO ] Deduced a trap composed of 28 places in 701 ms of which 2 ms to minimize.
[2024-05-29 13:54:31] [INFO ] Deduced a trap composed of 27 places in 684 ms of which 2 ms to minimize.
[2024-05-29 13:54:32] [INFO ] Deduced a trap composed of 32 places in 698 ms of which 2 ms to minimize.
[2024-05-29 13:54:32] [INFO ] Deduced a trap composed of 29 places in 657 ms of which 2 ms to minimize.
[2024-05-29 13:54:33] [INFO ] Deduced a trap composed of 27 places in 669 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 13:54:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:54:33] [INFO ] After 25155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 1810 ms.
Support contains 14 out of 3357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Drop transitions removed 693 transitions
Trivial Post-agglo rules discarded 693 transitions
Performed 693 trivial Post agglomeration. Transition count delta: 693
Iterating post reduction 0 with 693 rules applied. Total rules applied 693 place count 3357 transition count 2314
Reduce places removed 693 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 695 rules applied. Total rules applied 1388 place count 2664 transition count 2312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1390 place count 2662 transition count 2312
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1390 place count 2662 transition count 1917
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 2180 place count 2267 transition count 1917
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 12 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 3 with 1696 rules applied. Total rules applied 3876 place count 1419 transition count 1069
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3877 place count 1419 transition count 1068
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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3879 place count 1418 transition count 1067
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4081 place count 1317 transition count 1067
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 5 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 4171 place count 1272 transition count 1067
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4173 place count 1272 transition count 1065
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4175 place count 1270 transition count 1065
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 5 with 149 rules applied. Total rules applied 4324 place count 1270 transition count 1065
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4325 place count 1269 transition count 1064
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4326 place count 1268 transition count 1064
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4326 place count 1268 transition count 1062
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4330 place count 1266 transition count 1062
Applied a total of 4330 rules in 669 ms. Remains 1266 /3357 variables (removed 2091) and now considering 1062/3007 (removed 1945) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 669 ms. Remains : 1266/3357 places, 1062/3007 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1062 rows 1266 cols
[2024-05-29 13:54:37] [INFO ] Computed 550 invariants in 13 ms
[2024-05-29 13:54:37] [INFO ] [Real]Absence check using 550 positive place invariants in 88 ms returned sat
[2024-05-29 13:54:37] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 13:54:37] [INFO ] [Nat]Absence check using 550 positive place invariants in 90 ms returned sat
[2024-05-29 13:54:38] [INFO ] After 760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 13:54:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:54:39] [INFO ] After 319ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-29 13:54:39] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 317 ms.
[2024-05-29 13:54:39] [INFO ] After 2483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 9 out of 1266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1266/1266 places, 1062/1062 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1266 transition count 1061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1265 transition count 1061
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1265 transition count 1060
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1264 transition count 1060
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 12 place count 1260 transition count 1056
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 1259 transition count 1055
Applied a total of 13 rules in 106 ms. Remains 1259 /1266 variables (removed 7) and now considering 1055/1062 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 1259/1266 places, 1055/1062 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 95514 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{5=1}
Probabilistic random walk after 95514 steps, saw 78008 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :1
Running SMT prover for 7 properties.
// Phase 1: matrix 1055 rows 1259 cols
[2024-05-29 13:54:43] [INFO ] Computed 550 invariants in 6 ms
[2024-05-29 13:54:44] [INFO ] [Real]Absence check using 550 positive place invariants in 78 ms returned sat
[2024-05-29 13:54:44] [INFO ] After 571ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2024-05-29 13:54:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:54:45] [INFO ] After 126ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 13:54:45] [INFO ] After 1074ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 13:54:45] [INFO ] [Nat]Absence check using 550 positive place invariants in 95 ms returned sat
[2024-05-29 13:54:46] [INFO ] After 718ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 13:54:46] [INFO ] After 277ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 13:54:46] [INFO ] After 741ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 265 ms.
[2024-05-29 13:54:47] [INFO ] After 2224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 8 out of 1259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1259/1259 places, 1055/1055 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 1258 transition count 1054
Applied a total of 2 rules in 58 ms. Remains 1258 /1259 variables (removed 1) and now considering 1054/1055 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 1258/1259 places, 1054/1055 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 87152 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87152 steps, saw 71303 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1054 rows 1258 cols
[2024-05-29 13:54:51] [INFO ] Computed 550 invariants in 7 ms
[2024-05-29 13:54:51] [INFO ] [Real]Absence check using 550 positive place invariants in 78 ms returned sat
[2024-05-29 13:54:52] [INFO ] After 946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 13:54:52] [INFO ] [Nat]Absence check using 550 positive place invariants in 87 ms returned sat
[2024-05-29 13:54:53] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 13:54:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:54:53] [INFO ] After 276ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 13:54:53] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-29 13:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-05-29 13:54:54] [INFO ] After 871ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 267 ms.
[2024-05-29 13:54:54] [INFO ] After 2290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 8 out of 1258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 1054/1054 transitions.
Applied a total of 0 rules in 30 ms. Remains 1258 /1258 variables (removed 0) and now considering 1054/1054 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1258/1258 places, 1054/1054 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1258/1258 places, 1054/1054 transitions.
Applied a total of 0 rules in 28 ms. Remains 1258 /1258 variables (removed 0) and now considering 1054/1054 (removed 0) transitions.
[2024-05-29 13:54:54] [INFO ] Invariant cache hit.
[2024-05-29 13:54:55] [INFO ] Implicit Places using invariants in 712 ms returned [1241, 1245]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 715 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1256/1258 places, 1054/1054 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1254 transition count 1052
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1254 transition count 1052
Applied a total of 4 rules in 51 ms. Remains 1254 /1256 variables (removed 2) and now considering 1052/1054 (removed 2) transitions.
// Phase 1: matrix 1052 rows 1254 cols
[2024-05-29 13:54:55] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 13:54:56] [INFO ] Implicit Places using invariants in 738 ms returned []
[2024-05-29 13:54:56] [INFO ] Invariant cache hit.
[2024-05-29 13:54:57] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1254/1258 places, 1052/1054 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2997 ms. Remains : 1254/1258 places, 1052/1054 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 13:54:58] [INFO ] Invariant cache hit.
[2024-05-29 13:54:58] [INFO ] [Real]Absence check using 548 positive place invariants in 90 ms returned sat
[2024-05-29 13:54:58] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:54:58] [INFO ] [Nat]Absence check using 548 positive place invariants in 90 ms returned sat
[2024-05-29 13:54:59] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:54:59] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:54:59] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2024-05-29 13:54:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
[2024-05-29 13:55:00] [INFO ] After 1359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 229 ms.
[2024-05-29 13:55:00] [INFO ] After 2036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 1254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1254/1254 places, 1052/1052 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1254 transition count 1051
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 1253 transition count 1051
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 4 place count 1252 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1251 transition count 1049
Applied a total of 5 rules in 86 ms. Remains 1251 /1254 variables (removed 3) and now considering 1049/1052 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1251/1254 places, 1049/1052 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 98466 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98466 steps, saw 80268 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1049 rows 1251 cols
[2024-05-29 13:55:04] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 13:55:04] [INFO ] [Real]Absence check using 548 positive place invariants in 87 ms returned sat
[2024-05-29 13:55:05] [INFO ] After 896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:55:05] [INFO ] [Nat]Absence check using 548 positive place invariants in 92 ms returned sat
[2024-05-29 13:55:06] [INFO ] After 628ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:55:06] [INFO ] After 1041ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 233 ms.
[2024-05-29 13:55:06] [INFO ] After 1722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 6 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 27 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1251/1251 places, 1049/1049 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1049/1049 transitions.
Applied a total of 0 rules in 28 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
[2024-05-29 13:55:07] [INFO ] Invariant cache hit.
[2024-05-29 13:55:07] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-29 13:55:07] [INFO ] Invariant cache hit.
[2024-05-29 13:55:09] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
[2024-05-29 13:55:09] [INFO ] Redundant transitions in 55 ms returned []
[2024-05-29 13:55:09] [INFO ] Invariant cache hit.
[2024-05-29 13:55:09] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2870 ms. Remains : 1251/1251 places, 1049/1049 transitions.
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 0 with 290 rules applied. Total rules applied 290 place count 1251 transition count 1049
Applied a total of 290 rules in 61 ms. Remains 1251 /1251 variables (removed 0) and now considering 1049/1049 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1049 rows 1251 cols
[2024-05-29 13:55:09] [INFO ] Computed 548 invariants in 8 ms
[2024-05-29 13:55:10] [INFO ] [Real]Absence check using 548 positive place invariants in 99 ms returned sat
[2024-05-29 13:55:10] [INFO ] After 909ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:55:11] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2024-05-29 13:55:11] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:55:11] [INFO ] State equation strengthened by 286 read => feed constraints.
[2024-05-29 13:55:12] [INFO ] After 502ms SMT Verify possible using 286 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:55:12] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2024-05-29 13:55:13] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 4 ms to minimize.
[2024-05-29 13:55:13] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2024-05-29 13:55:13] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
[2024-05-29 13:55:13] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2024-05-29 13:55:14] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2024-05-29 13:55:14] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2024-05-29 13:55:14] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2024-05-29 13:55:15] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2024-05-29 13:55:15] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 13:55:15] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 1 ms to minimize.
[2024-05-29 13:55:16] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2024-05-29 13:55:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3558 ms
[2024-05-29 13:55:16] [INFO ] After 4498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 305 ms.
[2024-05-29 13:55:16] [INFO ] After 5901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 798 stabilizing places and 798 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((p0&&X((p0 U (G(p0)||(X(X(X(G(p1))))&&F(p0)))))))))'
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3356 transition count 2306
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2656 transition count 2306
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 397 Pre rules applied. Total rules applied 1400 place count 2656 transition count 1909
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 2194 place count 2259 transition count 1909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2196 place count 2257 transition count 1907
Iterating global reduction 2 with 2 rules applied. Total rules applied 2198 place count 2257 transition count 1907
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2198 place count 2257 transition count 1905
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2202 place count 2255 transition count 1905
Performed 851 Post agglomeration using F-continuation condition.Transition count delta: 851
Deduced a syphon composed of 851 places in 1 ms
Reduce places removed 851 places and 0 transitions.
Iterating global reduction 2 with 1702 rules applied. Total rules applied 3904 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3905 place count 1404 transition count 1053
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 3907 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4109 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4205 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4207 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4208 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4208 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4212 place count 1249 transition count 1048
Applied a total of 4212 rules in 691 ms. Remains 1249 /3357 variables (removed 2108) and now considering 1048/3007 (removed 1959) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2024-05-29 13:55:17] [INFO ] Computed 550 invariants in 7 ms
[2024-05-29 13:55:18] [INFO ] Implicit Places using invariants in 758 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 760 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3357 places, 1048/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 56 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:55:18] [INFO ] Computed 548 invariants in 7 ms
[2024-05-29 13:55:19] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-29 13:55:19] [INFO ] Invariant cache hit.
[2024-05-29 13:55:20] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3357 places, 1046/3007 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3599 ms. Remains : 1245/3357 places, 1046/3007 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 1020 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={1} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 6}, { cond=p0, acceptance={0, 1} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=5 dest: 8}, { cond=(NOT p0), acceptance={} source=5 dest: 9}, { cond=p0, acceptance={1} source=5 dest: 10}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 11}, { cond=p0, acceptance={0, 1} source=6 dest: 12}], [{ cond=(NOT p0), acceptance={0, 1} source=7 dest: 13}, { cond=(NOT p0), acceptance={} source=7 dest: 14}, { cond=p0, acceptance={1} source=7 dest: 15}], [{ cond=(NOT p0), acceptance={0, 1} source=8 dest: 16}, { cond=p0, acceptance={0, 1} source=8 dest: 17}], [{ cond=(NOT p0), acceptance={} source=9 dest: 14}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}, { cond=(NOT p0), acceptance={0, 1} source=10 dest: 18}, { cond=p0, acceptance={1} source=10 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=11 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=11 dest: 11}, { cond=(AND p0 p1), acceptance={0} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=12 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=12 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=12 dest: 13}, { cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 14}, { cond=(AND p0 p1), acceptance={} source=12 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=13 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=13 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=13 dest: 16}, { cond=(AND p0 p1), acceptance={0} source=13 dest: 17}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=15 dest: 8}, { cond=(NOT p0), acceptance={} source=15 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={1} source=15 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={0} source=15 dest: 18}, { cond=(AND p0 p1), acceptance={} source=15 dest: 19}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=16 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=16 dest: 11}, { cond=(AND p0 p1), acceptance={0} source=16 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=16 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=17 dest: 13}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=17 dest: 13}, { cond=(NOT p0), acceptance={} source=17 dest: 14}, { cond=(AND p0 p1), acceptance={} source=17 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={1} source=17 dest: 15}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=18 dest: 16}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=18 dest: 16}, { cond=(AND p0 p1), acceptance={0} source=18 dest: 17}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=18 dest: 17}], [{ cond=(NOT p0), acceptance={} source=19 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={0} source=19 dest: 18}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=19 dest: 18}, { cond=(AND p0 p1), acceptance={} source=19 dest: 19}, { cond=(AND p0 (NOT p1)), acceptance={1} source=19 dest: 19}]], initial=0, aps=[p0:(NEQ s28 1), p1:(NEQ s853 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 930 ms.
Product exploration explored 100000 steps with 0 reset in 1165 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 20 states, 64 edges and 2 AP (stutter insensitive) to 30 states, 106 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1356 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 116513 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116513 steps, saw 86121 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 13:55:29] [INFO ] Invariant cache hit.
[2024-05-29 13:55:29] [INFO ] [Real]Absence check using 548 positive place invariants in 89 ms returned sat
[2024-05-29 13:55:29] [INFO ] After 877ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 13:55:30] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2024-05-29 13:55:30] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 13:55:31] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 200 ms.
[2024-05-29 13:55:31] [INFO ] After 1539ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 2 properties in 140 ms.
Support contains 2 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 26 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 141541 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141541 steps, saw 104646 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 13:55:35] [INFO ] Invariant cache hit.
[2024-05-29 13:55:35] [INFO ] [Real]Absence check using 548 positive place invariants in 94 ms returned sat
[2024-05-29 13:55:35] [INFO ] After 812ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:55:36] [INFO ] [Nat]Absence check using 548 positive place invariants in 93 ms returned sat
[2024-05-29 13:55:36] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:55:36] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-05-29 13:55:37] [INFO ] After 1189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 29 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2024-05-29 13:55:37] [INFO ] Invariant cache hit.
[2024-05-29 13:55:37] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-05-29 13:55:37] [INFO ] Invariant cache hit.
[2024-05-29 13:55:39] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2230 ms to find 0 implicit places.
[2024-05-29 13:55:39] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 13:55:39] [INFO ] Invariant cache hit.
[2024-05-29 13:55:40] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2882 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 0 with 295 rules applied. Total rules applied 295 place count 1245 transition count 1046
Applied a total of 295 rules in 56 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:55:40] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 13:55:40] [INFO ] [Real]Absence check using 548 positive place invariants in 98 ms returned sat
[2024-05-29 13:55:40] [INFO ] After 450ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-29 13:55:40] [INFO ] After 518ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:55:40] [INFO ] After 886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:55:41] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2024-05-29 13:55:41] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:55:42] [INFO ] After 744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-05-29 13:55:42] [INFO ] After 1192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 30 states, 106 edges and 2 AP (stutter insensitive) to 30 states, 106 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1306 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1364 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Support contains 2 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:55:45] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 13:55:45] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-29 13:55:45] [INFO ] Invariant cache hit.
[2024-05-29 13:55:47] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
[2024-05-29 13:55:47] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 13:55:47] [INFO ] Invariant cache hit.
[2024-05-29 13:55:47] [INFO ] Dead Transitions using invariants and state equation in 603 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2826 ms. Remains : 1245/1245 places, 1046/1046 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 : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 190 ms. Reduced automaton from 30 states, 106 edges and 2 AP (stutter insensitive) to 30 states, 106 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1280 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 122055 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122055 steps, saw 90242 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 13:55:53] [INFO ] Invariant cache hit.
[2024-05-29 13:55:53] [INFO ] [Real]Absence check using 548 positive place invariants in 87 ms returned sat
[2024-05-29 13:55:53] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 13:55:54] [INFO ] [Nat]Absence check using 548 positive place invariants in 88 ms returned sat
[2024-05-29 13:55:54] [INFO ] After 601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 13:55:55] [INFO ] After 931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 199 ms.
[2024-05-29 13:55:55] [INFO ] After 1526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 2 properties in 66 ms.
Support contains 2 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 152831 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152831 steps, saw 112128 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 13:55:58] [INFO ] Invariant cache hit.
[2024-05-29 13:55:59] [INFO ] [Real]Absence check using 548 positive place invariants in 85 ms returned sat
[2024-05-29 13:55:59] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:55:59] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2024-05-29 13:56:00] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:56:00] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-29 13:56:00] [INFO ] After 1171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 23 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2024-05-29 13:56:00] [INFO ] Invariant cache hit.
[2024-05-29 13:56:01] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-29 13:56:01] [INFO ] Invariant cache hit.
[2024-05-29 13:56:03] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
[2024-05-29 13:56:03] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 13:56:03] [INFO ] Invariant cache hit.
[2024-05-29 13:56:03] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2858 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 295 times.
Drop transitions removed 295 transitions
Iterating global reduction 0 with 295 rules applied. Total rules applied 295 place count 1245 transition count 1046
Applied a total of 295 rules in 57 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:56:03] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 13:56:04] [INFO ] [Real]Absence check using 548 positive place invariants in 90 ms returned sat
[2024-05-29 13:56:04] [INFO ] After 486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-29 13:56:04] [INFO ] After 551ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:56:04] [INFO ] After 889ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 13:56:04] [INFO ] [Nat]Absence check using 548 positive place invariants in 91 ms returned sat
[2024-05-29 13:56:05] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 13:56:05] [INFO ] After 753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 124 ms.
[2024-05-29 13:56:05] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 11 factoid took 239 ms. Reduced automaton from 30 states, 106 edges and 2 AP (stutter insensitive) to 30 states, 106 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1284 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1200 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1320 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), false, (NOT p0), (AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 776 ms.
Product exploration explored 100000 steps with 0 reset in 1138 ms.
Built C files in :
/tmp/ltsmin12722885889048187754
[2024-05-29 13:56:11] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2024-05-29 13:56:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:56:11] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2024-05-29 13:56:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:56:12] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2024-05-29 13:56:12] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:56:12] [INFO ] Built C files in 220ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12722885889048187754
Running compilation step : cd /tmp/ltsmin12722885889048187754;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12722885889048187754;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12722885889048187754;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:56:15] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 13:56:15] [INFO ] Implicit Places using invariants in 702 ms returned []
[2024-05-29 13:56:15] [INFO ] Invariant cache hit.
[2024-05-29 13:56:17] [INFO ] Implicit Places using invariants and state equation in 1387 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2024-05-29 13:56:17] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 13:56:17] [INFO ] Invariant cache hit.
[2024-05-29 13:56:17] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2746 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Built C files in :
/tmp/ltsmin124618884194195592
[2024-05-29 13:56:17] [INFO ] Computing symmetric may disable matrix : 1046 transitions.
[2024-05-29 13:56:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:56:17] [INFO ] Computing symmetric may enable matrix : 1046 transitions.
[2024-05-29 13:56:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:56:18] [INFO ] Computing Do-Not-Accords matrix : 1046 transitions.
[2024-05-29 13:56:18] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 13:56:18] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin124618884194195592
Running compilation step : cd /tmp/ltsmin124618884194195592;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin124618884194195592;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin124618884194195592;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 13:56:21] [INFO ] Flatten gal took : 36 ms
[2024-05-29 13:56:21] [INFO ] Flatten gal took : 35 ms
[2024-05-29 13:56:21] [INFO ] Time to serialize gal into /tmp/LTL8758755889873303700.gal : 12 ms
[2024-05-29 13:56:21] [INFO ] Time to serialize properties into /tmp/LTL9737454397151083053.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/LTL8758755889873303700.gal' '-t' 'CGAL' '-hoa' '/tmp/aut801192924273859198.hoa' '-atoms' '/tmp/LTL9737454397151083053.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/LTL9737454397151083053.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut801192924273859198.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2024-05-29 13:56:36] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:56:36] [INFO ] Flatten gal took : 30 ms
[2024-05-29 13:56:36] [INFO ] Time to serialize gal into /tmp/LTL2806196954942093795.gal : 7 ms
[2024-05-29 13:56:36] [INFO ] Time to serialize properties into /tmp/LTL4290259361053076513.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/LTL2806196954942093795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4290259361053076513.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(F(("(p139!=1)")&&(X(("(p139!=1)")U((G("(p139!=1)"))||((X(X(X(G("(p2668!=1)")))))&&(F("(p139!=1)"))))))))))
Formula 0 simplified : FG(!"(p139!=1)" | X(!"(p139!=1)" M (XXXF!"(p2668!=1)" | G!"(p139!=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2024-05-29 13:56:51] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:56:51] [INFO ] Applying decomposition
[2024-05-29 13:56:51] [INFO ] Flatten gal took : 29 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/graph11532246265292190933.txt' '-o' '/tmp/graph11532246265292190933.bin' '-w' '/tmp/graph11532246265292190933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11532246265292190933.bin' '-l' '-1' '-v' '-w' '/tmp/graph11532246265292190933.weights' '-q' '0' '-e' '0.001'
[2024-05-29 13:56:51] [INFO ] Decomposing Gal with order
[2024-05-29 13:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:56:52] [INFO ] Removed a total of 302 redundant transitions.
[2024-05-29 13:56:52] [INFO ] Flatten gal took : 107 ms
[2024-05-29 13:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 18 ms.
[2024-05-29 13:56:52] [INFO ] Time to serialize gal into /tmp/LTL478618888375396481.gal : 16 ms
[2024-05-29 13:56:52] [INFO ] Time to serialize properties into /tmp/LTL11018420454522573369.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/LTL478618888375396481.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11018420454522573369.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(F(("(i0.i1.i2.u10.p139!=1)")&&(X(("(i0.i1.i2.u10.p139!=1)")U((G("(i0.i1.i2.u10.p139!=1)"))||((X(X(X(G("(i18.u272.p2668!=1)")))))&...193
Formula 0 simplified : FG(!"(i0.i1.i2.u10.p139!=1)" | X(!"(i0.i1.i2.u10.p139!=1)" M (XXXF!"(i18.u272.p2668!=1)" | G!"(i0.i1.i2.u10.p139!=1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
421 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,4.34605,101456,1,0,157001,310,4043,321717,246,1891,199149
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-050B-LTLFireability-00 finished in 99744 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 1 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3351 transition count 3001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3351 transition count 3001
Applied a total of 12 rules in 437 ms. Remains 3351 /3357 variables (removed 6) and now considering 3001/3007 (removed 6) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2024-05-29 13:56:57] [INFO ] Computed 551 invariants in 18 ms
[2024-05-29 13:56:58] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2024-05-29 13:56:58] [INFO ] Invariant cache hit.
[2024-05-29 13:57:02] [INFO ] Implicit Places using invariants and state equation in 3652 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2024-05-29 13:57:02] [INFO ] Invariant cache hit.
[2024-05-29 13:57:04] [INFO ] Dead Transitions using invariants and state equation in 2303 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3357 places, 3001/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7702 ms. Remains : 3351/3357 places, 3001/3007 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-02 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:(EQ s2995 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 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-02 finished in 7823 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((G(F(p1))||(F(p1)&&F(!p2))||p0))))'
Support contains 3 out of 3357 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 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3356 transition count 2310
Reduce places removed 696 places and 0 transitions.
Iterating post reduction 1 with 696 rules applied. Total rules applied 1392 place count 2660 transition count 2310
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1392 place count 2660 transition count 1911
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 2190 place count 2261 transition count 1911
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2193 place count 2258 transition count 1908
Iterating global reduction 2 with 3 rules applied. Total rules applied 2196 place count 2258 transition count 1908
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2196 place count 2258 transition count 1905
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2202 place count 2255 transition count 1905
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3896 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3897 place count 1408 transition count 1057
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 3899 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4101 place count 1306 transition count 1056
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4197 place count 1258 transition count 1056
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4199 place count 1256 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4200 place count 1255 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4200 place count 1255 transition count 1052
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4204 place count 1253 transition count 1052
Applied a total of 4204 rules in 533 ms. Remains 1253 /3357 variables (removed 2104) and now considering 1052/3007 (removed 1955) transitions.
// Phase 1: matrix 1052 rows 1253 cols
[2024-05-29 13:57:05] [INFO ] Computed 550 invariants in 5 ms
[2024-05-29 13:57:05] [INFO ] Implicit Places using invariants in 688 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 691 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3357 places, 1052/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1050
Applied a total of 4 rules in 53 ms. Remains 1249 /1251 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1249 cols
[2024-05-29 13:57:05] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 13:57:06] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-05-29 13:57:06] [INFO ] Invariant cache hit.
[2024-05-29 13:57:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 13:57:08] [INFO ] Implicit Places using invariants and state equation in 1528 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3357 places, 1050/3007 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3506 ms. Remains : 1249/3357 places, 1050/3007 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s453 1), p0:(OR (EQ s1094 0) (EQ s1129 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 284 reset in 771 ms.
Stack based approach found an accepted trace after 1646 steps with 5 reset with depth 216 and stack size 215 in 15 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-03 finished in 4395 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)&&(p1 U p2))))'
Support contains 3 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3351 transition count 3001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3351 transition count 3001
Applied a total of 12 rules in 445 ms. Remains 3351 /3357 variables (removed 6) and now considering 3001/3007 (removed 6) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2024-05-29 13:57:09] [INFO ] Computed 551 invariants in 16 ms
[2024-05-29 13:57:10] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2024-05-29 13:57:10] [INFO ] Invariant cache hit.
[2024-05-29 13:57:14] [INFO ] Implicit Places using invariants and state equation in 3544 ms returned []
Implicit Place search using SMT with State Equation took 4861 ms to find 0 implicit places.
[2024-05-29 13:57:14] [INFO ] Invariant cache hit.
[2024-05-29 13:57:16] [INFO ] Dead Transitions using invariants and state equation in 2380 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3357 places, 3001/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7686 ms. Remains : 3351/3357 places, 3001/3007 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1379 1), p2:(EQ s969 1), p1:(EQ s2791 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-04 finished in 7852 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((F(p0) U p1)))&&F(p2)))'
Support contains 4 out of 3357 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3356 transition count 2307
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2657 transition count 2307
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 396 Pre rules applied. Total rules applied 1398 place count 2657 transition count 1911
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 2 with 792 rules applied. Total rules applied 2190 place count 2261 transition count 1911
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 2193 place count 2258 transition count 1908
Iterating global reduction 2 with 3 rules applied. Total rules applied 2196 place count 2258 transition count 1908
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2196 place count 2258 transition count 1905
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 2202 place count 2255 transition count 1905
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3896 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3897 place count 1408 transition count 1057
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 3899 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4101 place count 1306 transition count 1056
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4197 place count 1258 transition count 1056
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4199 place count 1256 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4200 place count 1255 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4200 place count 1255 transition count 1052
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4204 place count 1253 transition count 1052
Applied a total of 4204 rules in 538 ms. Remains 1253 /3357 variables (removed 2104) and now considering 1052/3007 (removed 1955) transitions.
// Phase 1: matrix 1052 rows 1253 cols
[2024-05-29 13:57:17] [INFO ] Computed 550 invariants in 6 ms
[2024-05-29 13:57:18] [INFO ] Implicit Places using invariants in 705 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 706 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3357 places, 1052/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1249 transition count 1050
Applied a total of 4 rules in 45 ms. Remains 1249 /1251 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1249 cols
[2024-05-29 13:57:18] [INFO ] Computed 548 invariants in 2 ms
[2024-05-29 13:57:18] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-29 13:57:18] [INFO ] Invariant cache hit.
[2024-05-29 13:57:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:57:20] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3357 places, 1050/3007 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3493 ms. Remains : 1249/3357 places, 1050/3007 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s300 1), p1:(AND (EQ s831 1) (EQ s856 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 732 ms.
Stack based approach found an accepted trace after 32 steps with 2 reset with depth 19 and stack size 19 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-05 finished in 4467 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(G(p0))&&G((p1 U p0)))))'
Support contains 3 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3352 transition count 3002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3352 transition count 3002
Applied a total of 10 rules in 435 ms. Remains 3352 /3357 variables (removed 5) and now considering 3002/3007 (removed 5) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2024-05-29 13:57:21] [INFO ] Computed 551 invariants in 18 ms
[2024-05-29 13:57:23] [INFO ] Implicit Places using invariants in 1347 ms returned []
[2024-05-29 13:57:23] [INFO ] Invariant cache hit.
[2024-05-29 13:57:26] [INFO ] Implicit Places using invariants and state equation in 3709 ms returned []
Implicit Place search using SMT with State Equation took 5057 ms to find 0 implicit places.
[2024-05-29 13:57:26] [INFO ] Invariant cache hit.
[2024-05-29 13:57:29] [INFO ] Dead Transitions using invariants and state equation in 2369 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3357 places, 3002/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7864 ms. Remains : 3352/3357 places, 3002/3007 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2942 1), p1:(OR (EQ s190 1) (EQ s3168 1) (EQ s2942 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-06 finished in 8056 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&&X(p1))))))'
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3351 transition count 3001
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3351 transition count 3001
Applied a total of 12 rules in 435 ms. Remains 3351 /3357 variables (removed 6) and now considering 3001/3007 (removed 6) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2024-05-29 13:57:29] [INFO ] Computed 551 invariants in 19 ms
[2024-05-29 13:57:31] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2024-05-29 13:57:31] [INFO ] Invariant cache hit.
[2024-05-29 13:57:34] [INFO ] Implicit Places using invariants and state equation in 3500 ms returned []
Implicit Place search using SMT with State Equation took 4747 ms to find 0 implicit places.
[2024-05-29 13:57:34] [INFO ] Invariant cache hit.
[2024-05-29 13:57:36] [INFO ] Dead Transitions using invariants and state equation in 2356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3357 places, 3001/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7541 ms. Remains : 3351/3357 places, 3001/3007 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s2804 0), p1:(EQ s230 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33252 reset in 1534 ms.
Product exploration explored 100000 steps with 33313 reset in 1529 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:57:40] [INFO ] Invariant cache hit.
[2024-05-29 13:57:41] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:57:41] [INFO ] [Nat]Absence check using 551 positive place invariants in 229 ms returned sat
[2024-05-29 13:57:43] [INFO ] After 1775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:57:44] [INFO ] Deduced a trap composed of 26 places in 842 ms of which 2 ms to minimize.
[2024-05-29 13:57:45] [INFO ] Deduced a trap composed of 22 places in 840 ms of which 4 ms to minimize.
[2024-05-29 13:57:46] [INFO ] Deduced a trap composed of 28 places in 842 ms of which 2 ms to minimize.
[2024-05-29 13:57:47] [INFO ] Deduced a trap composed of 24 places in 833 ms of which 2 ms to minimize.
[2024-05-29 13:57:48] [INFO ] Deduced a trap composed of 18 places in 803 ms of which 2 ms to minimize.
[2024-05-29 13:57:49] [INFO ] Deduced a trap composed of 18 places in 789 ms of which 2 ms to minimize.
[2024-05-29 13:57:49] [INFO ] Deduced a trap composed of 18 places in 745 ms of which 2 ms to minimize.
[2024-05-29 13:57:50] [INFO ] Deduced a trap composed of 20 places in 747 ms of which 2 ms to minimize.
[2024-05-29 13:57:51] [INFO ] Deduced a trap composed of 26 places in 738 ms of which 1 ms to minimize.
[2024-05-29 13:57:52] [INFO ] Deduced a trap composed of 20 places in 719 ms of which 2 ms to minimize.
[2024-05-29 13:57:53] [INFO ] Deduced a trap composed of 29 places in 697 ms of which 2 ms to minimize.
[2024-05-29 13:57:53] [INFO ] Deduced a trap composed of 28 places in 695 ms of which 2 ms to minimize.
[2024-05-29 13:57:54] [INFO ] Deduced a trap composed of 28 places in 689 ms of which 8 ms to minimize.
[2024-05-29 13:57:55] [INFO ] Deduced a trap composed of 24 places in 676 ms of which 1 ms to minimize.
[2024-05-29 13:57:56] [INFO ] Deduced a trap composed of 32 places in 689 ms of which 1 ms to minimize.
[2024-05-29 13:57:57] [INFO ] Deduced a trap composed of 36 places in 643 ms of which 1 ms to minimize.
[2024-05-29 13:57:57] [INFO ] Deduced a trap composed of 27 places in 638 ms of which 2 ms to minimize.
[2024-05-29 13:57:58] [INFO ] Deduced a trap composed of 27 places in 635 ms of which 1 ms to minimize.
[2024-05-29 13:57:59] [INFO ] Deduced a trap composed of 25 places in 630 ms of which 3 ms to minimize.
[2024-05-29 13:57:59] [INFO ] Deduced a trap composed of 22 places in 614 ms of which 1 ms to minimize.
[2024-05-29 13:58:00] [INFO ] Deduced a trap composed of 23 places in 614 ms of which 2 ms to minimize.
[2024-05-29 13:58:01] [INFO ] Deduced a trap composed of 31 places in 602 ms of which 1 ms to minimize.
[2024-05-29 13:58:02] [INFO ] Deduced a trap composed of 47 places in 600 ms of which 1 ms to minimize.
[2024-05-29 13:58:02] [INFO ] Deduced a trap composed of 35 places in 625 ms of which 2 ms to minimize.
[2024-05-29 13:58:03] [INFO ] Deduced a trap composed of 28 places in 603 ms of which 1 ms to minimize.
[2024-05-29 13:58:04] [INFO ] Deduced a trap composed of 30 places in 597 ms of which 2 ms to minimize.
[2024-05-29 13:58:04] [INFO ] Deduced a trap composed of 21 places in 582 ms of which 2 ms to minimize.
[2024-05-29 13:58:05] [INFO ] Deduced a trap composed of 36 places in 561 ms of which 1 ms to minimize.
[2024-05-29 13:58:06] [INFO ] Deduced a trap composed of 38 places in 584 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:58:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:58:06] [INFO ] After 25195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
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 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4347 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4348 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4352 place count 1249 transition count 1048
Applied a total of 4352 rules in 453 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) 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 180170 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180170 steps, saw 150851 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2024-05-29 13:58:09] [INFO ] Computed 550 invariants in 4 ms
[2024-05-29 13:58:10] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:58:10] [INFO ] [Nat]Absence check using 550 positive place invariants in 91 ms returned sat
[2024-05-29 13:58:10] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:58:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:58:10] [INFO ] After 38ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-05-29 13:58:11] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-29 13:58:11] [INFO ] After 1017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-29 13:58:11] [INFO ] Invariant cache hit.
[2024-05-29 13:58:11] [INFO ] Implicit Places using invariants in 741 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 744 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 47 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:58:11] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 13:58:12] [INFO ] Implicit Places using invariants in 735 ms returned []
[2024-05-29 13:58:12] [INFO ] Invariant cache hit.
[2024-05-29 13:58:14] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3042 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 180733 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180733 steps, saw 150977 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:58:17] [INFO ] Invariant cache hit.
[2024-05-29 13:58:17] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:58:17] [INFO ] [Nat]Absence check using 548 positive place invariants in 89 ms returned sat
[2024-05-29 13:58:18] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:58:18] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-29 13:58:18] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2024-05-29 13:58:18] [INFO ] Invariant cache hit.
[2024-05-29 13:58:19] [INFO ] Implicit Places using invariants in 742 ms returned []
[2024-05-29 13:58:19] [INFO ] Invariant cache hit.
[2024-05-29 13:58:20] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 2157 ms to find 0 implicit places.
[2024-05-29 13:58:20] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 13:58:20] [INFO ] Invariant cache hit.
[2024-05-29 13:58:21] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2825 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 63 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:58:21] [INFO ] Computed 548 invariants in 2 ms
[2024-05-29 13:58:21] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:58:21] [INFO ] [Nat]Absence check using 548 positive place invariants in 91 ms returned sat
[2024-05-29 13:58:22] [INFO ] After 475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:58:22] [INFO ] State equation strengthened by 294 read => feed constraints.
[2024-05-29 13:58:22] [INFO ] After 141ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:58:22] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 0 ms to minimize.
[2024-05-29 13:58:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-05-29 13:58:22] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 13:58:22] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 221 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2024-05-29 13:58:23] [INFO ] Computed 551 invariants in 16 ms
[2024-05-29 13:58:24] [INFO ] Implicit Places using invariants in 1286 ms returned []
[2024-05-29 13:58:24] [INFO ] Invariant cache hit.
[2024-05-29 13:58:28] [INFO ] Implicit Places using invariants and state equation in 3675 ms returned []
Implicit Place search using SMT with State Equation took 4961 ms to find 0 implicit places.
[2024-05-29 13:58:28] [INFO ] Invariant cache hit.
[2024-05-29 13:58:30] [INFO ] Dead Transitions using invariants and state equation in 2415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7598 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:58:31] [INFO ] Invariant cache hit.
[2024-05-29 13:58:31] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:58:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 220 ms returned sat
[2024-05-29 13:58:34] [INFO ] After 1771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 26 places in 874 ms of which 1 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 22 places in 849 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 28 places in 839 ms of which 2 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 24 places in 839 ms of which 2 ms to minimize.
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 18 places in 826 ms of which 1 ms to minimize.
[2024-05-29 13:58:39] [INFO ] Deduced a trap composed of 18 places in 823 ms of which 2 ms to minimize.
[2024-05-29 13:58:40] [INFO ] Deduced a trap composed of 18 places in 771 ms of which 1 ms to minimize.
[2024-05-29 13:58:41] [INFO ] Deduced a trap composed of 20 places in 770 ms of which 2 ms to minimize.
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 26 places in 762 ms of which 3 ms to minimize.
[2024-05-29 13:58:43] [INFO ] Deduced a trap composed of 20 places in 740 ms of which 2 ms to minimize.
[2024-05-29 13:58:43] [INFO ] Deduced a trap composed of 29 places in 722 ms of which 2 ms to minimize.
[2024-05-29 13:58:44] [INFO ] Deduced a trap composed of 28 places in 708 ms of which 2 ms to minimize.
[2024-05-29 13:58:45] [INFO ] Deduced a trap composed of 28 places in 721 ms of which 11 ms to minimize.
[2024-05-29 13:58:46] [INFO ] Deduced a trap composed of 24 places in 702 ms of which 2 ms to minimize.
[2024-05-29 13:58:47] [INFO ] Deduced a trap composed of 32 places in 687 ms of which 1 ms to minimize.
[2024-05-29 13:58:47] [INFO ] Deduced a trap composed of 36 places in 684 ms of which 2 ms to minimize.
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 27 places in 663 ms of which 1 ms to minimize.
[2024-05-29 13:58:49] [INFO ] Deduced a trap composed of 27 places in 667 ms of which 2 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 25 places in 661 ms of which 1 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 22 places in 660 ms of which 2 ms to minimize.
[2024-05-29 13:58:51] [INFO ] Deduced a trap composed of 23 places in 656 ms of which 1 ms to minimize.
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 31 places in 623 ms of which 1 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 47 places in 632 ms of which 1 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 35 places in 633 ms of which 2 ms to minimize.
[2024-05-29 13:58:54] [INFO ] Deduced a trap composed of 28 places in 620 ms of which 2 ms to minimize.
[2024-05-29 13:58:55] [INFO ] Deduced a trap composed of 30 places in 607 ms of which 2 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 21 places in 592 ms of which 1 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 36 places in 574 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:58:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:58:56] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
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 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 2 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
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 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4347 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4348 place count 1251 transition count 1048
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4352 place count 1249 transition count 1048
Applied a total of 4352 rules in 432 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188837 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188837 steps, saw 158302 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2024-05-29 13:59:00] [INFO ] Computed 550 invariants in 6 ms
[2024-05-29 13:59:00] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:59:00] [INFO ] [Nat]Absence check using 550 positive place invariants in 89 ms returned sat
[2024-05-29 13:59:01] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:59:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 13:59:01] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:59:01] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:59:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2024-05-29 13:59:01] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-29 13:59:01] [INFO ] After 1029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-29 13:59:01] [INFO ] Invariant cache hit.
[2024-05-29 13:59:02] [INFO ] Implicit Places using invariants in 716 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 717 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 47 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:59:02] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 13:59:03] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-29 13:59:03] [INFO ] Invariant cache hit.
[2024-05-29 13:59:04] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3020 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188157 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188157 steps, saw 157438 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 13:59:07] [INFO ] Invariant cache hit.
[2024-05-29 13:59:07] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:59:08] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2024-05-29 13:59:08] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:59:08] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 13:59:08] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 25 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2024-05-29 13:59:08] [INFO ] Invariant cache hit.
[2024-05-29 13:59:09] [INFO ] Implicit Places using invariants in 719 ms returned []
[2024-05-29 13:59:09] [INFO ] Invariant cache hit.
[2024-05-29 13:59:10] [INFO ] Implicit Places using invariants and state equation in 1487 ms returned []
Implicit Place search using SMT with State Equation took 2207 ms to find 0 implicit places.
[2024-05-29 13:59:11] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-29 13:59:11] [INFO ] Invariant cache hit.
[2024-05-29 13:59:11] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2872 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 56 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 13:59:11] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 13:59:11] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 13:59:12] [INFO ] [Nat]Absence check using 548 positive place invariants in 89 ms returned sat
[2024-05-29 13:59:12] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 13:59:12] [INFO ] State equation strengthened by 294 read => feed constraints.
[2024-05-29 13:59:12] [INFO ] After 134ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 13:59:13] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
[2024-05-29 13:59:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2024-05-29 13:59:13] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-05-29 13:59:13] [INFO ] After 1346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33404 reset in 1535 ms.
Product exploration explored 100000 steps with 33340 reset in 1534 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 248 Pre rules applied. Total rules applied 700 place count 3351 transition count 3199
Deduced a syphon composed of 948 places in 6 ms
Iterating global reduction 1 with 248 rules applied. Total rules applied 948 place count 3351 transition count 3199
Performed 950 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1898 places in 5 ms
Iterating global reduction 1 with 950 rules applied. Total rules applied 1898 place count 3351 transition count 3199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1899 place count 3351 transition count 3198
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2251 place count 2999 transition count 2846
Deduced a syphon composed of 1546 places in 5 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2603 place count 2999 transition count 2846
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2604 place count 2999 transition count 2846
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2606 place count 2997 transition count 2844
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2608 place count 2997 transition count 2844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2709 place count 2997 transition count 3274
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2810 place count 2896 transition count 3072
Deduced a syphon composed of 1545 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2911 place count 2896 transition count 3072
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -411
Deduced a syphon composed of 1641 places in 4 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3007 place count 2896 transition count 3483
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 3103 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 4 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3199 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 4 ms
Applied a total of 3199 rules in 2294 ms. Remains 2800 /3351 variables (removed 551) and now considering 3291/3001 (removed -290) transitions.
[2024-05-29 13:59:19] [INFO ] Redundant transitions in 107 ms returned []
// Phase 1: matrix 3291 rows 2800 cols
[2024-05-29 13:59:19] [INFO ] Computed 551 invariants in 35 ms
[2024-05-29 13:59:21] [INFO ] Dead Transitions using invariants and state equation in 2223 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3291/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4636 ms. Remains : 2800/3351 places, 3291/3001 transitions.
Built C files in :
/tmp/ltsmin2755980362113646539
[2024-05-29 13:59:21] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2755980362113646539
Running compilation step : cd /tmp/ltsmin2755980362113646539;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2755980362113646539;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2755980362113646539;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 243 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2024-05-29 13:59:25] [INFO ] Computed 551 invariants in 17 ms
[2024-05-29 13:59:26] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2024-05-29 13:59:26] [INFO ] Invariant cache hit.
[2024-05-29 13:59:30] [INFO ] Implicit Places using invariants and state equation in 3655 ms returned []
Implicit Place search using SMT with State Equation took 4945 ms to find 0 implicit places.
[2024-05-29 13:59:30] [INFO ] Invariant cache hit.
[2024-05-29 13:59:32] [INFO ] Dead Transitions using invariants and state equation in 2402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7590 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Built C files in :
/tmp/ltsmin2317842948694755862
[2024-05-29 13:59:32] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2317842948694755862
Running compilation step : cd /tmp/ltsmin2317842948694755862;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2317842948694755862;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2317842948694755862;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 13:59:35] [INFO ] Flatten gal took : 67 ms
[2024-05-29 13:59:35] [INFO ] Flatten gal took : 68 ms
[2024-05-29 13:59:35] [INFO ] Time to serialize gal into /tmp/LTL8328299836605929056.gal : 11 ms
[2024-05-29 13:59:35] [INFO ] Time to serialize properties into /tmp/LTL6104419495949262176.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/LTL8328299836605929056.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6636406248950098305.hoa' '-atoms' '/tmp/LTL6104419495949262176.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...317
Loading property file /tmp/LTL6104419495949262176.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6636406248950098305.hoa
Detected timeout of ITS tools.
[2024-05-29 13:59:50] [INFO ] Flatten gal took : 63 ms
[2024-05-29 13:59:50] [INFO ] Flatten gal took : 65 ms
[2024-05-29 13:59:50] [INFO ] Time to serialize gal into /tmp/LTL12733184807234146726.gal : 12 ms
[2024-05-29 13:59:50] [INFO ] Time to serialize properties into /tmp/LTL15765741309925764319.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/LTL12733184807234146726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15765741309925764319.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...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(p3259==0)"))&&(F(("(p256==0)")&&(X("(p256==0)")))))))
Formula 0 simplified : F(G!"(p3259==0)" | G(!"(p256==0)" | X!"(p256==0)"))
Detected timeout of ITS tools.
[2024-05-29 14:00:06] [INFO ] Flatten gal took : 58 ms
[2024-05-29 14:00:06] [INFO ] Applying decomposition
[2024-05-29 14:00:06] [INFO ] Flatten gal took : 60 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/graph13689199575334659818.txt' '-o' '/tmp/graph13689199575334659818.bin' '-w' '/tmp/graph13689199575334659818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13689199575334659818.bin' '-l' '-1' '-v' '-w' '/tmp/graph13689199575334659818.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:00:06] [INFO ] Decomposing Gal with order
[2024-05-29 14:00:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:00:06] [INFO ] Removed a total of 502 redundant transitions.
[2024-05-29 14:00:06] [INFO ] Flatten gal took : 126 ms
[2024-05-29 14:00:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 14:00:06] [INFO ] Time to serialize gal into /tmp/LTL10661437459312226665.gal : 25 ms
[2024-05-29 14:00:06] [INFO ] Time to serialize properties into /tmp/LTL2964853891005132727.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/LTL10661437459312226665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2964853891005132727.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 : !((G((F("(i41.i2.i2.u1007.p3259==0)"))&&(F(("(i4.u84.p256==0)")&&(X("(i4.u84.p256==0)")))))))
Formula 0 simplified : F(G!"(i41.i2.i2.u1007.p3259==0)" | G(!"(i4.u84.p256==0)" | X!"(i4.u84.p256==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1845098403384301116
[2024-05-29 14:00:21] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1845098403384301116
Running compilation step : cd /tmp/ltsmin1845098403384301116;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1845098403384301116;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1845098403384301116;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 175581 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(p0)||X(F(p1))))'
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3352 transition count 3002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3352 transition count 3002
Applied a total of 10 rules in 488 ms. Remains 3352 /3357 variables (removed 5) and now considering 3002/3007 (removed 5) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2024-05-29 14:00:25] [INFO ] Computed 551 invariants in 19 ms
[2024-05-29 14:00:26] [INFO ] Implicit Places using invariants in 1318 ms returned []
[2024-05-29 14:00:26] [INFO ] Invariant cache hit.
[2024-05-29 14:00:30] [INFO ] Implicit Places using invariants and state equation in 3571 ms returned []
Implicit Place search using SMT with State Equation took 4891 ms to find 0 implicit places.
[2024-05-29 14:00:30] [INFO ] Invariant cache hit.
[2024-05-29 14:00:32] [INFO ] Dead Transitions using invariants and state equation in 2455 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3357 places, 3002/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7845 ms. Remains : 3352/3357 places, 3002/3007 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2148 1), p1:(EQ s2792 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][false, false]]
Product exploration explored 100000 steps with 266 reset in 427 ms.
Product exploration explored 100000 steps with 268 reset in 451 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 433 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=144 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-29 14:00:34] [INFO ] Invariant cache hit.
[2024-05-29 14:00:37] [INFO ] [Real]Absence check using 551 positive place invariants in 1260 ms returned sat
[2024-05-29 14:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:00:49] [INFO ] [Real]Absence check using state equation in 11447 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 3352 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3352/3352 places, 3002/3002 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3351 transition count 2303
Reduce places removed 698 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 699 rules applied. Total rules applied 1397 place count 2653 transition count 2302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1398 place count 2652 transition count 2302
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1398 place count 2652 transition count 1902
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 3 with 1694 rules applied. Total rules applied 3892 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3893 place count 1405 transition count 1054
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 3895 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4097 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4193 place count 1255 transition count 1053
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4195 place count 1253 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4196 place count 1252 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4196 place count 1252 transition count 1049
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4200 place count 1250 transition count 1049
Applied a total of 4200 rules in 459 ms. Remains 1250 /3352 variables (removed 2102) and now considering 1049/3002 (removed 1953) transitions.
// Phase 1: matrix 1049 rows 1250 cols
[2024-05-29 14:00:49] [INFO ] Computed 550 invariants in 4 ms
[2024-05-29 14:00:50] [INFO ] Implicit Places using invariants in 750 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 751 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1248/3352 places, 1049/3002 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1246 transition count 1047
Applied a total of 4 rules in 50 ms. Remains 1246 /1248 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1246 cols
[2024-05-29 14:00:50] [INFO ] Computed 548 invariants in 2 ms
[2024-05-29 14:00:51] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-05-29 14:00:51] [INFO ] Invariant cache hit.
[2024-05-29 14:00:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:00:52] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/3352 places, 1047/3002 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3582 ms. Remains : 1246/3352 places, 1047/3002 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1246 stabilizing places and 2/1047 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-29 14:00:53] [INFO ] Invariant cache hit.
[2024-05-29 14:00:54] [INFO ] [Real]Absence check using 548 positive place invariants in 417 ms returned sat
[2024-05-29 14:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 14:00:57] [INFO ] [Real]Absence check using state equation in 2701 ms returned sat
[2024-05-29 14:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 14:00:58] [INFO ] [Nat]Absence check using 548 positive place invariants in 341 ms returned sat
[2024-05-29 14:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 14:01:01] [INFO ] [Nat]Absence check using state equation in 2658 ms returned sat
[2024-05-29 14:01:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:01:01] [INFO ] [Nat]Added 5 Read/Feed constraints in 32 ms returned sat
[2024-05-29 14:01:01] [INFO ] Computed and/alt/rep : 1042/1663/1042 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-29 14:01:12] [INFO ] Added : 650 causal constraints over 130 iterations in 10987 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19328 reset in 917 ms.
Stack based approach found an accepted trace after 19 steps with 5 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-11 finished in 48420 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((F(p0)&&X(G(p1)))) U X(p2)))'
Support contains 3 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3352 transition count 3002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3352 transition count 3002
Applied a total of 10 rules in 462 ms. Remains 3352 /3357 variables (removed 5) and now considering 3002/3007 (removed 5) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2024-05-29 14:01:13] [INFO ] Computed 551 invariants in 16 ms
[2024-05-29 14:01:15] [INFO ] Implicit Places using invariants in 1355 ms returned []
[2024-05-29 14:01:15] [INFO ] Invariant cache hit.
[2024-05-29 14:01:19] [INFO ] Implicit Places using invariants and state equation in 3787 ms returned []
Implicit Place search using SMT with State Equation took 5144 ms to find 0 implicit places.
[2024-05-29 14:01:19] [INFO ] Invariant cache hit.
[2024-05-29 14:01:21] [INFO ] Dead Transitions using invariants and state equation in 2335 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3357 places, 3002/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7944 ms. Remains : 3352/3357 places, 3002/3007 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2304 1), p2:(NEQ s2235 1), p1:(NEQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1995 ms.
Product exploration explored 100000 steps with 50000 reset in 1993 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-13 finished in 12208 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&&(p1||G(p2))))))'
Support contains 3 out of 3357 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3356 transition count 2307
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2657 transition count 2307
Performed 397 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 397 Pre rules applied. Total rules applied 1398 place count 2657 transition count 1910
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 2192 place count 2260 transition count 1910
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2194 place count 2258 transition count 1908
Iterating global reduction 2 with 2 rules applied. Total rules applied 2196 place count 2258 transition count 1908
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2196 place count 2258 transition count 1906
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2200 place count 2256 transition count 1906
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3900 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3901 place count 1406 transition count 1055
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 3903 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4105 place count 1304 transition count 1054
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4199 place count 1257 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4201 place count 1255 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4202 place count 1254 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4202 place count 1254 transition count 1050
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4206 place count 1252 transition count 1050
Applied a total of 4206 rules in 539 ms. Remains 1252 /3357 variables (removed 2105) and now considering 1050/3007 (removed 1957) transitions.
// Phase 1: matrix 1050 rows 1252 cols
[2024-05-29 14:01:26] [INFO ] Computed 550 invariants in 6 ms
[2024-05-29 14:01:26] [INFO ] Implicit Places using invariants in 712 ms returned [1235, 1239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 713 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/3357 places, 1050/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1248 transition count 1048
Applied a total of 4 rules in 49 ms. Remains 1248 /1250 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1248 cols
[2024-05-29 14:01:26] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 14:01:27] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-29 14:01:27] [INFO ] Invariant cache hit.
[2024-05-29 14:01:28] [INFO ] State equation strengthened by 187 read => feed constraints.
[2024-05-29 14:01:31] [INFO ] Implicit Places using invariants and state equation in 3751 ms returned []
Implicit Place search using SMT with State Equation took 4476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1248/3357 places, 1048/3007 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5777 ms. Remains : 1248/3357 places, 1048/3007 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s779 0), p0:(EQ s1 1), p2:(EQ s430 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 730 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 44 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-14 finished in 6617 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(X(X((p0&&X(X(G(p1))))))))'
Support contains 3 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3352 transition count 3002
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3352 transition count 3002
Applied a total of 10 rules in 482 ms. Remains 3352 /3357 variables (removed 5) and now considering 3002/3007 (removed 5) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2024-05-29 14:01:32] [INFO ] Computed 551 invariants in 17 ms
[2024-05-29 14:01:33] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2024-05-29 14:01:33] [INFO ] Invariant cache hit.
[2024-05-29 14:01:37] [INFO ] Implicit Places using invariants and state equation in 3659 ms returned []
Implicit Place search using SMT with State Equation took 4898 ms to find 0 implicit places.
[2024-05-29 14:01:37] [INFO ] Invariant cache hit.
[2024-05-29 14:01:39] [INFO ] Dead Transitions using invariants and state equation in 2362 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3357 places, 3002/3007 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7744 ms. Remains : 3352/3357 places, 3002/3007 transitions.
Stuttering acceptance computed with spot in 628 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (EQ s2810 0) (EQ s1365 1)), p1:(EQ s1400 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-15 finished in 8409 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&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-050B-LTLFireability-09
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3357 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3357/3357 places, 3007/3007 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3356 transition count 2308
Reduce places removed 698 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 700 rules applied. Total rules applied 1398 place count 2658 transition count 2306
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1400 place count 2656 transition count 2306
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1400 place count 2656 transition count 1911
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 2190 place count 2261 transition count 1911
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 2193 place count 2258 transition count 1908
Iterating global reduction 3 with 3 rules applied. Total rules applied 2196 place count 2258 transition count 1908
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2196 place count 2258 transition count 1905
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2202 place count 2255 transition count 1905
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3900 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3901 place count 1406 transition count 1055
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 3903 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4105 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4201 place count 1256 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4203 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4204 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4204 place count 1253 transition count 1050
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4208 place count 1251 transition count 1050
Applied a total of 4208 rules in 543 ms. Remains 1251 /3357 variables (removed 2106) and now considering 1050/3007 (removed 1957) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2024-05-29 14:01:41] [INFO ] Computed 550 invariants in 4 ms
[2024-05-29 14:01:42] [INFO ] Implicit Places using invariants in 731 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 733 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1249/3357 places, 1050/3007 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1247 transition count 1048
Applied a total of 4 rules in 48 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2024-05-29 14:01:42] [INFO ] Computed 548 invariants in 2 ms
[2024-05-29 14:01:42] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-29 14:01:42] [INFO ] Invariant cache hit.
[2024-05-29 14:01:44] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1247/3357 places, 1048/3007 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3473 ms. Remains : 1247/3357 places, 1048/3007 transitions.
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s1050 0), p1:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33334 reset in 1106 ms.
Product exploration explored 100000 steps with 33340 reset in 1227 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 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:01:47] [INFO ] Invariant cache hit.
[2024-05-29 14:01:47] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:01:47] [INFO ] [Nat]Absence check using 548 positive place invariants in 91 ms returned sat
[2024-05-29 14:01:48] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:01:48] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-29 14:01:48] [INFO ] After 831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1246 transition count 1047
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 4 place count 1245 transition count 1046
Applied a total of 4 rules in 50 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) 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 200315 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200315 steps, saw 144499 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 14:01:51] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 14:01:51] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:01:51] [INFO ] [Nat]Absence check using 548 positive place invariants in 87 ms returned sat
[2024-05-29 14:01:52] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:01:52] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-29 14:01:52] [INFO ] After 829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 24 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2024-05-29 14:01:52] [INFO ] Invariant cache hit.
[2024-05-29 14:01:53] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-29 14:01:53] [INFO ] Invariant cache hit.
[2024-05-29 14:01:54] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 2217 ms to find 0 implicit places.
[2024-05-29 14:01:54] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 14:01:54] [INFO ] Invariant cache hit.
[2024-05-29 14:01:55] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2869 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 68 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 14:01:55] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 14:01:55] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:01:55] [INFO ] [Nat]Absence check using 548 positive place invariants in 92 ms returned sat
[2024-05-29 14:01:56] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:01:56] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2024-05-29 14:01:56] [INFO ] After 794ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 24 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2024-05-29 14:01:56] [INFO ] Computed 548 invariants in 4 ms
[2024-05-29 14:01:57] [INFO ] Implicit Places using invariants in 721 ms returned []
[2024-05-29 14:01:57] [INFO ] Invariant cache hit.
[2024-05-29 14:01:59] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2024-05-29 14:01:59] [INFO ] Invariant cache hit.
[2024-05-29 14:01:59] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2865 ms. Remains : 1247/1247 places, 1048/1048 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 : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:02:00] [INFO ] Invariant cache hit.
[2024-05-29 14:02:00] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:02:00] [INFO ] [Nat]Absence check using 548 positive place invariants in 90 ms returned sat
[2024-05-29 14:02:00] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:02:01] [INFO ] After 523ms 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 14:02:01] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1247 transition count 1047
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 1246 transition count 1047
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 51 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 194379 steps, run timeout after 3003 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194379 steps, saw 140113 distinct states, run finished after 3003 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 14:02:04] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 14:02:04] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:02:04] [INFO ] [Nat]Absence check using 548 positive place invariants in 79 ms returned sat
[2024-05-29 14:02:05] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:02:05] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-29 14:02:05] [INFO ] After 781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 29 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 29 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2024-05-29 14:02:05] [INFO ] Invariant cache hit.
[2024-05-29 14:02:06] [INFO ] Implicit Places using invariants in 762 ms returned []
[2024-05-29 14:02:06] [INFO ] Invariant cache hit.
[2024-05-29 14:02:07] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2024-05-29 14:02:07] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-29 14:02:07] [INFO ] Invariant cache hit.
[2024-05-29 14:02:08] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2843 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 59 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2024-05-29 14:02:08] [INFO ] Computed 548 invariants in 5 ms
[2024-05-29 14:02:08] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:02:08] [INFO ] [Nat]Absence check using 548 positive place invariants in 90 ms returned sat
[2024-05-29 14:02:09] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:02:09] [INFO ] After 535ms 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 14:02:09] [INFO ] After 835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33327 reset in 1073 ms.
Product exploration explored 100000 steps with 33307 reset in 1242 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 32 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-29 14:02:13] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2024-05-29 14:02:13] [INFO ] Computed 548 invariants in 3 ms
[2024-05-29 14:02:14] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 673 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Built C files in :
/tmp/ltsmin18349319012443803133
[2024-05-29 14:02:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18349319012443803133
Running compilation step : cd /tmp/ltsmin18349319012443803133;'/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 2105 ms.
Running link step : cd /tmp/ltsmin18349319012443803133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin18349319012443803133;'/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' '--hoa' '/tmp/stateBased18119350133694863956.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 28 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2024-05-29 14:02:29] [INFO ] Invariant cache hit.
[2024-05-29 14:02:30] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-29 14:02:30] [INFO ] Invariant cache hit.
[2024-05-29 14:02:31] [INFO ] Implicit Places using invariants and state equation in 1465 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2024-05-29 14:02:31] [INFO ] Invariant cache hit.
[2024-05-29 14:02:32] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2799 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Built C files in :
/tmp/ltsmin5316588916349704668
[2024-05-29 14:02:32] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5316588916349704668
Running compilation step : cd /tmp/ltsmin5316588916349704668;'/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 2402 ms.
Running link step : cd /tmp/ltsmin5316588916349704668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5316588916349704668;'/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' '--hoa' '/tmp/stateBased5957654210948925174.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 14:02:47] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:02:47] [INFO ] Flatten gal took : 31 ms
[2024-05-29 14:02:47] [INFO ] Time to serialize gal into /tmp/LTL14412880854238994610.gal : 8 ms
[2024-05-29 14:02:47] [INFO ] Time to serialize properties into /tmp/LTL1638275068670795675.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/LTL14412880854238994610.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5854291014363336017.hoa' '-atoms' '/tmp/LTL1638275068670795675.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/LTL1638275068670795675.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5854291014363336017.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2024-05-29 14:03:02] [INFO ] Flatten gal took : 23 ms
[2024-05-29 14:03:02] [INFO ] Flatten gal took : 22 ms
[2024-05-29 14:03:02] [INFO ] Time to serialize gal into /tmp/LTL94410060818607374.gal : 5 ms
[2024-05-29 14:03:02] [INFO ] Time to serialize properties into /tmp/LTL4246750531780828906.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/LTL94410060818607374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4246750531780828906.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...273
Read 1 LTL properties
Checking formula 0 : !((G((F("(p3259==0)"))&&(F(("(p256==0)")&&(X("(p256==0)")))))))
Formula 0 simplified : F(G!"(p3259==0)" | G(!"(p256==0)" | X!"(p256==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
Detected timeout of ITS tools.
[2024-05-29 14:03:17] [INFO ] Flatten gal took : 26 ms
[2024-05-29 14:03:17] [INFO ] Applying decomposition
[2024-05-29 14:03:17] [INFO ] Flatten gal took : 23 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/graph3077476307899482534.txt' '-o' '/tmp/graph3077476307899482534.bin' '-w' '/tmp/graph3077476307899482534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3077476307899482534.bin' '-l' '-1' '-v' '-w' '/tmp/graph3077476307899482534.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:03:17] [INFO ] Decomposing Gal with order
[2024-05-29 14:03:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:03:17] [INFO ] Removed a total of 305 redundant transitions.
[2024-05-29 14:03:17] [INFO ] Flatten gal took : 42 ms
[2024-05-29 14:03:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 9 ms.
[2024-05-29 14:03:18] [INFO ] Time to serialize gal into /tmp/LTL2848883855790346010.gal : 529 ms
[2024-05-29 14:03:18] [INFO ] Time to serialize properties into /tmp/LTL11165950610807721313.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/LTL2848883855790346010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11165950610807721313.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 : !((G((F("(i22.i0.i0.u338.p3259==0)"))&&(F(("(i1.u25.p256==0)")&&(X("(i1.u25.p256==0)")))))))
Formula 0 simplified : F(G!"(i22.i0.i0.u338.p3259==0)" | G(!"(i1.u25.p256==0)" | X!"(i1.u25.p256==0)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 3.73747e+82 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
399 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,4.12694,96760,1,0,149716,290,3985,304543,219,1562,190114
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 102067 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 14:03:22] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8046803126760726384
[2024-05-29 14:03:22] [INFO ] Too many transitions (3007) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:03:22] [INFO ] Applying decomposition
[2024-05-29 14:03:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8046803126760726384
Running compilation step : cd /tmp/ltsmin8046803126760726384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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 14:03:22] [INFO ] Flatten gal took : 60 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/graph12197587777492388968.txt' '-o' '/tmp/graph12197587777492388968.bin' '-w' '/tmp/graph12197587777492388968.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12197587777492388968.bin' '-l' '-1' '-v' '-w' '/tmp/graph12197587777492388968.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:03:23] [INFO ] Decomposing Gal with order
[2024-05-29 14:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:03:23] [INFO ] Removed a total of 495 redundant transitions.
[2024-05-29 14:03:23] [INFO ] Flatten gal took : 127 ms
[2024-05-29 14:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-29 14:03:23] [INFO ] Time to serialize gal into /tmp/LTLFireability6759440629008691269.gal : 20 ms
[2024-05-29 14:03:23] [INFO ] Time to serialize properties into /tmp/LTLFireability1160261876025612782.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/LTLFireability6759440629008691269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1160261876025612782.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 1 LTL properties
Checking formula 0 : !((G((F("(i41.u1006.p3259==0)"))&&(F(("(i2.u87.p256==0)")&&(X("(i2.u87.p256==0)")))))))
Formula 0 simplified : F(G!"(i41.u1006.p3259==0)" | G(!"(i2.u87.p256==0)" | X!"(i2.u87.p256==0)"))
Compilation finished in 9504 ms.
Running link step : cd /tmp/ltsmin8046803126760726384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8046803126760726384;'/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)&&X((LTLAPp1==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 14:26:39] [INFO ] Applying decomposition
[2024-05-29 14:26:40] [INFO ] Flatten gal took : 753 ms
[2024-05-29 14:26:41] [INFO ] Decomposing Gal with order
[2024-05-29 14:26:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:26:45] [INFO ] Removed a total of 147 redundant transitions.
[2024-05-29 14:26:45] [INFO ] Flatten gal took : 1012 ms
[2024-05-29 14:26:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 538 ms.
[2024-05-29 14:26:47] [INFO ] Time to serialize gal into /tmp/LTLFireability7784511900820375581.gal : 106 ms
[2024-05-29 14:26:47] [INFO ] Time to serialize properties into /tmp/LTLFireability8849293681865735233.ltl : 7 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/LTLFireability7784511900820375581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8849293681865735233.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 1 LTL properties
Checking formula 0 : !((G((F("(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u930.p3259==0)"))&&(F(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....432
Formula 0 simplified : F(G!"(i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u930.p3259==0)" | G(!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...422
Detected timeout of ITS tools.
[2024-05-29 14:49:57] [INFO ] Flatten gal took : 219 ms
[2024-05-29 14:49:57] [INFO ] Input system was already deterministic with 3007 transitions.
[2024-05-29 14:49:58] [INFO ] Transformed 3357 places.
[2024-05-29 14:49:58] [INFO ] Transformed 3007 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 14:50:00] [INFO ] Time to serialize gal into /tmp/LTLFireability14959685730328687634.gal : 22 ms
[2024-05-29 14:50:00] [INFO ] Time to serialize properties into /tmp/LTLFireability793668026258856489.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/LTLFireability14959685730328687634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability793668026258856489.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F("(p3259==0)"))&&(F(("(p256==0)")&&(X("(p256==0)")))))))
Formula 0 simplified : F(G!"(p3259==0)" | G(!"(p256==0)" | X!"(p256==0)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11684408 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15617392 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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPt-PT-050B, examination is LTLFireability"
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-171683789300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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