Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713600507.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679209444836

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 07:04:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 07:04:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:04:07] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-19 07:04:07] [INFO ] Transformed 3403 places.
[2023-03-19 07:04:07] [INFO ] Transformed 3153 transitions.
[2023-03-19 07:04:07] [INFO ] Found NUPN structural information;
[2023-03-19 07:04:07] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 343 places :
Symmetric choice reduction at 0 with 343 rule applications. Total rules 343 place count 3060 transition count 2810
Iterating global reduction 0 with 343 rules applied. Total rules applied 686 place count 3060 transition count 2810
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 687 place count 3059 transition count 2809
Iterating global reduction 0 with 1 rules applied. Total rules applied 688 place count 3059 transition count 2809
Applied a total of 688 rules in 1144 ms. Remains 3059 /3403 variables (removed 344) and now considering 2809/3153 (removed 344) transitions.
// Phase 1: matrix 2809 rows 3059 cols
[2023-03-19 07:04:08] [INFO ] Computed 551 place invariants in 58 ms
[2023-03-19 07:04:10] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2023-03-19 07:04:10] [INFO ] Invariant cache hit.
[2023-03-19 07:04:14] [INFO ] Implicit Places using invariants and state equation in 4662 ms returned []
Implicit Place search using SMT with State Equation took 6020 ms to find 0 implicit places.
[2023-03-19 07:04:14] [INFO ] Invariant cache hit.
[2023-03-19 07:04:17] [INFO ] Dead Transitions using invariants and state equation in 2867 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3059/3403 places, 2809/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10039 ms. Remains : 3059/3403 places, 2809/3153 transitions.
Support contains 28 out of 3059 places after structural reductions.
[2023-03-19 07:04:19] [INFO ] Flatten gal took : 186 ms
[2023-03-19 07:04:19] [INFO ] Flatten gal took : 118 ms
[2023-03-19 07:04:19] [INFO ] Input system was already deterministic with 2809 transitions.
Support contains 26 out of 3059 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 07:04:20] [INFO ] Invariant cache hit.
[2023-03-19 07:04:21] [INFO ] After 982ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 07:04:22] [INFO ] [Nat]Absence check using 551 positive place invariants in 273 ms returned sat
[2023-03-19 07:04:25] [INFO ] After 2626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 07:04:26] [INFO ] Deduced a trap composed of 19 places in 986 ms of which 21 ms to minimize.
[2023-03-19 07:04:28] [INFO ] Deduced a trap composed of 24 places in 1064 ms of which 3 ms to minimize.
[2023-03-19 07:04:29] [INFO ] Deduced a trap composed of 25 places in 845 ms of which 2 ms to minimize.
[2023-03-19 07:04:30] [INFO ] Deduced a trap composed of 24 places in 828 ms of which 2 ms to minimize.
[2023-03-19 07:04:31] [INFO ] Deduced a trap composed of 18 places in 1040 ms of which 15 ms to minimize.
[2023-03-19 07:04:32] [INFO ] Deduced a trap composed of 21 places in 765 ms of which 2 ms to minimize.
[2023-03-19 07:04:33] [INFO ] Deduced a trap composed of 24 places in 797 ms of which 2 ms to minimize.
[2023-03-19 07:04:34] [INFO ] Deduced a trap composed of 25 places in 807 ms of which 4 ms to minimize.
[2023-03-19 07:04:34] [INFO ] Deduced a trap composed of 21 places in 791 ms of which 2 ms to minimize.
[2023-03-19 07:04:35] [INFO ] Deduced a trap composed of 25 places in 644 ms of which 2 ms to minimize.
[2023-03-19 07:04:36] [INFO ] Deduced a trap composed of 32 places in 731 ms of which 1 ms to minimize.
[2023-03-19 07:04:37] [INFO ] Deduced a trap composed of 26 places in 686 ms of which 2 ms to minimize.
[2023-03-19 07:04:38] [INFO ] Deduced a trap composed of 25 places in 723 ms of which 3 ms to minimize.
[2023-03-19 07:04:39] [INFO ] Deduced a trap composed of 18 places in 751 ms of which 1 ms to minimize.
[2023-03-19 07:04:39] [INFO ] Deduced a trap composed of 10 places in 744 ms of which 2 ms to minimize.
[2023-03-19 07:04:40] [INFO ] Deduced a trap composed of 33 places in 674 ms of which 2 ms to minimize.
[2023-03-19 07:04:41] [INFO ] Deduced a trap composed of 34 places in 650 ms of which 2 ms to minimize.
[2023-03-19 07:04:42] [INFO ] Deduced a trap composed of 51 places in 623 ms of which 1 ms to minimize.
[2023-03-19 07:04:43] [INFO ] Deduced a trap composed of 40 places in 705 ms of which 2 ms to minimize.
[2023-03-19 07:04:44] [INFO ] Deduced a trap composed of 58 places in 750 ms of which 2 ms to minimize.
[2023-03-19 07:04:44] [INFO ] Deduced a trap composed of 35 places in 678 ms of which 1 ms to minimize.
[2023-03-19 07:04:45] [INFO ] Deduced a trap composed of 38 places in 804 ms of which 2 ms to minimize.
[2023-03-19 07:04:46] [INFO ] Deduced a trap composed of 35 places in 788 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:04:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:04:46] [INFO ] After 25375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 969 ms.
Support contains 16 out of 3059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3059 transition count 2464
Reduce places removed 345 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 348 rules applied. Total rules applied 693 place count 2714 transition count 2461
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 696 place count 2711 transition count 2461
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 696 place count 2711 transition count 2211
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1196 place count 2461 transition count 2211
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1200 place count 2457 transition count 2207
Iterating global reduction 3 with 4 rules applied. Total rules applied 1204 place count 2457 transition count 2207
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 3 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 2992 place count 1563 transition count 1313
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 434 times.
Drop transitions removed 434 transitions
Iterating global reduction 3 with 434 rules applied. Total rules applied 3426 place count 1563 transition count 1313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3427 place count 1562 transition count 1312
Applied a total of 3427 rules in 780 ms. Remains 1562 /3059 variables (removed 1497) and now considering 1312/2809 (removed 1497) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 781 ms. Remains : 1562/3059 places, 1312/2809 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1312 rows 1562 cols
[2023-03-19 07:04:49] [INFO ] Computed 551 place invariants in 106 ms
[2023-03-19 07:04:49] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 07:04:49] [INFO ] [Nat]Absence check using 524 positive place invariants in 141 ms returned sat
[2023-03-19 07:04:49] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-19 07:04:50] [INFO ] After 844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 07:04:50] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-19 07:04:51] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 1 ms to minimize.
[2023-03-19 07:04:51] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-19 07:04:51] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2023-03-19 07:04:51] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-19 07:04:52] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-19 07:04:52] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2023-03-19 07:04:52] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2023-03-19 07:04:52] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-19 07:04:52] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-19 07:04:52] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 0 ms to minimize.
[2023-03-19 07:04:53] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2023-03-19 07:04:53] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 1 ms to minimize.
[2023-03-19 07:04:53] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 12 ms to minimize.
[2023-03-19 07:04:53] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2997 ms
[2023-03-19 07:04:53] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-19 07:04:54] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-19 07:04:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2023-03-19 07:04:54] [INFO ] After 4482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-19 07:04:54] [INFO ] After 5228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 7 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1312/1312 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 1562 transition count 1311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1561 transition count 1311
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 1556 transition count 1306
Applied a total of 12 rules in 121 ms. Remains 1556 /1562 variables (removed 6) and now considering 1306/1312 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 1556/1562 places, 1306/1312 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) 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.
// Phase 1: matrix 1306 rows 1556 cols
[2023-03-19 07:04:54] [INFO ] Computed 551 place invariants in 22 ms
[2023-03-19 07:04:55] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 07:04:55] [INFO ] [Nat]Absence check using 527 positive place invariants in 241 ms returned sat
[2023-03-19 07:04:55] [INFO ] [Nat]Absence check using 527 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-19 07:04:56] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 07:04:56] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-19 07:04:57] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2023-03-19 07:04:57] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 0 ms to minimize.
[2023-03-19 07:04:57] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-19 07:04:58] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2023-03-19 07:04:58] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-19 07:04:58] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-19 07:04:58] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-19 07:04:59] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 0 ms to minimize.
[2023-03-19 07:04:59] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 19 ms to minimize.
[2023-03-19 07:04:59] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 39 ms to minimize.
[2023-03-19 07:04:59] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2023-03-19 07:05:00] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-19 07:05:00] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2023-03-19 07:05:00] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2023-03-19 07:05:00] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 10 ms to minimize.
[2023-03-19 07:05:01] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-19 07:05:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4459 ms
[2023-03-19 07:05:01] [INFO ] After 5410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-19 07:05:01] [INFO ] After 6189ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 1556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1556/1556 places, 1306/1306 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1554 transition count 1304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1553 transition count 1303
Applied a total of 5 rules in 172 ms. Remains 1553 /1556 variables (removed 3) and now considering 1303/1306 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1553/1556 places, 1303/1306 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) 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
Finished probabilistic random walk after 36674 steps, run visited all 1 properties in 561 ms. (steps per millisecond=65 )
Probabilistic random walk after 36674 steps, saw 34048 distinct states, run finished after 561 ms. (steps per millisecond=65 ) properties seen :1
Computed a total of 602 stabilizing places and 602 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&(F(G(p1))||G(p2))))))'
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 565 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:05:03] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-19 07:05:04] [INFO ] Implicit Places using invariants in 1242 ms returned []
[2023-03-19 07:05:04] [INFO ] Invariant cache hit.
[2023-03-19 07:05:05] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 2460 ms to find 0 implicit places.
[2023-03-19 07:05:05] [INFO ] Invariant cache hit.
[2023-03-19 07:05:08] [INFO ] Dead Transitions using invariants and state equation in 2845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5884 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 649 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s1673 0) (EQ s2031 1)), p0:(OR (EQ s1673 0) (EQ s2031 1) (EQ s2003 0) (EQ s882 1)), p1:(AND (EQ s2031 0) (EQ s1673 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7563 steps with 0 reset in 136 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-02 finished in 6832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U X(p1)))&&X(G(p2)))))'
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3054 transition count 2804
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3054 transition count 2804
Applied a total of 10 rules in 445 ms. Remains 3054 /3059 variables (removed 5) and now considering 2804/2809 (removed 5) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-19 07:05:10] [INFO ] Computed 551 place invariants in 13 ms
[2023-03-19 07:05:11] [INFO ] Implicit Places using invariants in 1540 ms returned []
[2023-03-19 07:05:11] [INFO ] Invariant cache hit.
[2023-03-19 07:05:15] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 5273 ms to find 0 implicit places.
[2023-03-19 07:05:15] [INFO ] Invariant cache hit.
[2023-03-19 07:05:17] [INFO ] Dead Transitions using invariants and state equation in 2541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3059 places, 2804/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8261 ms. Remains : 3054/3059 places, 2804/2809 transitions.
Stuttering acceptance computed with spot in 508 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s3030 0) (EQ s710 1)), p1:(OR (EQ s1305 0) (EQ s2791 1)), p2:(AND (EQ s710 0) (EQ s3030 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 2 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-04 finished in 8829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 523 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-19 07:05:19] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-19 07:05:20] [INFO ] Implicit Places using invariants in 1544 ms returned []
[2023-03-19 07:05:20] [INFO ] Invariant cache hit.
[2023-03-19 07:05:24] [INFO ] Implicit Places using invariants and state equation in 3686 ms returned []
Implicit Place search using SMT with State Equation took 5235 ms to find 0 implicit places.
[2023-03-19 07:05:24] [INFO ] Invariant cache hit.
[2023-03-19 07:05:26] [INFO ] Dead Transitions using invariants and state equation in 2048 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7809 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1721 0) (EQ s1958 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 35 reset in 1029 ms.
Product exploration explored 100000 steps with 36 reset in 1060 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2916 steps, including 0 resets, run visited all 1 properties in 37 ms. (steps per millisecond=78 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 07:05:29] [INFO ] Invariant cache hit.
[2023-03-19 07:05:33] [INFO ] [Real]Absence check using 551 positive place invariants in 1312 ms returned sat
[2023-03-19 07:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:05:44] [INFO ] [Real]Absence check using state equation in 11315 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 3052 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Applied a total of 0 rules in 294 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
[2023-03-19 07:05:44] [INFO ] Invariant cache hit.
[2023-03-19 07:05:46] [INFO ] Implicit Places using invariants in 1481 ms returned []
[2023-03-19 07:05:46] [INFO ] Invariant cache hit.
[2023-03-19 07:05:50] [INFO ] Implicit Places using invariants and state equation in 3794 ms returned []
Implicit Place search using SMT with State Equation took 5286 ms to find 0 implicit places.
[2023-03-19 07:05:50] [INFO ] Invariant cache hit.
[2023-03-19 07:05:52] [INFO ] Dead Transitions using invariants and state equation in 2380 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7962 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2612 steps, including 0 resets, run visited all 1 properties in 48 ms. (steps per millisecond=54 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 07:05:53] [INFO ] Invariant cache hit.
[2023-03-19 07:05:56] [INFO ] [Real]Absence check using 551 positive place invariants in 1164 ms returned sat
[2023-03-19 07:05:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:06:08] [INFO ] [Real]Absence check using state equation in 11622 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 36 reset in 888 ms.
Product exploration explored 100000 steps with 36 reset in 1059 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3052 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3052 transition count 2802
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 101 Pre rules applied. Total rules applied 351 place count 3052 transition count 2803
Deduced a syphon composed of 452 places in 6 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 452 place count 3052 transition count 2803
Performed 1048 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1500 places in 4 ms
Iterating global reduction 1 with 1048 rules applied. Total rules applied 1500 place count 3052 transition count 2803
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 1 with 352 rule applications. Total rules 1852 place count 2700 transition count 2451
Deduced a syphon composed of 1148 places in 3 ms
Iterating global reduction 1 with 352 rules applied. Total rules applied 2204 place count 2700 transition count 2451
Deduced a syphon composed of 1148 places in 2 ms
Applied a total of 2204 rules in 1298 ms. Remains 2700 /3052 variables (removed 352) and now considering 2451/2802 (removed 351) transitions.
[2023-03-19 07:06:12] [INFO ] Redundant transitions in 218 ms returned []
// Phase 1: matrix 2451 rows 2700 cols
[2023-03-19 07:06:12] [INFO ] Computed 551 place invariants in 61 ms
[2023-03-19 07:06:14] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2700/3052 places, 2451/2802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3470 ms. Remains : 2700/3052 places, 2451/2802 transitions.
Built C files in :
/tmp/ltsmin16677489666052757702
[2023-03-19 07:06:14] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16677489666052757702
Running compilation step : cd /tmp/ltsmin16677489666052757702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16677489666052757702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16677489666052757702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 3052 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3052/3052 places, 2802/2802 transitions.
Applied a total of 0 rules in 222 ms. Remains 3052 /3052 variables (removed 0) and now considering 2802/2802 (removed 0) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-19 07:06:17] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-19 07:06:19] [INFO ] Implicit Places using invariants in 1652 ms returned []
[2023-03-19 07:06:19] [INFO ] Invariant cache hit.
[2023-03-19 07:06:23] [INFO ] Implicit Places using invariants and state equation in 3643 ms returned []
Implicit Place search using SMT with State Equation took 5307 ms to find 0 implicit places.
[2023-03-19 07:06:23] [INFO ] Invariant cache hit.
[2023-03-19 07:06:26] [INFO ] Dead Transitions using invariants and state equation in 3030 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8568 ms. Remains : 3052/3052 places, 2802/2802 transitions.
Built C files in :
/tmp/ltsmin4761314367798339745
[2023-03-19 07:06:26] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4761314367798339745
Running compilation step : cd /tmp/ltsmin4761314367798339745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4761314367798339745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin4761314367798339745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-19 07:06:30] [INFO ] Flatten gal took : 98 ms
[2023-03-19 07:06:30] [INFO ] Flatten gal took : 97 ms
[2023-03-19 07:06:30] [INFO ] Time to serialize gal into /tmp/LTL57834495661015903.gal : 28 ms
[2023-03-19 07:06:30] [INFO ] Time to serialize properties into /tmp/LTL4638054878388788314.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL57834495661015903.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6512666105178507182.hoa' '-atoms' '/tmp/LTL4638054878388788314.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL4638054878388788314.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6512666105178507182.hoa
Detected timeout of ITS tools.
[2023-03-19 07:06:45] [INFO ] Flatten gal took : 75 ms
[2023-03-19 07:06:45] [INFO ] Flatten gal took : 82 ms
[2023-03-19 07:06:45] [INFO ] Time to serialize gal into /tmp/LTL15801624464471914829.gal : 14 ms
[2023-03-19 07:06:45] [INFO ] Time to serialize properties into /tmp/LTL3900061553132342452.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15801624464471914829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3900061553132342452.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p1914==0)&&(p2178==1))")))))
Formula 0 simplified : XXG!"((p1914==0)&&(p2178==1))"
Detected timeout of ITS tools.
[2023-03-19 07:07:00] [INFO ] Flatten gal took : 72 ms
[2023-03-19 07:07:00] [INFO ] Applying decomposition
[2023-03-19 07:07:00] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8470338307262173626.txt' '-o' '/tmp/graph8470338307262173626.bin' '-w' '/tmp/graph8470338307262173626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8470338307262173626.bin' '-l' '-1' '-v' '-w' '/tmp/graph8470338307262173626.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:07:01] [INFO ] Decomposing Gal with order
[2023-03-19 07:07:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:07:01] [INFO ] Removed a total of 450 redundant transitions.
[2023-03-19 07:07:01] [INFO ] Flatten gal took : 238 ms
[2023-03-19 07:07:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2023-03-19 07:07:02] [INFO ] Time to serialize gal into /tmp/LTL14845457455875603399.gal : 52 ms
[2023-03-19 07:07:02] [INFO ] Time to serialize properties into /tmp/LTL9593340840291211420.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14845457455875603399.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9593340840291211420.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i27.i1.i1.u680.p1914==0)&&(i30.i3.i1.u773.p2178==1))")))))
Formula 0 simplified : XXG!"((i27.i1.i1.u680.p1914==0)&&(i30.i3.i1.u773.p2178==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6289231951608797897
[2023-03-19 07:07:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6289231951608797897
Running compilation step : cd /tmp/ltsmin6289231951608797897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6289231951608797897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin6289231951608797897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 ShieldPPPs-PT-050B-LTLCardinality-05 finished in 121766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 549 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:07:20] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-19 07:07:22] [INFO ] Implicit Places using invariants in 1434 ms returned []
[2023-03-19 07:07:22] [INFO ] Invariant cache hit.
[2023-03-19 07:07:26] [INFO ] Implicit Places using invariants and state equation in 3928 ms returned []
Implicit Place search using SMT with State Equation took 5369 ms to find 0 implicit places.
[2023-03-19 07:07:26] [INFO ] Invariant cache hit.
[2023-03-19 07:07:28] [INFO ] Dead Transitions using invariants and state equation in 2796 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8715 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s2321 0) (EQ s956 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 ShieldPPPs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-09 finished in 8925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!p0)||F(p1)) U (G((X(!p0)||F(p1)))||(p2&&(X(!p0)||F(p1)))))))'
Support contains 5 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3052 transition count 2802
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3052 transition count 2802
Applied a total of 14 rules in 477 ms. Remains 3052 /3059 variables (removed 7) and now considering 2802/2809 (removed 7) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-19 07:07:29] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-19 07:07:31] [INFO ] Implicit Places using invariants in 1492 ms returned []
[2023-03-19 07:07:31] [INFO ] Invariant cache hit.
[2023-03-19 07:07:35] [INFO ] Implicit Places using invariants and state equation in 3827 ms returned []
Implicit Place search using SMT with State Equation took 5359 ms to find 0 implicit places.
[2023-03-19 07:07:35] [INFO ] Invariant cache hit.
[2023-03-19 07:07:37] [INFO ] Dead Transitions using invariants and state equation in 2349 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3059 places, 2802/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8190 ms. Remains : 3052/3059 places, 2802/2809 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s431 0) (EQ s267 1)), p1:(OR (NOT (OR (EQ s431 0) (EQ s267 1))) (NEQ s1567 1)), p0:(OR (EQ s725 0) (EQ s2307 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1722 ms.
Product exploration explored 100000 steps with 50000 reset in 1617 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-10 finished in 11985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(F(p2)||p1)))))'
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3053 transition count 2803
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3053 transition count 2803
Applied a total of 12 rules in 498 ms. Remains 3053 /3059 variables (removed 6) and now considering 2803/2809 (removed 6) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:07:41] [INFO ] Computed 551 place invariants in 24 ms
[2023-03-19 07:07:43] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2023-03-19 07:07:43] [INFO ] Invariant cache hit.
[2023-03-19 07:07:47] [INFO ] Implicit Places using invariants and state equation in 4006 ms returned []
Implicit Place search using SMT with State Equation took 5502 ms to find 0 implicit places.
[2023-03-19 07:07:47] [INFO ] Invariant cache hit.
[2023-03-19 07:07:49] [INFO ] Dead Transitions using invariants and state equation in 2550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3059 places, 2803/2809 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8553 ms. Remains : 3053/3059 places, 2803/2809 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1166 0) (EQ s1410 1)), p1:(OR (EQ s1410 0) (EQ s1166 1)), p2:(OR (EQ s2536 0) (EQ s2999 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 1060 ms.
Product exploration explored 100000 steps with 23 reset in 1269 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 418 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 07:07:53] [INFO ] Invariant cache hit.
[2023-03-19 07:07:54] [INFO ] [Real]Absence check using 551 positive place invariants in 308 ms returned sat
[2023-03-19 07:07:55] [INFO ] After 2437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 07:07:56] [INFO ] [Nat]Absence check using 551 positive place invariants in 272 ms returned sat
[2023-03-19 07:07:58] [INFO ] After 1789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 07:07:59] [INFO ] Deduced a trap composed of 22 places in 1004 ms of which 5 ms to minimize.
[2023-03-19 07:08:00] [INFO ] Deduced a trap composed of 15 places in 827 ms of which 2 ms to minimize.
[2023-03-19 07:08:01] [INFO ] Deduced a trap composed of 26 places in 934 ms of which 2 ms to minimize.
[2023-03-19 07:08:02] [INFO ] Deduced a trap composed of 18 places in 788 ms of which 4 ms to minimize.
[2023-03-19 07:08:03] [INFO ] Deduced a trap composed of 16 places in 940 ms of which 2 ms to minimize.
[2023-03-19 07:08:04] [INFO ] Deduced a trap composed of 20 places in 846 ms of which 2 ms to minimize.
[2023-03-19 07:08:05] [INFO ] Deduced a trap composed of 32 places in 811 ms of which 1 ms to minimize.
[2023-03-19 07:08:06] [INFO ] Deduced a trap composed of 10 places in 800 ms of which 1 ms to minimize.
[2023-03-19 07:08:07] [INFO ] Deduced a trap composed of 26 places in 829 ms of which 2 ms to minimize.
[2023-03-19 07:08:08] [INFO ] Deduced a trap composed of 17 places in 876 ms of which 10 ms to minimize.
[2023-03-19 07:08:09] [INFO ] Deduced a trap composed of 29 places in 848 ms of which 1 ms to minimize.
[2023-03-19 07:08:10] [INFO ] Deduced a trap composed of 31 places in 866 ms of which 2 ms to minimize.
[2023-03-19 07:08:11] [INFO ] Deduced a trap composed of 25 places in 888 ms of which 1 ms to minimize.
[2023-03-19 07:08:12] [INFO ] Deduced a trap composed of 35 places in 815 ms of which 2 ms to minimize.
[2023-03-19 07:08:13] [INFO ] Deduced a trap composed of 27 places in 1216 ms of which 4 ms to minimize.
[2023-03-19 07:08:14] [INFO ] Deduced a trap composed of 33 places in 746 ms of which 2 ms to minimize.
[2023-03-19 07:08:15] [INFO ] Deduced a trap composed of 34 places in 815 ms of which 2 ms to minimize.
[2023-03-19 07:08:16] [INFO ] Deduced a trap composed of 36 places in 998 ms of which 4 ms to minimize.
[2023-03-19 07:08:17] [INFO ] Deduced a trap composed of 29 places in 735 ms of which 1 ms to minimize.
[2023-03-19 07:08:18] [INFO ] Deduced a trap composed of 36 places in 856 ms of which 2 ms to minimize.
[2023-03-19 07:08:19] [INFO ] Deduced a trap composed of 34 places in 842 ms of which 1 ms to minimize.
[2023-03-19 07:08:20] [INFO ] Deduced a trap composed of 44 places in 740 ms of which 1 ms to minimize.
[2023-03-19 07:08:21] [INFO ] Deduced a trap composed of 23 places in 833 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:08:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:08:21] [INFO ] After 25622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 260 ms.
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2452
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2702 transition count 2451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 2998 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 445 times.
Drop transitions removed 445 transitions
Iterating global reduction 3 with 445 rules applied. Total rules applied 3443 place count 1554 transition count 1304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3444 place count 1553 transition count 1303
Applied a total of 3444 rules in 622 ms. Remains 1553 /3053 variables (removed 1500) and now considering 1303/2803 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 ms. Remains : 1553/3053 places, 1303/2803 transitions.
Finished random walk after 2885 steps, including 0 resets, run visited all 2 properties in 59 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 679 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-19 07:08:23] [INFO ] Invariant cache hit.
[2023-03-19 07:08:27] [INFO ] [Real]Absence check using 551 positive place invariants in 1052 ms returned sat
[2023-03-19 07:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:08:38] [INFO ] [Real]Absence check using state equation in 11424 ms returned unknown
Could not prove EG (NOT p0)
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 252 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
[2023-03-19 07:08:38] [INFO ] Invariant cache hit.
[2023-03-19 07:08:40] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-19 07:08:40] [INFO ] Invariant cache hit.
[2023-03-19 07:08:44] [INFO ] Implicit Places using invariants and state equation in 3884 ms returned []
Implicit Place search using SMT with State Equation took 5331 ms to find 0 implicit places.
[2023-03-19 07:08:44] [INFO ] Invariant cache hit.
[2023-03-19 07:08:46] [INFO ] Dead Transitions using invariants and state equation in 2726 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8324 ms. Remains : 3053/3053 places, 2803/2803 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 479 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 07:08:48] [INFO ] Invariant cache hit.
[2023-03-19 07:08:48] [INFO ] [Real]Absence check using 551 positive place invariants in 214 ms returned sat
[2023-03-19 07:08:50] [INFO ] After 2525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 07:08:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 253 ms returned sat
[2023-03-19 07:08:53] [INFO ] After 1912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 07:08:54] [INFO ] Deduced a trap composed of 22 places in 888 ms of which 2 ms to minimize.
[2023-03-19 07:08:55] [INFO ] Deduced a trap composed of 15 places in 1035 ms of which 2 ms to minimize.
[2023-03-19 07:08:56] [INFO ] Deduced a trap composed of 26 places in 974 ms of which 2 ms to minimize.
[2023-03-19 07:08:58] [INFO ] Deduced a trap composed of 18 places in 982 ms of which 2 ms to minimize.
[2023-03-19 07:08:58] [INFO ] Deduced a trap composed of 16 places in 763 ms of which 2 ms to minimize.
[2023-03-19 07:08:59] [INFO ] Deduced a trap composed of 20 places in 811 ms of which 2 ms to minimize.
[2023-03-19 07:09:00] [INFO ] Deduced a trap composed of 32 places in 827 ms of which 2 ms to minimize.
[2023-03-19 07:09:01] [INFO ] Deduced a trap composed of 10 places in 812 ms of which 18 ms to minimize.
[2023-03-19 07:09:02] [INFO ] Deduced a trap composed of 26 places in 749 ms of which 2 ms to minimize.
[2023-03-19 07:09:03] [INFO ] Deduced a trap composed of 17 places in 1066 ms of which 1 ms to minimize.
[2023-03-19 07:09:04] [INFO ] Deduced a trap composed of 29 places in 871 ms of which 4 ms to minimize.
[2023-03-19 07:09:05] [INFO ] Deduced a trap composed of 31 places in 830 ms of which 3 ms to minimize.
[2023-03-19 07:09:07] [INFO ] Deduced a trap composed of 25 places in 1121 ms of which 2 ms to minimize.
[2023-03-19 07:09:07] [INFO ] Deduced a trap composed of 35 places in 719 ms of which 3 ms to minimize.
[2023-03-19 07:09:08] [INFO ] Deduced a trap composed of 27 places in 773 ms of which 2 ms to minimize.
[2023-03-19 07:09:09] [INFO ] Deduced a trap composed of 33 places in 752 ms of which 2 ms to minimize.
[2023-03-19 07:09:10] [INFO ] Deduced a trap composed of 34 places in 866 ms of which 2 ms to minimize.
[2023-03-19 07:09:11] [INFO ] Deduced a trap composed of 36 places in 750 ms of which 1 ms to minimize.
[2023-03-19 07:09:12] [INFO ] Deduced a trap composed of 29 places in 675 ms of which 2 ms to minimize.
[2023-03-19 07:09:13] [INFO ] Deduced a trap composed of 36 places in 793 ms of which 2 ms to minimize.
[2023-03-19 07:09:13] [INFO ] Deduced a trap composed of 34 places in 761 ms of which 2 ms to minimize.
[2023-03-19 07:09:14] [INFO ] Deduced a trap composed of 44 places in 804 ms of which 2 ms to minimize.
[2023-03-19 07:09:15] [INFO ] Deduced a trap composed of 23 places in 810 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:09:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:09:15] [INFO ] After 25109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 153 ms.
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2452
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2702 transition count 2451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2701 transition count 2451
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2701 transition count 2201
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2451 transition count 2201
Performed 897 Post agglomeration using F-continuation condition.Transition count delta: 897
Deduced a syphon composed of 897 places in 2 ms
Reduce places removed 897 places and 0 transitions.
Iterating global reduction 3 with 1794 rules applied. Total rules applied 2998 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 445 times.
Drop transitions removed 445 transitions
Iterating global reduction 3 with 445 rules applied. Total rules applied 3443 place count 1554 transition count 1304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3444 place count 1553 transition count 1303
Applied a total of 3444 rules in 496 ms. Remains 1553 /3053 variables (removed 1500) and now considering 1303/2803 (removed 1500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 1553/3053 places, 1303/2803 transitions.
Finished random walk after 2688 steps, including 0 resets, run visited all 2 properties in 70 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 448 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-19 07:09:17] [INFO ] Invariant cache hit.
[2023-03-19 07:09:20] [INFO ] [Real]Absence check using 551 positive place invariants in 1038 ms returned sat
[2023-03-19 07:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:09:32] [INFO ] [Real]Absence check using state equation in 11721 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 23 reset in 1026 ms.
Product exploration explored 100000 steps with 23 reset in 1145 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Performed 351 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3053 transition count 2803
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 102 Pre rules applied. Total rules applied 351 place count 3053 transition count 2805
Deduced a syphon composed of 453 places in 7 ms
Iterating global reduction 1 with 102 rules applied. Total rules applied 453 place count 3053 transition count 2805
Performed 1046 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1499 places in 3 ms
Iterating global reduction 1 with 1046 rules applied. Total rules applied 1499 place count 3053 transition count 2805
Renaming transitions due to excessive name length > 1024 char.
Discarding 351 places :
Symmetric choice reduction at 1 with 351 rule applications. Total rules 1850 place count 2702 transition count 2454
Deduced a syphon composed of 1148 places in 3 ms
Iterating global reduction 1 with 351 rules applied. Total rules applied 2201 place count 2702 transition count 2454
Deduced a syphon composed of 1148 places in 3 ms
Applied a total of 2201 rules in 1059 ms. Remains 2702 /3053 variables (removed 351) and now considering 2454/2803 (removed 349) transitions.
[2023-03-19 07:09:36] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 2454 rows 2702 cols
[2023-03-19 07:09:36] [INFO ] Computed 551 place invariants in 30 ms
[2023-03-19 07:09:38] [INFO ] Dead Transitions using invariants and state equation in 2205 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2702/3053 places, 2454/2803 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3346 ms. Remains : 2702/3053 places, 2454/2803 transitions.
Built C files in :
/tmp/ltsmin16524617191309376687
[2023-03-19 07:09:38] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16524617191309376687
Running compilation step : cd /tmp/ltsmin16524617191309376687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16524617191309376687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin16524617191309376687;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 4 out of 3053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3053/3053 places, 2803/2803 transitions.
Applied a total of 0 rules in 297 ms. Remains 3053 /3053 variables (removed 0) and now considering 2803/2803 (removed 0) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-19 07:09:42] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-19 07:09:43] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2023-03-19 07:09:43] [INFO ] Invariant cache hit.
[2023-03-19 07:09:47] [INFO ] Implicit Places using invariants and state equation in 3800 ms returned []
Implicit Place search using SMT with State Equation took 5127 ms to find 0 implicit places.
[2023-03-19 07:09:47] [INFO ] Invariant cache hit.
[2023-03-19 07:09:49] [INFO ] Dead Transitions using invariants and state equation in 2457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7897 ms. Remains : 3053/3053 places, 2803/2803 transitions.
Built C files in :
/tmp/ltsmin14377023947480176858
[2023-03-19 07:09:49] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14377023947480176858
Running compilation step : cd /tmp/ltsmin14377023947480176858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14377023947480176858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin14377023947480176858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-19 07:09:53] [INFO ] Flatten gal took : 140 ms
[2023-03-19 07:09:53] [INFO ] Flatten gal took : 124 ms
[2023-03-19 07:09:53] [INFO ] Time to serialize gal into /tmp/LTL10533976025970194611.gal : 16 ms
[2023-03-19 07:09:53] [INFO ] Time to serialize properties into /tmp/LTL13397866275278915441.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10533976025970194611.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4683841125086122128.hoa' '-atoms' '/tmp/LTL13397866275278915441.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13397866275278915441.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4683841125086122128.hoa
Detected timeout of ITS tools.
[2023-03-19 07:10:08] [INFO ] Flatten gal took : 65 ms
[2023-03-19 07:10:08] [INFO ] Flatten gal took : 71 ms
[2023-03-19 07:10:08] [INFO ] Time to serialize gal into /tmp/LTL289637554856266884.gal : 12 ms
[2023-03-19 07:10:08] [INFO ] Time to serialize properties into /tmp/LTL5828487311921628509.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL289637554856266884.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5828487311921628509.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G((F("((p1292==0)&&(p1563==1))"))&&(("((p1563==0)||(p1292==1))")||(F("((p2822==0)||(p3341==1))")))))))
Formula 0 simplified : XF(G!"((p1292==0)&&(p1563==1))" | (!"((p1563==0)||(p1292==1))" & G!"((p2822==0)||(p3341==1))"))
Detected timeout of ITS tools.
[2023-03-19 07:10:23] [INFO ] Flatten gal took : 59 ms
[2023-03-19 07:10:23] [INFO ] Applying decomposition
[2023-03-19 07:10:23] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2395815366739254382.txt' '-o' '/tmp/graph2395815366739254382.bin' '-w' '/tmp/graph2395815366739254382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2395815366739254382.bin' '-l' '-1' '-v' '-w' '/tmp/graph2395815366739254382.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:10:23] [INFO ] Decomposing Gal with order
[2023-03-19 07:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:10:24] [INFO ] Removed a total of 450 redundant transitions.
[2023-03-19 07:10:24] [INFO ] Flatten gal took : 114 ms
[2023-03-19 07:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-19 07:10:24] [INFO ] Time to serialize gal into /tmp/LTL3985483792467469446.gal : 36 ms
[2023-03-19 07:10:24] [INFO ] Time to serialize properties into /tmp/LTL5177119112405623679.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3985483792467469446.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5177119112405623679.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((F("((i18.u464.p1292==0)&&(i22.i2.i1.u558.p1563==1))"))&&(("((i22.i2.i1.u558.p1563==0)||(i18.u464.p1292==1))")||(F("((i39.u1003...202
Formula 0 simplified : XF(G!"((i18.u464.p1292==0)&&(i22.i2.i1.u558.p1563==1))" | (!"((i22.i2.i1.u558.p1563==0)||(i18.u464.p1292==1))" & G!"((i39.u1003.p282...192
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1195669830603895467
[2023-03-19 07:10:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1195669830603895467
Running compilation step : cd /tmp/ltsmin1195669830603895467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1195669830603895467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin1195669830603895467;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 ShieldPPPs-PT-050B-LTLCardinality-11 finished in 181378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U G(p2))))))'
Support contains 5 out of 3059 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3058 transition count 2458
Reduce places removed 350 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 352 rules applied. Total rules applied 702 place count 2708 transition count 2456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 704 place count 2706 transition count 2207
Deduced a syphon composed of 249 places in 7 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 1202 place count 2457 transition count 2207
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1208 place count 2451 transition count 2201
Iterating global reduction 3 with 6 rules applied. Total rules applied 1214 place count 2451 transition count 2201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1214 place count 2451 transition count 2199
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 3006 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3008 place count 1553 transition count 1303
Applied a total of 3008 rules in 650 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 07:10:43] [INFO ] Computed 551 place invariants in 2 ms
[2023-03-19 07:10:44] [INFO ] Implicit Places using invariants in 1059 ms returned []
[2023-03-19 07:10:44] [INFO ] Invariant cache hit.
[2023-03-19 07:10:46] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 3008 ms to find 0 implicit places.
[2023-03-19 07:10:46] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 07:10:46] [INFO ] Invariant cache hit.
[2023-03-19 07:10:47] [INFO ] Dead Transitions using invariants and state equation in 753 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/3059 places, 1303/2809 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4442 ms. Remains : 1553/3059 places, 1303/2809 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p2 p0 p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s512 0) (EQ s672 1)), p0:(EQ s442 1), p1:(OR (EQ s605 0) (EQ s1141 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 29 reset in 1105 ms.
Product exploration explored 100000 steps with 29 reset in 1267 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 p2 (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1731 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 07:10:51] [INFO ] Invariant cache hit.
[2023-03-19 07:10:52] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 07:10:52] [INFO ] [Nat]Absence check using 551 positive place invariants in 108 ms returned sat
[2023-03-19 07:10:53] [INFO ] After 923ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 07:10:53] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-19 07:10:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-19 07:10:53] [INFO ] After 1223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-19 07:10:53] [INFO ] After 1679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 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 1553 transition count 1303
Applied a total of 296 rules in 117 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Finished random walk after 3024 steps, including 0 resets, run visited all 1 properties in 73 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p1)), (X (OR (AND (NOT p2) (NOT p1)) (NOT p0))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p0 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (OR (AND p2 (NOT p0)) (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (OR (AND (NOT p2) (NOT p1)) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND p0 p1 p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 23 factoid took 1823 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
[2023-03-19 07:10:56] [INFO ] Invariant cache hit.
[2023-03-19 07:10:57] [INFO ] [Real]Absence check using 551 positive place invariants in 466 ms returned sat
[2023-03-19 07:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:11:03] [INFO ] [Real]Absence check using state equation in 5617 ms returned sat
[2023-03-19 07:11:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 07:11:05] [INFO ] [Nat]Absence check using 551 positive place invariants in 393 ms returned sat
[2023-03-19 07:11:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 07:11:10] [INFO ] [Nat]Absence check using state equation in 5190 ms returned sat
[2023-03-19 07:11:10] [INFO ] Computed and/alt/rep : 1301/2496/1301 causal constraints (skipped 0 transitions) in 127 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:11:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 66 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 07:11:18] [INFO ] Invariant cache hit.
[2023-03-19 07:11:19] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-19 07:11:19] [INFO ] Invariant cache hit.
[2023-03-19 07:11:21] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2867 ms to find 0 implicit places.
[2023-03-19 07:11:21] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 07:11:21] [INFO ] Invariant cache hit.
[2023-03-19 07:11:22] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3908 ms. Remains : 1553/1553 places, 1303/1303 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 (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1061 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 07:11:24] [INFO ] Invariant cache hit.
[2023-03-19 07:11:24] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 07:11:24] [INFO ] [Nat]Absence check using 551 positive place invariants in 89 ms returned sat
[2023-03-19 07:11:25] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 07:11:25] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-19 07:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-19 07:11:25] [INFO ] After 988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-19 07:11:25] [INFO ] After 1368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 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 1553 transition count 1303
Applied a total of 296 rules in 182 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Finished probabilistic random walk after 34985 steps, run visited all 1 properties in 399 ms. (steps per millisecond=87 )
Probabilistic random walk after 34985 steps, saw 34247 distinct states, run finished after 401 ms. (steps per millisecond=87 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (AND p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p1 p2))), (F (AND (NOT p1) (NOT p2))), (F (OR (AND p0 p1) (AND p0 p2))), (F (AND p0 p1 p2)), (F (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 23 factoid took 1871 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
[2023-03-19 07:11:28] [INFO ] Invariant cache hit.
[2023-03-19 07:11:30] [INFO ] [Real]Absence check using 551 positive place invariants in 416 ms returned sat
[2023-03-19 07:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:11:35] [INFO ] [Real]Absence check using state equation in 5049 ms returned sat
[2023-03-19 07:11:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 07:11:37] [INFO ] [Nat]Absence check using 551 positive place invariants in 434 ms returned sat
[2023-03-19 07:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 07:11:42] [INFO ] [Nat]Absence check using state equation in 5203 ms returned sat
[2023-03-19 07:11:42] [INFO ] Computed and/alt/rep : 1301/2496/1301 causal constraints (skipped 0 transitions) in 85 ms.
[2023-03-19 07:11:50] [INFO ] Added : 275 causal constraints over 55 iterations in 7897 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 29 reset in 1136 ms.
Product exploration explored 100000 steps with 29 reset in 1352 ms.
Built C files in :
/tmp/ltsmin3616295455682316880
[2023-03-19 07:11:53] [INFO ] Computing symmetric may disable matrix : 1303 transitions.
[2023-03-19 07:11:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:11:53] [INFO ] Computing symmetric may enable matrix : 1303 transitions.
[2023-03-19 07:11:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:11:53] [INFO ] Computing Do-Not-Accords matrix : 1303 transitions.
[2023-03-19 07:11:53] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:11:53] [INFO ] Built C files in 353ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3616295455682316880
Running compilation step : cd /tmp/ltsmin3616295455682316880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3616295455682316880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin3616295455682316880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 101 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 07:11:56] [INFO ] Invariant cache hit.
[2023-03-19 07:11:57] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-19 07:11:57] [INFO ] Invariant cache hit.
[2023-03-19 07:11:59] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2023-03-19 07:11:59] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 07:11:59] [INFO ] Invariant cache hit.
[2023-03-19 07:12:00] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3805 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin5659819909180756419
[2023-03-19 07:12:00] [INFO ] Computing symmetric may disable matrix : 1303 transitions.
[2023-03-19 07:12:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:12:00] [INFO ] Computing symmetric may enable matrix : 1303 transitions.
[2023-03-19 07:12:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:12:00] [INFO ] Computing Do-Not-Accords matrix : 1303 transitions.
[2023-03-19 07:12:00] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:12:00] [INFO ] Built C files in 265ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5659819909180756419
Running compilation step : cd /tmp/ltsmin5659819909180756419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5659819909180756419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin5659819909180756419;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-19 07:12:03] [INFO ] Flatten gal took : 38 ms
[2023-03-19 07:12:04] [INFO ] Flatten gal took : 39 ms
[2023-03-19 07:12:04] [INFO ] Time to serialize gal into /tmp/LTL123259695282016261.gal : 7 ms
[2023-03-19 07:12:04] [INFO ] Time to serialize properties into /tmp/LTL18206986457904777919.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL123259695282016261.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3905264617434639040.hoa' '-atoms' '/tmp/LTL18206986457904777919.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL18206986457904777919.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3905264617434639040.hoa
Detected timeout of ITS tools.
[2023-03-19 07:12:19] [INFO ] Flatten gal took : 35 ms
[2023-03-19 07:12:19] [INFO ] Flatten gal took : 34 ms
[2023-03-19 07:12:19] [INFO ] Time to serialize gal into /tmp/LTL10320661214023913014.gal : 5 ms
[2023-03-19 07:12:19] [INFO ] Time to serialize properties into /tmp/LTL12825078628467453937.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10320661214023913014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12825078628467453937.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(p1008==1)")&&(("((p1354==0)||(p2508==1))")U(G("((p1154==0)||(p1494==1))")))))))
Formula 0 simplified : GF(!"(p1008==1)" | (!"((p1354==0)||(p2508==1))" R F!"((p1154==0)||(p1494==1))"))
Detected timeout of ITS tools.
[2023-03-19 07:12:34] [INFO ] Flatten gal took : 34 ms
[2023-03-19 07:12:34] [INFO ] Applying decomposition
[2023-03-19 07:12:34] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6462183044607629661.txt' '-o' '/tmp/graph6462183044607629661.bin' '-w' '/tmp/graph6462183044607629661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6462183044607629661.bin' '-l' '-1' '-v' '-w' '/tmp/graph6462183044607629661.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:12:34] [INFO ] Decomposing Gal with order
[2023-03-19 07:12:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:12:34] [INFO ] Removed a total of 301 redundant transitions.
[2023-03-19 07:12:34] [INFO ] Flatten gal took : 67 ms
[2023-03-19 07:12:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 12 ms.
[2023-03-19 07:12:34] [INFO ] Time to serialize gal into /tmp/LTL5196162781860414028.gal : 10 ms
[2023-03-19 07:12:34] [INFO ] Time to serialize properties into /tmp/LTL99315786819797818.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5196162781860414028.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL99315786819797818.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i14.u157.p1008==1)")&&(("((i19.u216.p1354==0)||(i36.u406.p2508==1))")U(G("((i16.u182.p1154==0)||(i21.u240.p1494==1))")))))))
Formula 0 simplified : GF(!"(i14.u157.p1008==1)" | (!"((i19.u216.p1354==0)||(i36.u406.p2508==1))" R F!"((i16.u182.p1154==0)||(i21.u240.p1494==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16209420892053920600
[2023-03-19 07:12:49] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16209420892053920600
Running compilation step : cd /tmp/ltsmin16209420892053920600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2834 ms.
Running link step : cd /tmp/ltsmin16209420892053920600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16209420892053920600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((LTLAPp0==true)&&((LTLAPp1==true) U []((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 3287 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-15 finished in 133473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-050B-LTLCardinality-05
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3058 transition count 2456
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1211 place count 2449 transition count 2199
Iterating global reduction 2 with 7 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1218 place count 2449 transition count 2197
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1222 place count 2447 transition count 2197
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 2 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 2 with 1788 rules applied. Total rules applied 3010 place count 1553 transition count 1303
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3012 place count 1551 transition count 1301
Applied a total of 3012 rules in 726 ms. Remains 1551 /3059 variables (removed 1508) and now considering 1301/2809 (removed 1508) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-19 07:12:57] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-19 07:12:58] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-19 07:12:58] [INFO ] Invariant cache hit.
[2023-03-19 07:13:00] [INFO ] Implicit Places using invariants and state equation in 2158 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
[2023-03-19 07:13:00] [INFO ] Invariant cache hit.
[2023-03-19 07:13:01] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1551/3059 places, 1301/2809 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4520 ms. Remains : 1551/3059 places, 1301/2809 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s865 0) (EQ s987 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 103 reset in 870 ms.
Product exploration explored 100000 steps with 102 reset in 1158 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 906 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=34 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 07:13:04] [INFO ] Invariant cache hit.
[2023-03-19 07:13:05] [INFO ] [Real]Absence check using 551 positive place invariants in 396 ms returned sat
[2023-03-19 07:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:13:11] [INFO ] [Real]Absence check using state equation in 5336 ms returned sat
[2023-03-19 07:13:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 07:13:12] [INFO ] [Nat]Absence check using 551 positive place invariants in 380 ms returned sat
[2023-03-19 07:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 07:13:17] [INFO ] [Nat]Absence check using state equation in 4670 ms returned sat
[2023-03-19 07:13:17] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 76 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:13:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 100 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 07:13:26] [INFO ] Invariant cache hit.
[2023-03-19 07:13:27] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-19 07:13:27] [INFO ] Invariant cache hit.
[2023-03-19 07:13:28] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2668 ms to find 0 implicit places.
[2023-03-19 07:13:28] [INFO ] Invariant cache hit.
[2023-03-19 07:13:29] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3584 ms. Remains : 1551/1551 places, 1301/1301 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 1041 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1056 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=44 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 07:13:31] [INFO ] Invariant cache hit.
[2023-03-19 07:13:33] [INFO ] [Real]Absence check using 551 positive place invariants in 414 ms returned sat
[2023-03-19 07:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:13:37] [INFO ] [Real]Absence check using state equation in 4709 ms returned sat
[2023-03-19 07:13:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 07:13:39] [INFO ] [Nat]Absence check using 551 positive place invariants in 380 ms returned sat
[2023-03-19 07:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 07:13:44] [INFO ] [Nat]Absence check using state equation in 4907 ms returned sat
[2023-03-19 07:13:44] [INFO ] Computed and/alt/rep : 1299/2494/1299 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-19 07:13:52] [INFO ] Added : 290 causal constraints over 58 iterations in 8450 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 104 reset in 909 ms.
Product exploration explored 100000 steps with 101 reset in 1105 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 62 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 07:13:55] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 07:13:55] [INFO ] Invariant cache hit.
[2023-03-19 07:13:56] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 952 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin3429341174280719566
[2023-03-19 07:13:56] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3429341174280719566
Running compilation step : cd /tmp/ltsmin3429341174280719566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2571 ms.
Running link step : cd /tmp/ltsmin3429341174280719566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3429341174280719566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6711035348000484907.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 49 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-19 07:14:11] [INFO ] Invariant cache hit.
[2023-03-19 07:14:12] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-19 07:14:12] [INFO ] Invariant cache hit.
[2023-03-19 07:14:14] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
[2023-03-19 07:14:14] [INFO ] Invariant cache hit.
[2023-03-19 07:14:15] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3571 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Built C files in :
/tmp/ltsmin7228305313242361167
[2023-03-19 07:14:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7228305313242361167
Running compilation step : cd /tmp/ltsmin7228305313242361167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7228305313242361167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7228305313242361167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-19 07:14:18] [INFO ] Flatten gal took : 45 ms
[2023-03-19 07:14:18] [INFO ] Flatten gal took : 37 ms
[2023-03-19 07:14:19] [INFO ] Time to serialize gal into /tmp/LTL4813625264175276012.gal : 1362 ms
[2023-03-19 07:14:19] [INFO ] Time to serialize properties into /tmp/LTL1924093140710616864.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4813625264175276012.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6539840562480813424.hoa' '-atoms' '/tmp/LTL1924093140710616864.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1924093140710616864.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6539840562480813424.hoa
Detected timeout of ITS tools.
[2023-03-19 07:14:34] [INFO ] Flatten gal took : 37 ms
[2023-03-19 07:14:34] [INFO ] Flatten gal took : 38 ms
[2023-03-19 07:14:34] [INFO ] Time to serialize gal into /tmp/LTL12742469301255201806.gal : 5 ms
[2023-03-19 07:14:34] [INFO ] Time to serialize properties into /tmp/LTL5095186450386757259.ltl : 202 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12742469301255201806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5095186450386757259.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p1914==0)&&(p2178==1))")))))
Formula 0 simplified : XXG!"((p1914==0)&&(p2178==1))"
Detected timeout of ITS tools.
[2023-03-19 07:14:50] [INFO ] Flatten gal took : 75 ms
[2023-03-19 07:14:50] [INFO ] Applying decomposition
[2023-03-19 07:14:50] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16756516813712071691.txt' '-o' '/tmp/graph16756516813712071691.bin' '-w' '/tmp/graph16756516813712071691.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16756516813712071691.bin' '-l' '-1' '-v' '-w' '/tmp/graph16756516813712071691.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:14:50] [INFO ] Decomposing Gal with order
[2023-03-19 07:14:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:14:50] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 07:14:50] [INFO ] Flatten gal took : 54 ms
[2023-03-19 07:14:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 12 ms.
[2023-03-19 07:14:50] [INFO ] Time to serialize gal into /tmp/LTL10946949439279988661.gal : 10 ms
[2023-03-19 07:14:50] [INFO ] Time to serialize properties into /tmp/LTL13341267542747361084.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10946949439279988661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13341267542747361084.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i27.u307.p1914==0)&&(i31.u351.p2178==1))")))))
Formula 0 simplified : XXG!"((i27.u307.p1914==0)&&(i31.u351.p2178==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin744996347098293839
[2023-03-19 07:15:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin744996347098293839
Running compilation step : cd /tmp/ltsmin744996347098293839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2470 ms.
Running link step : cd /tmp/ltsmin744996347098293839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin744996347098293839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-05 finished in 144544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(F(p2)||p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-050B-LTLCardinality-11
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 3059 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3059/3059 places, 2809/2809 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3058 transition count 2457
Reduce places removed 351 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 352 rules applied. Total rules applied 703 place count 2707 transition count 2456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 704 place count 2706 transition count 2456
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 704 place count 2706 transition count 2206
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1204 place count 2456 transition count 2206
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 3 with 6 rules applied. Total rules applied 1216 place count 2450 transition count 2200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1216 place count 2450 transition count 2199
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1218 place count 2449 transition count 2199
Performed 894 Post agglomeration using F-continuation condition.Transition count delta: 894
Deduced a syphon composed of 894 places in 1 ms
Reduce places removed 894 places and 0 transitions.
Iterating global reduction 3 with 1788 rules applied. Total rules applied 3006 place count 1555 transition count 1305
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3008 place count 1553 transition count 1303
Applied a total of 3008 rules in 704 ms. Remains 1553 /3059 variables (removed 1506) and now considering 1303/2809 (removed 1506) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-19 07:15:21] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-19 07:15:22] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-19 07:15:22] [INFO ] Invariant cache hit.
[2023-03-19 07:15:24] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
[2023-03-19 07:15:24] [INFO ] Invariant cache hit.
[2023-03-19 07:15:25] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1553/3059 places, 1303/2809 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4257 ms. Remains : 1553/3059 places, 1303/2809 transitions.
Running random walk in product with property : ShieldPPPs-PT-050B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s577 0) (EQ s704 1)), p1:(OR (EQ s704 0) (EQ s577 1)), p2:(OR (EQ s1283 0) (EQ s1523 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 60 reset in 940 ms.
Product exploration explored 100000 steps with 60 reset in 1092 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 408 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 07:15:28] [INFO ] Invariant cache hit.
[2023-03-19 07:15:28] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 07:15:28] [INFO ] [Nat]Absence check using 551 positive place invariants in 171 ms returned sat
[2023-03-19 07:15:29] [INFO ] After 639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 07:15:29] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-19 07:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-19 07:15:29] [INFO ] After 924ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-19 07:15:29] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 0 with 299 rules applied. Total rules applied 299 place count 1553 transition count 1303
Applied a total of 299 rules in 140 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Finished random walk after 2062 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 522 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-19 07:15:31] [INFO ] Invariant cache hit.
[2023-03-19 07:15:32] [INFO ] [Real]Absence check using 551 positive place invariants in 370 ms returned sat
[2023-03-19 07:15:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:15:36] [INFO ] [Real]Absence check using state equation in 4010 ms returned sat
[2023-03-19 07:15:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 07:15:38] [INFO ] [Nat]Absence check using 551 positive place invariants in 415 ms returned sat
[2023-03-19 07:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 07:15:43] [INFO ] [Nat]Absence check using state equation in 4521 ms returned sat
[2023-03-19 07:15:43] [INFO ] Computed and/alt/rep : 1302/2519/1302 causal constraints (skipped 0 transitions) in 111 ms.
[2023-03-19 07:15:52] [INFO ] Deduced a trap composed of 2 places in 887 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:15:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 54 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 07:15:52] [INFO ] Invariant cache hit.
[2023-03-19 07:15:53] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-19 07:15:53] [INFO ] Invariant cache hit.
[2023-03-19 07:15:55] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2845 ms to find 0 implicit places.
[2023-03-19 07:15:55] [INFO ] Invariant cache hit.
[2023-03-19 07:15:56] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3763 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 333 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 07:15:57] [INFO ] Invariant cache hit.
[2023-03-19 07:15:57] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 07:15:57] [INFO ] [Nat]Absence check using 551 positive place invariants in 88 ms returned sat
[2023-03-19 07:15:58] [INFO ] After 632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 07:15:58] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-19 07:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2023-03-19 07:15:58] [INFO ] After 1010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-19 07:15:58] [INFO ] After 1423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Partial Free-agglomeration rule applied 299 times.
Drop transitions removed 299 transitions
Iterating global reduction 0 with 299 rules applied. Total rules applied 299 place count 1553 transition count 1303
Applied a total of 299 rules in 119 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Finished random walk after 1963 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=93 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2)), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 553 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
[2023-03-19 07:16:00] [INFO ] Invariant cache hit.
[2023-03-19 07:16:01] [INFO ] [Real]Absence check using 551 positive place invariants in 360 ms returned sat
[2023-03-19 07:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:16:05] [INFO ] [Real]Absence check using state equation in 3797 ms returned sat
[2023-03-19 07:16:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 07:16:07] [INFO ] [Nat]Absence check using 551 positive place invariants in 354 ms returned sat
[2023-03-19 07:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 07:16:12] [INFO ] [Nat]Absence check using state equation in 4798 ms returned sat
[2023-03-19 07:16:12] [INFO ] Computed and/alt/rep : 1302/2519/1302 causal constraints (skipped 0 transitions) in 91 ms.
[2023-03-19 07:16:21] [INFO ] Deduced a trap composed of 2 places in 777 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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 07:16:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 60 reset in 1016 ms.
Product exploration explored 100000 steps with 61 reset in 1222 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 100 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-19 07:16:24] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-19 07:16:24] [INFO ] Invariant cache hit.
[2023-03-19 07:16:25] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1112 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Built C files in :
/tmp/ltsmin15316861514394922285
[2023-03-19 07:16:25] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15316861514394922285
Running compilation step : cd /tmp/ltsmin15316861514394922285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2787 ms.
Running link step : cd /tmp/ltsmin15316861514394922285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15316861514394922285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6740209503665428460.hoa' '--buchi-type=spotba'
LTSmin run took 6105 ms.
Treatment of property ShieldPPPs-PT-050B-LTLCardinality-11 finished in 74045 ms.
FORMULA ShieldPPPs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 07:16:34] [INFO ] Flatten gal took : 72 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6958874819441378646
[2023-03-19 07:16:34] [INFO ] Too many transitions (2809) to apply POR reductions. Disabling POR matrices.
[2023-03-19 07:16:34] [INFO ] Applying decomposition
[2023-03-19 07:16:34] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6958874819441378646
Running compilation step : cd /tmp/ltsmin6958874819441378646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 07:16:34] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14748468612210805856.txt' '-o' '/tmp/graph14748468612210805856.bin' '-w' '/tmp/graph14748468612210805856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14748468612210805856.bin' '-l' '-1' '-v' '-w' '/tmp/graph14748468612210805856.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:16:35] [INFO ] Decomposing Gal with order
[2023-03-19 07:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:16:35] [INFO ] Removed a total of 450 redundant transitions.
[2023-03-19 07:16:35] [INFO ] Flatten gal took : 104 ms
[2023-03-19 07:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 07:16:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality12719967273700038922.gal : 27 ms
[2023-03-19 07:16:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality15170688577719351656.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12719967273700038922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15170688577719351656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i26.u679.p1914==0)&&(i31.u773.p2178==1))")))))
Formula 0 simplified : XXG!"((i26.u679.p1914==0)&&(i31.u773.p2178==1))"
Compilation finished in 6652 ms.
Running link step : cd /tmp/ltsmin6958874819441378646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin6958874819441378646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-19 07:40:45] [INFO ] Applying decomposition
[2023-03-19 07:40:45] [INFO ] Flatten gal took : 174 ms
[2023-03-19 07:40:45] [INFO ] Decomposing Gal with order
[2023-03-19 07:40:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:40:46] [INFO ] Removed a total of 300 redundant transitions.
[2023-03-19 07:40:46] [INFO ] Flatten gal took : 314 ms
[2023-03-19 07:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 60 ms.
[2023-03-19 07:40:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality7459355921574922833.gal : 70 ms
[2023-03-19 07:40:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality10356596507605875633.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7459355921574922833.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10356596507605875633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u637.p1914==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....203
Formula 0 simplified : XXG!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u637.p1914==0)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....195
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 154064 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16098672 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-050B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713600507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;