Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789300437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716992347392

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 14:19:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:19:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:19:09] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2024-05-29 14:19:09] [INFO ] Transformed 7803 places.
[2024-05-29 14:19:09] [INFO ] Transformed 7103 transitions.
[2024-05-29 14:19:09] [INFO ] Found NUPN structural information;
[2024-05-29 14:19:10] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 670 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 7803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Discarding 1097 places :
Symmetric choice reduction at 0 with 1097 rule applications. Total rules 1097 place count 6706 transition count 6006
Iterating global reduction 0 with 1097 rules applied. Total rules applied 2194 place count 6706 transition count 6006
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2195 place count 6705 transition count 6005
Iterating global reduction 0 with 1 rules applied. Total rules applied 2196 place count 6705 transition count 6005
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2197 place count 6704 transition count 6004
Iterating global reduction 0 with 1 rules applied. Total rules applied 2198 place count 6704 transition count 6004
Applied a total of 2198 rules in 4901 ms. Remains 6704 /7803 variables (removed 1099) and now considering 6004/7103 (removed 1099) transitions.
// Phase 1: matrix 6004 rows 6704 cols
[2024-05-29 14:19:15] [INFO ] Computed 1101 invariants in 68 ms
[2024-05-29 14:19:18] [INFO ] Implicit Places using invariants in 2917 ms returned []
[2024-05-29 14:19:18] [INFO ] Invariant cache hit.
[2024-05-29 14:19:20] [INFO ] Implicit Places using invariants and state equation in 2549 ms returned []
Implicit Place search using SMT with State Equation took 5500 ms to find 0 implicit places.
[2024-05-29 14:19:20] [INFO ] Invariant cache hit.
[2024-05-29 14:19:25] [INFO ] Dead Transitions using invariants and state equation in 4702 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6704/7803 places, 6004/7103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15106 ms. Remains : 6704/7803 places, 6004/7103 transitions.
Support contains 26 out of 6704 places after structural reductions.
[2024-05-29 14:19:26] [INFO ] Flatten gal took : 308 ms
[2024-05-29 14:19:26] [INFO ] Flatten gal took : 182 ms
[2024-05-29 14:19:26] [INFO ] Input system was already deterministic with 6004 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) 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 12) seen :0
Running SMT prover for 12 properties.
[2024-05-29 14:19:27] [INFO ] Invariant cache hit.
[2024-05-29 14:19:29] [INFO ] After 1808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 14:19:31] [INFO ] [Nat]Absence check using 1101 positive place invariants in 713 ms returned sat
[2024-05-29 14:19:40] [INFO ] After 8065ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 14:19:44] [INFO ] Deduced a trap composed of 25 places in 2878 ms of which 16 ms to minimize.
[2024-05-29 14:19:46] [INFO ] Deduced a trap composed of 24 places in 2625 ms of which 4 ms to minimize.
[2024-05-29 14:19:50] [INFO ] Deduced a trap composed of 18 places in 3115 ms of which 5 ms to minimize.
[2024-05-29 14:19:53] [INFO ] Deduced a trap composed of 25 places in 3078 ms of which 8 ms to minimize.
[2024-05-29 14:19:56] [INFO ] Deduced a trap composed of 21 places in 2769 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 14:19:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 14:19:56] [INFO ] After 27132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 2679 ms.
Support contains 22 out of 6704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Drop transitions removed 1386 transitions
Trivial Post-agglo rules discarded 1386 transitions
Performed 1386 trivial Post agglomeration. Transition count delta: 1386
Iterating post reduction 0 with 1386 rules applied. Total rules applied 1386 place count 6704 transition count 4618
Reduce places removed 1386 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1390 rules applied. Total rules applied 2776 place count 5318 transition count 4614
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2780 place count 5314 transition count 4614
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2780 place count 5314 transition count 3817
Deduced a syphon composed of 797 places in 14 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4374 place count 4517 transition count 3817
Performed 1693 Post agglomeration using F-continuation condition.Transition count delta: 1693
Deduced a syphon composed of 1693 places in 4 ms
Reduce places removed 1693 places and 0 transitions.
Iterating global reduction 3 with 3386 rules applied. Total rules applied 7760 place count 2824 transition count 2124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7761 place count 2824 transition count 2123
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7763 place count 2823 transition count 2122
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 14 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7965 place count 2722 transition count 2122
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8167 place count 2621 transition count 2122
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 8 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 4 with 186 rules applied. Total rules applied 8353 place count 2528 transition count 2122
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 8354 place count 2528 transition count 2121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8355 place count 2527 transition count 2121
Partial Free-agglomeration rule applied 294 times.
Drop transitions removed 294 transitions
Iterating global reduction 5 with 294 rules applied. Total rules applied 8649 place count 2527 transition count 2121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8650 place count 2526 transition count 2120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8651 place count 2525 transition count 2120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 8651 place count 2525 transition count 2118
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 8655 place count 2523 transition count 2118
Applied a total of 8655 rules in 2099 ms. Remains 2523 /6704 variables (removed 4181) and now considering 2118/6004 (removed 3886) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2100 ms. Remains : 2523/6704 places, 2118/6004 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 57217 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57217 steps, saw 47728 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2118 rows 2523 cols
[2024-05-29 14:20:06] [INFO ] Computed 1100 invariants in 7 ms
[2024-05-29 14:20:06] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 14:20:07] [INFO ] [Nat]Absence check using 1100 positive place invariants in 210 ms returned sat
[2024-05-29 14:20:09] [INFO ] After 1876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 14:20:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 14:20:10] [INFO ] After 793ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-29 14:20:10] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2024-05-29 14:20:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 608 ms
[2024-05-29 14:20:12] [INFO ] After 2707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 801 ms.
[2024-05-29 14:20:13] [INFO ] After 6714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 20 out of 2523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2523/2523 places, 2118/2118 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2522 transition count 2117
Applied a total of 2 rules in 176 ms. Remains 2522 /2523 variables (removed 1) and now considering 2117/2118 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 2522/2523 places, 2117/2118 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 62875 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 62875 steps, saw 52775 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 2117 rows 2522 cols
[2024-05-29 14:20:18] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-29 14:20:19] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:20:20] [INFO ] [Nat]Absence check using 1100 positive place invariants in 215 ms returned sat
[2024-05-29 14:20:22] [INFO ] After 1706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:20:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 14:20:22] [INFO ] After 664ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 14:20:23] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2024-05-29 14:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 334 ms
[2024-05-29 14:20:24] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
[2024-05-29 14:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-05-29 14:20:24] [INFO ] After 2317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 660 ms.
[2024-05-29 14:20:25] [INFO ] After 5852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 484 ms.
Support contains 16 out of 2522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2522/2522 places, 2117/2117 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2522 transition count 2116
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2521 transition count 2116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2520 transition count 2115
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 2520 transition count 2115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 2519 transition count 2114
Applied a total of 6 rules in 371 ms. Remains 2519 /2522 variables (removed 3) and now considering 2114/2117 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 2519/2522 places, 2114/2117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 ms. (steps per millisecond=28 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 62174 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62174 steps, saw 51274 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2114 rows 2519 cols
[2024-05-29 14:20:30] [INFO ] Computed 1100 invariants in 17 ms
[2024-05-29 14:20:31] [INFO ] After 601ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:20:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 210 ms returned sat
[2024-05-29 14:20:33] [INFO ] After 1714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:20:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 14:20:34] [INFO ] After 667ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 14:20:34] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2024-05-29 14:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2024-05-29 14:20:35] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-05-29 14:20:36] [INFO ] After 2294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 640 ms.
[2024-05-29 14:20:36] [INFO ] After 5740ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 390 ms.
Support contains 16 out of 2519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2519/2519 places, 2114/2114 transitions.
Applied a total of 0 rules in 89 ms. Remains 2519 /2519 variables (removed 0) and now considering 2114/2114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2519/2519 places, 2114/2114 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2519/2519 places, 2114/2114 transitions.
Applied a total of 0 rules in 86 ms. Remains 2519 /2519 variables (removed 0) and now considering 2114/2114 (removed 0) transitions.
[2024-05-29 14:20:37] [INFO ] Invariant cache hit.
[2024-05-29 14:20:39] [INFO ] Implicit Places using invariants in 2001 ms returned [2502, 2506]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2009 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2517/2519 places, 2114/2114 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2515 transition count 2112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2515 transition count 2112
Applied a total of 4 rules in 166 ms. Remains 2515 /2517 variables (removed 2) and now considering 2112/2114 (removed 2) transitions.
// Phase 1: matrix 2112 rows 2515 cols
[2024-05-29 14:20:39] [INFO ] Computed 1098 invariants in 12 ms
[2024-05-29 14:20:41] [INFO ] Implicit Places using invariants in 1967 ms returned []
[2024-05-29 14:20:41] [INFO ] Invariant cache hit.
[2024-05-29 14:20:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:20:45] [INFO ] Implicit Places using invariants and state equation in 3809 ms returned []
Implicit Place search using SMT with State Equation took 5778 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2515/2519 places, 2112/2114 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8039 ms. Remains : 2515/2519 places, 2112/2114 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 62226 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62226 steps, saw 51786 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 14:20:49] [INFO ] Invariant cache hit.
[2024-05-29 14:20:50] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:20:51] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:20:53] [INFO ] After 1631ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:20:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:20:53] [INFO ] After 644ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 14:20:54] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
[2024-05-29 14:20:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2024-05-29 14:20:54] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2024-05-29 14:20:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2024-05-29 14:20:55] [INFO ] After 2261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 634 ms.
[2024-05-29 14:20:56] [INFO ] After 5642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 421 ms.
Support contains 16 out of 2515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2515/2515 places, 2112/2112 transitions.
Applied a total of 0 rules in 84 ms. Remains 2515 /2515 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2515/2515 places, 2112/2112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2515/2515 places, 2112/2112 transitions.
Applied a total of 0 rules in 84 ms. Remains 2515 /2515 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
[2024-05-29 14:20:56] [INFO ] Invariant cache hit.
[2024-05-29 14:20:58] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2024-05-29 14:20:58] [INFO ] Invariant cache hit.
[2024-05-29 14:21:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:21:02] [INFO ] Implicit Places using invariants and state equation in 3825 ms returned []
Implicit Place search using SMT with State Equation took 5716 ms to find 0 implicit places.
[2024-05-29 14:21:02] [INFO ] Redundant transitions in 121 ms returned []
[2024-05-29 14:21:02] [INFO ] Invariant cache hit.
[2024-05-29 14:21:04] [INFO ] Dead Transitions using invariants and state equation in 1588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7516 ms. Remains : 2515/2515 places, 2112/2112 transitions.
Partial Free-agglomeration rule applied 584 times.
Drop transitions removed 584 transitions
Iterating global reduction 0 with 584 rules applied. Total rules applied 584 place count 2515 transition count 2112
Applied a total of 584 rules in 197 ms. Remains 2515 /2515 variables (removed 0) and now considering 2112/2112 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 2112 rows 2515 cols
[2024-05-29 14:21:04] [INFO ] Computed 1098 invariants in 12 ms
[2024-05-29 14:21:05] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:21:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 215 ms returned sat
[2024-05-29 14:21:07] [INFO ] After 1790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:21:07] [INFO ] State equation strengthened by 571 read => feed constraints.
[2024-05-29 14:21:09] [INFO ] After 1660ms SMT Verify possible using 571 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 14:21:10] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 2 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 13 places in 637 ms of which 1 ms to minimize.
[2024-05-29 14:21:11] [INFO ] Deduced a trap composed of 5 places in 656 ms of which 1 ms to minimize.
[2024-05-29 14:21:12] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 1 ms to minimize.
[2024-05-29 14:21:13] [INFO ] Deduced a trap composed of 5 places in 631 ms of which 2 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 5 places in 678 ms of which 1 ms to minimize.
[2024-05-29 14:21:14] [INFO ] Deduced a trap composed of 5 places in 681 ms of which 1 ms to minimize.
[2024-05-29 14:21:15] [INFO ] Deduced a trap composed of 11 places in 666 ms of which 2 ms to minimize.
[2024-05-29 14:21:16] [INFO ] Deduced a trap composed of 5 places in 577 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 5 places in 618 ms of which 1 ms to minimize.
[2024-05-29 14:21:17] [INFO ] Deduced a trap composed of 5 places in 610 ms of which 1 ms to minimize.
[2024-05-29 14:21:18] [INFO ] Deduced a trap composed of 5 places in 644 ms of which 2 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 5 places in 603 ms of which 1 ms to minimize.
[2024-05-29 14:21:19] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 1 ms to minimize.
[2024-05-29 14:21:20] [INFO ] Deduced a trap composed of 5 places in 619 ms of which 1 ms to minimize.
[2024-05-29 14:21:21] [INFO ] Deduced a trap composed of 5 places in 602 ms of which 1 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 7 places in 608 ms of which 5 ms to minimize.
[2024-05-29 14:21:22] [INFO ] Deduced a trap composed of 5 places in 571 ms of which 1 ms to minimize.
[2024-05-29 14:21:23] [INFO ] Deduced a trap composed of 5 places in 584 ms of which 1 ms to minimize.
[2024-05-29 14:21:24] [INFO ] Deduced a trap composed of 5 places in 576 ms of which 1 ms to minimize.
[2024-05-29 14:21:24] [INFO ] Deduced a trap composed of 5 places in 564 ms of which 1 ms to minimize.
[2024-05-29 14:21:25] [INFO ] Deduced a trap composed of 7 places in 578 ms of which 2 ms to minimize.
[2024-05-29 14:21:26] [INFO ] Deduced a trap composed of 5 places in 628 ms of which 2 ms to minimize.
[2024-05-29 14:21:26] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 16641 ms
[2024-05-29 14:21:27] [INFO ] After 19730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1045 ms.
[2024-05-29 14:21:28] [INFO ] After 23695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
FORMULA ShieldPPPt-PT-100B-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1598 stabilizing places and 1598 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1396 transitions
Trivial Post-agglo rules discarded 1396 transitions
Performed 1396 trivial Post agglomeration. Transition count delta: 1396
Iterating post reduction 0 with 1396 rules applied. Total rules applied 1396 place count 6703 transition count 4607
Reduce places removed 1396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2793 place count 5307 transition count 4606
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2794 place count 5306 transition count 4606
Performed 800 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 800 Pre rules applied. Total rules applied 2794 place count 5306 transition count 3806
Deduced a syphon composed of 800 places in 11 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 3 with 1600 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 4396 place count 4504 transition count 3804
Iterating global reduction 3 with 2 rules applied. Total rules applied 4398 place count 4504 transition count 3804
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4398 place count 4504 transition count 3802
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4402 place count 4502 transition count 3802
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7796 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8399 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8400 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8400 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8404 place count 2500 transition count 2099
Applied a total of 8404 rules in 1952 ms. Remains 2500 /6704 variables (removed 4204) and now considering 2099/6004 (removed 3905) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2024-05-29 14:21:30] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:21:32] [INFO ] Implicit Places using invariants in 2002 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2003 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6704 places, 2099/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 153 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:21:33] [INFO ] Computed 1098 invariants in 16 ms
[2024-05-29 14:21:34] [INFO ] Implicit Places using invariants in 1837 ms returned []
[2024-05-29 14:21:34] [INFO ] Invariant cache hit.
[2024-05-29 14:21:38] [INFO ] Implicit Places using invariants and state equation in 3706 ms returned []
Implicit Place search using SMT with State Equation took 5548 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6704 places, 2097/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9657 ms. Remains : 2496/6704 places, 2097/6004 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s405 0) (EQ s512 1) (EQ s2153 0) (EQ s1885 1)), p1:(OR (EQ s2153 0) (EQ s1885 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 1631 ms.
Product exploration explored 100000 steps with 5 reset in 1870 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:21:42] [INFO ] Invariant cache hit.
[2024-05-29 14:21:43] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:21:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:21:44] [INFO ] After 1165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:21:45] [INFO ] After 1292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 14:21:45] [INFO ] After 1910ms 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 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 79 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 89688 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89688 steps, saw 65953 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:21:48] [INFO ] Invariant cache hit.
[2024-05-29 14:21:48] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:21:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 230 ms returned sat
[2024-05-29 14:21:50] [INFO ] After 1151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:21:50] [INFO ] After 1278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-29 14:21:50] [INFO ] After 1936ms 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 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 79 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 77 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:21:51] [INFO ] Invariant cache hit.
[2024-05-29 14:21:52] [INFO ] Implicit Places using invariants in 1720 ms returned []
[2024-05-29 14:21:52] [INFO ] Invariant cache hit.
[2024-05-29 14:21:56] [INFO ] Implicit Places using invariants and state equation in 3586 ms returned []
Implicit Place search using SMT with State Equation took 5308 ms to find 0 implicit places.
[2024-05-29 14:21:56] [INFO ] Redundant transitions in 90 ms returned []
[2024-05-29 14:21:56] [INFO ] Invariant cache hit.
[2024-05-29 14:21:57] [INFO ] Dead Transitions using invariants and state equation in 1581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7063 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 193 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:21:58] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:21:58] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:21:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 217 ms returned sat
[2024-05-29 14:22:00] [INFO ] After 1086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:22:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 14:22:00] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:22:00] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:22:00] [INFO ] After 1897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 83 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:22:00] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:22:02] [INFO ] Implicit Places using invariants in 1884 ms returned []
[2024-05-29 14:22:02] [INFO ] Invariant cache hit.
[2024-05-29 14:22:06] [INFO ] Implicit Places using invariants and state equation in 3782 ms returned []
Implicit Place search using SMT with State Equation took 5668 ms to find 0 implicit places.
[2024-05-29 14:22:06] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 14:22:06] [INFO ] Invariant cache hit.
[2024-05-29 14:22:08] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7334 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:22:08] [INFO ] Invariant cache hit.
[2024-05-29 14:22:08] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:22:09] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2024-05-29 14:22:10] [INFO ] After 1116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:22:10] [INFO ] After 1242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:22:10] [INFO ] After 1835ms 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 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 77 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97628 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97628 steps, saw 71979 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:22:13] [INFO ] Invariant cache hit.
[2024-05-29 14:22:14] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:22:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:22:15] [INFO ] After 1086ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:22:15] [INFO ] After 1220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 14:22:16] [INFO ] After 1837ms 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 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 90 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 80 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:22:16] [INFO ] Invariant cache hit.
[2024-05-29 14:22:18] [INFO ] Implicit Places using invariants in 1840 ms returned []
[2024-05-29 14:22:18] [INFO ] Invariant cache hit.
[2024-05-29 14:22:21] [INFO ] Implicit Places using invariants and state equation in 3658 ms returned []
Implicit Place search using SMT with State Equation took 5499 ms to find 0 implicit places.
[2024-05-29 14:22:21] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 14:22:21] [INFO ] Invariant cache hit.
[2024-05-29 14:22:23] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7167 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 595 times.
Drop transitions removed 595 transitions
Iterating global reduction 0 with 595 rules applied. Total rules applied 595 place count 2496 transition count 2097
Applied a total of 595 rules in 206 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:22:23] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:22:23] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:22:24] [INFO ] [Nat]Absence check using 1098 positive place invariants in 225 ms returned sat
[2024-05-29 14:22:25] [INFO ] After 1181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 14:22:25] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:22:25] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 14:22:25] [INFO ] After 2045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 1337 ms.
Product exploration explored 100000 steps with 2 reset in 1809 ms.
Built C files in :
/tmp/ltsmin2131422295076005036
[2024-05-29 14:22:29] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:22:29] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2131422295076005036
Running compilation step : cd /tmp/ltsmin2131422295076005036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2131422295076005036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2131422295076005036;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 81 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:22:32] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:22:34] [INFO ] Implicit Places using invariants in 1810 ms returned []
[2024-05-29 14:22:34] [INFO ] Invariant cache hit.
[2024-05-29 14:22:38] [INFO ] Implicit Places using invariants and state equation in 3746 ms returned []
Implicit Place search using SMT with State Equation took 5559 ms to find 0 implicit places.
[2024-05-29 14:22:38] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:22:38] [INFO ] Invariant cache hit.
[2024-05-29 14:22:39] [INFO ] Dead Transitions using invariants and state equation in 1555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7239 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin6318775506919865685
[2024-05-29 14:22:39] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:22:39] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6318775506919865685
Running compilation step : cd /tmp/ltsmin6318775506919865685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6318775506919865685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6318775506919865685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:22:43] [INFO ] Flatten gal took : 65 ms
[2024-05-29 14:22:43] [INFO ] Flatten gal took : 63 ms
[2024-05-29 14:22:43] [INFO ] Time to serialize gal into /tmp/LTL2245353259032122410.gal : 17 ms
[2024-05-29 14:22:43] [INFO ] Time to serialize properties into /tmp/LTL3874673294113563488.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2245353259032122410.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14672094824887464846.hoa' '-atoms' '/tmp/LTL3874673294113563488.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3874673294113563488.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14672094824887464846.hoa
Detected timeout of ITS tools.
[2024-05-29 14:22:58] [INFO ] Flatten gal took : 69 ms
[2024-05-29 14:22:58] [INFO ] Flatten gal took : 62 ms
[2024-05-29 14:22:58] [INFO ] Time to serialize gal into /tmp/LTL10124295595375609303.gal : 14 ms
[2024-05-29 14:22:58] [INFO ] Time to serialize properties into /tmp/LTL12407732989297775023.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10124295595375609303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12407732989297775023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((p1346==0)||(p1664==1))||((p6718==0)||(p5895==1)))")||(F("((p6718==0)||(p5895==1))"))))))
Formula 0 simplified : G(F!"(((p1346==0)||(p1664==1))||((p6718==0)||(p5895==1)))" & FG!"((p6718==0)||(p5895==1))")
Detected timeout of ITS tools.
[2024-05-29 14:23:13] [INFO ] Flatten gal took : 59 ms
[2024-05-29 14:23:13] [INFO ] Applying decomposition
[2024-05-29 14:23:13] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6820953220643979917.txt' '-o' '/tmp/graph6820953220643979917.bin' '-w' '/tmp/graph6820953220643979917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6820953220643979917.bin' '-l' '-1' '-v' '-w' '/tmp/graph6820953220643979917.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:23:14] [INFO ] Decomposing Gal with order
[2024-05-29 14:23:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:23:14] [INFO ] Removed a total of 606 redundant transitions.
[2024-05-29 14:23:14] [INFO ] Flatten gal took : 243 ms
[2024-05-29 14:23:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 46 ms.
[2024-05-29 14:23:14] [INFO ] Time to serialize gal into /tmp/LTL796044863938030284.gal : 53 ms
[2024-05-29 14:23:14] [INFO ] Time to serialize properties into /tmp/LTL1488029683015628957.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL796044863938030284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1488029683015628957.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((i6.i2.i1.u132.p1346==0)||(i8.i0.i0.u166.p1664==1))||((i38.i1.i1.u690.p6718==0)||(i33.i1.i0.u605.p5895==1)))")||(F("((i38.i...209
Formula 0 simplified : G(F!"(((i6.i2.i1.u132.p1346==0)||(i8.i0.i0.u166.p1664==1))||((i38.i1.i1.u690.p6718==0)||(i33.i1.i0.u605.p5895==1)))" & FG!"((i38.i1....202
Reverse transition relation is NOT exact ! Due to transitions i6.i2.i1.t299, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...178
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1019665874621906137
[2024-05-29 14:23:29] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1019665874621906137
Running compilation step : cd /tmp/ltsmin1019665874621906137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1019665874621906137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1019665874621906137;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-00 finished in 123895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6703 transition count 4606
Reduce places removed 1397 places and 0 transitions.
Iterating post reduction 1 with 1397 rules applied. Total rules applied 2794 place count 5306 transition count 4606
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2794 place count 5306 transition count 3808
Deduced a syphon composed of 798 places in 11 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4390 place count 4508 transition count 3808
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4392 place count 4506 transition count 3806
Iterating global reduction 2 with 2 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4394 place count 4506 transition count 3804
Deduced a syphon composed of 2 places in 24 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 4398 place count 4504 transition count 3804
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 2 with 3398 rules applied. Total rules applied 7796 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7797 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7799 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8001 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8203 place count 2602 transition count 2103
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8395 place count 2506 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8397 place count 2504 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8398 place count 2503 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8398 place count 2503 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8402 place count 2501 transition count 2099
Applied a total of 8402 rules in 1872 ms. Remains 2501 /6704 variables (removed 4203) and now considering 2099/6004 (removed 3905) transitions.
// Phase 1: matrix 2099 rows 2501 cols
[2024-05-29 14:23:34] [INFO ] Computed 1100 invariants in 3 ms
[2024-05-29 14:23:36] [INFO ] Implicit Places using invariants in 1764 ms returned [2484, 2488]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1766 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/6704 places, 2099/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2497 transition count 2097
Applied a total of 4 rules in 163 ms. Remains 2497 /2499 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2497 cols
[2024-05-29 14:23:36] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:23:38] [INFO ] Implicit Places using invariants in 1898 ms returned []
[2024-05-29 14:23:38] [INFO ] Invariant cache hit.
[2024-05-29 14:23:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 14:23:42] [INFO ] Implicit Places using invariants and state equation in 3810 ms returned []
Implicit Place search using SMT with State Equation took 5709 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2497/6704 places, 2097/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9512 ms. Remains : 2497/6704 places, 2097/6004 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s76 0), p1:(AND (EQ s557 0) (EQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1199 ms.
Stack based approach found an accepted trace after 228 steps with 0 reset with depth 229 and stack size 229 in 4 ms.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-04 finished in 10867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Support contains 4 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6703 transition count 4605
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5305 transition count 4605
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2796 place count 5305 transition count 3807
Deduced a syphon composed of 798 places in 12 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4392 place count 4507 transition count 3807
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4393 place count 4506 transition count 3806
Iterating global reduction 2 with 1 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4394 place count 4506 transition count 3805
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4396 place count 4505 transition count 3805
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7792 place count 2807 transition count 2107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7793 place count 2807 transition count 2106
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7795 place count 2806 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 7997 place count 2705 transition count 2105
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8199 place count 2604 transition count 2105
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8391 place count 2508 transition count 2105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8393 place count 2506 transition count 2103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8394 place count 2505 transition count 2103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8394 place count 2505 transition count 2101
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8398 place count 2503 transition count 2101
Applied a total of 8398 rules in 1900 ms. Remains 2503 /6704 variables (removed 4201) and now considering 2101/6004 (removed 3903) transitions.
// Phase 1: matrix 2101 rows 2503 cols
[2024-05-29 14:23:45] [INFO ] Computed 1100 invariants in 10 ms
[2024-05-29 14:23:47] [INFO ] Implicit Places using invariants in 1690 ms returned [2486, 2490]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1691 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/6704 places, 2101/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2499 transition count 2099
Applied a total of 4 rules in 164 ms. Remains 2499 /2501 variables (removed 2) and now considering 2099/2101 (removed 2) transitions.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:23:47] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:23:49] [INFO ] Implicit Places using invariants in 1713 ms returned []
[2024-05-29 14:23:49] [INFO ] Invariant cache hit.
[2024-05-29 14:23:53] [INFO ] Implicit Places using invariants and state equation in 3800 ms returned []
Implicit Place search using SMT with State Equation took 5515 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2499/6704 places, 2099/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9271 ms. Remains : 2499/6704 places, 2099/6004 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s1958 0) (EQ s728 1)), p0:(OR (EQ s779 0) (EQ s1531 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1239 ms.
Product exploration explored 100000 steps with 0 reset in 1637 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 p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 67246 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67246 steps, saw 48075 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:24:00] [INFO ] Invariant cache hit.
[2024-05-29 14:24:00] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:00] [INFO ] [Nat]Absence check using 1098 positive place invariants in 211 ms returned sat
[2024-05-29 14:24:02] [INFO ] After 1280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:02] [INFO ] After 1645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 221 ms.
[2024-05-29 14:24:02] [INFO ] After 2550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 126 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2099
Applied a total of 2 rules in 163 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 90335 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90335 steps, saw 63507 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:24:06] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:24:07] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:07] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2024-05-29 14:24:09] [INFO ] After 1212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:09] [INFO ] After 1587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-05-29 14:24:09] [INFO ] After 2477ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 80 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 77 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2024-05-29 14:24:10] [INFO ] Invariant cache hit.
[2024-05-29 14:24:11] [INFO ] Implicit Places using invariants in 1706 ms returned []
[2024-05-29 14:24:11] [INFO ] Invariant cache hit.
[2024-05-29 14:24:15] [INFO ] Implicit Places using invariants and state equation in 3844 ms returned []
Implicit Place search using SMT with State Equation took 5562 ms to find 0 implicit places.
[2024-05-29 14:24:15] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:24:15] [INFO ] Invariant cache hit.
[2024-05-29 14:24:17] [INFO ] Dead Transitions using invariants and state equation in 1567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7267 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2499 transition count 2099
Applied a total of 594 rules in 192 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:24:17] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:24:17] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 221 ms returned sat
[2024-05-29 14:24:19] [INFO ] After 1310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:24:19] [INFO ] After 222ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:20] [INFO ] After 594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-29 14:24:20] [INFO ] After 2810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 86 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:24:21] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:24:22] [INFO ] Implicit Places using invariants in 1899 ms returned []
[2024-05-29 14:24:22] [INFO ] Invariant cache hit.
[2024-05-29 14:24:26] [INFO ] Implicit Places using invariants and state equation in 3802 ms returned []
Implicit Place search using SMT with State Equation took 5703 ms to find 0 implicit places.
[2024-05-29 14:24:26] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:24:26] [INFO ] Invariant cache hit.
[2024-05-29 14:24:28] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7303 ms. Remains : 2499/2499 places, 2099/2099 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 p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 66722 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66722 steps, saw 47711 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 14:24:32] [INFO ] Invariant cache hit.
[2024-05-29 14:24:32] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:24:34] [INFO ] After 1246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:34] [INFO ] After 1607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 214 ms.
[2024-05-29 14:24:34] [INFO ] After 2495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 125 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2499 transition count 2099
Applied a total of 2 rules in 155 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 91545 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91545 steps, saw 64389 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:24:38] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:24:39] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 204 ms returned sat
[2024-05-29 14:24:41] [INFO ] After 1240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:41] [INFO ] After 1609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 213 ms.
[2024-05-29 14:24:41] [INFO ] After 2440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 76 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 76 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
[2024-05-29 14:24:42] [INFO ] Invariant cache hit.
[2024-05-29 14:24:43] [INFO ] Implicit Places using invariants in 1695 ms returned []
[2024-05-29 14:24:43] [INFO ] Invariant cache hit.
[2024-05-29 14:24:47] [INFO ] Implicit Places using invariants and state equation in 3759 ms returned []
Implicit Place search using SMT with State Equation took 5456 ms to find 0 implicit places.
[2024-05-29 14:24:47] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 14:24:47] [INFO ] Invariant cache hit.
[2024-05-29 14:24:49] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7142 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Partial Free-agglomeration rule applied 594 times.
Drop transitions removed 594 transitions
Iterating global reduction 0 with 594 rules applied. Total rules applied 594 place count 2499 transition count 2099
Applied a total of 594 rules in 185 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:24:49] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:24:49] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 14:24:50] [INFO ] [Nat]Absence check using 1098 positive place invariants in 207 ms returned sat
[2024-05-29 14:24:51] [INFO ] After 1379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:24:51] [INFO ] After 222ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 14:24:52] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 224 ms.
[2024-05-29 14:24:52] [INFO ] After 2874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1203 ms.
Product exploration explored 100000 steps with 0 reset in 1651 ms.
Built C files in :
/tmp/ltsmin8555432272764709416
[2024-05-29 14:24:55] [INFO ] Too many transitions (2099) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:24:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8555432272764709416
Running compilation step : cd /tmp/ltsmin8555432272764709416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8555432272764709416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8555432272764709416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2099/2099 transitions.
Applied a total of 0 rules in 78 ms. Remains 2499 /2499 variables (removed 0) and now considering 2099/2099 (removed 0) transitions.
// Phase 1: matrix 2099 rows 2499 cols
[2024-05-29 14:24:59] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:25:00] [INFO ] Implicit Places using invariants in 1877 ms returned []
[2024-05-29 14:25:00] [INFO ] Invariant cache hit.
[2024-05-29 14:25:04] [INFO ] Implicit Places using invariants and state equation in 3747 ms returned []
Implicit Place search using SMT with State Equation took 5632 ms to find 0 implicit places.
[2024-05-29 14:25:04] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-29 14:25:04] [INFO ] Invariant cache hit.
[2024-05-29 14:25:06] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7297 ms. Remains : 2499/2499 places, 2099/2099 transitions.
Built C files in :
/tmp/ltsmin17473847310005654396
[2024-05-29 14:25:06] [INFO ] Too many transitions (2099) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:25:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17473847310005654396
Running compilation step : cd /tmp/ltsmin17473847310005654396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17473847310005654396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17473847310005654396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:25:09] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:25:09] [INFO ] Flatten gal took : 55 ms
[2024-05-29 14:25:09] [INFO ] Time to serialize gal into /tmp/LTL10678830376325136494.gal : 11 ms
[2024-05-29 14:25:09] [INFO ] Time to serialize properties into /tmp/LTL7303929918516528667.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10678830376325136494.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11115053171671653896.hoa' '-atoms' '/tmp/LTL7303929918516528667.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7303929918516528667.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11115053171671653896.hoa
Detected timeout of ITS tools.
[2024-05-29 14:25:24] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:25:24] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:25:24] [INFO ] Time to serialize gal into /tmp/LTL8262151840727999662.gal : 16 ms
[2024-05-29 14:25:24] [INFO ] Time to serialize properties into /tmp/LTL2280629129472476392.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8262151840727999662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2280629129472476392.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(F("((p2487==0)||(p4807==1))")))||(G("((p6118==0)||(p2332==1))"))))
Formula 0 simplified : FG!"((p2487==0)||(p4807==1))" & F!"((p6118==0)||(p2332==1))"
Detected timeout of ITS tools.
[2024-05-29 14:25:39] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:25:39] [INFO ] Applying decomposition
[2024-05-29 14:25:39] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7569978911274553432.txt' '-o' '/tmp/graph7569978911274553432.bin' '-w' '/tmp/graph7569978911274553432.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7569978911274553432.bin' '-l' '-1' '-v' '-w' '/tmp/graph7569978911274553432.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:25:40] [INFO ] Decomposing Gal with order
[2024-05-29 14:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:25:40] [INFO ] Removed a total of 599 redundant transitions.
[2024-05-29 14:25:40] [INFO ] Flatten gal took : 104 ms
[2024-05-29 14:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 19 ms.
[2024-05-29 14:25:40] [INFO ] Time to serialize gal into /tmp/LTL3926177876645991590.gal : 23 ms
[2024-05-29 14:25:40] [INFO ] Time to serialize properties into /tmp/LTL3493229079815071181.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3926177876645991590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3493229079815071181.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(F("((i12.i1.i2.u248.p2487==0)||(i27.i0.i0.u489.p4807==1))")))||(G("((i34.i1.i2.u626.p6118==0)||(i11.i1.i1.u233.p2332==1))"))))
Formula 0 simplified : FG!"((i12.i1.i2.u248.p2487==0)||(i27.i0.i0.u489.p4807==1))" & F!"((i34.i1.i2.u626.p6118==0)||(i11.i1.i1.u233.p2332==1))"
Reverse transition relation is NOT exact ! Due to transitions i27.i0.t300, i27.i0.t301, i27.i1.t187, Intersection with reachable at each step enabled. (de...202
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11067156958828479768
[2024-05-29 14:25:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11067156958828479768
Running compilation step : cd /tmp/ltsmin11067156958828479768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11067156958828479768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11067156958828479768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-05 finished in 135071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||G((F(p1)&&F(G(p2))))))'
Support contains 6 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1395 transitions
Trivial Post-agglo rules discarded 1395 transitions
Performed 1395 trivial Post agglomeration. Transition count delta: 1395
Iterating post reduction 0 with 1395 rules applied. Total rules applied 1395 place count 6703 transition count 4608
Reduce places removed 1395 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1396 rules applied. Total rules applied 2791 place count 5308 transition count 4607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2792 place count 5307 transition count 4607
Performed 797 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 797 Pre rules applied. Total rules applied 2792 place count 5307 transition count 3810
Deduced a syphon composed of 797 places in 11 ms
Reduce places removed 797 places and 0 transitions.
Iterating global reduction 3 with 1594 rules applied. Total rules applied 4386 place count 4510 transition count 3810
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 4387 place count 4509 transition count 3809
Iterating global reduction 3 with 1 rules applied. Total rules applied 4388 place count 4509 transition count 3809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4388 place count 4509 transition count 3808
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4390 place count 4508 transition count 3808
Performed 1699 Post agglomeration using F-continuation condition.Transition count delta: 1699
Deduced a syphon composed of 1699 places in 4 ms
Reduce places removed 1699 places and 0 transitions.
Iterating global reduction 3 with 3398 rules applied. Total rules applied 7788 place count 2809 transition count 2109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7789 place count 2809 transition count 2108
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7791 place count 2808 transition count 2107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 7993 place count 2707 transition count 2107
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8195 place count 2606 transition count 2107
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 4 with 192 rules applied. Total rules applied 8387 place count 2510 transition count 2107
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 8388 place count 2510 transition count 2107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8390 place count 2508 transition count 2105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8391 place count 2507 transition count 2105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8391 place count 2507 transition count 2103
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8395 place count 2505 transition count 2103
Applied a total of 8395 rules in 2003 ms. Remains 2505 /6704 variables (removed 4199) and now considering 2103/6004 (removed 3901) transitions.
// Phase 1: matrix 2103 rows 2505 cols
[2024-05-29 14:26:00] [INFO ] Computed 1100 invariants in 9 ms
[2024-05-29 14:26:02] [INFO ] Implicit Places using invariants in 1859 ms returned [2488, 2492]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1864 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/6704 places, 2103/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 2101
Applied a total of 4 rules in 153 ms. Remains 2501 /2503 variables (removed 2) and now considering 2101/2103 (removed 2) transitions.
// Phase 1: matrix 2101 rows 2501 cols
[2024-05-29 14:26:02] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:26:04] [INFO ] Implicit Places using invariants in 1904 ms returned []
[2024-05-29 14:26:04] [INFO ] Invariant cache hit.
[2024-05-29 14:26:08] [INFO ] Implicit Places using invariants and state equation in 3807 ms returned []
Implicit Place search using SMT with State Equation took 5712 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2501/6704 places, 2101/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9733 ms. Remains : 2501/6704 places, 2101/6004 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s1080 0) (EQ s2202 1)), p0:(OR (EQ s651 0) (EQ s580 1)), p2:(AND (EQ s1731 0) (EQ s1857 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1209 ms.
Product exploration explored 100000 steps with 0 reset in 1639 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 p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 164 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 75399 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75399 steps, saw 53461 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 14:26:16] [INFO ] Invariant cache hit.
[2024-05-29 14:26:16] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:26:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:26:19] [INFO ] After 1704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:26:20] [INFO ] After 2836ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 649 ms.
[2024-05-29 14:26:21] [INFO ] After 4595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 456 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 75391 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75391 steps, saw 53456 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 14:26:26] [INFO ] Invariant cache hit.
[2024-05-29 14:26:26] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:26:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 203 ms returned sat
[2024-05-29 14:26:29] [INFO ] After 1639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:26:30] [INFO ] After 2830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 646 ms.
[2024-05-29 14:26:31] [INFO ] After 4560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 530 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 89 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
[2024-05-29 14:26:32] [INFO ] Invariant cache hit.
[2024-05-29 14:26:34] [INFO ] Implicit Places using invariants in 1822 ms returned []
[2024-05-29 14:26:34] [INFO ] Invariant cache hit.
[2024-05-29 14:26:37] [INFO ] Implicit Places using invariants and state equation in 3727 ms returned []
Implicit Place search using SMT with State Equation took 5552 ms to find 0 implicit places.
[2024-05-29 14:26:37] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-29 14:26:37] [INFO ] Invariant cache hit.
[2024-05-29 14:26:39] [INFO ] Dead Transitions using invariants and state equation in 1528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7203 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Partial Free-agglomeration rule applied 589 times.
Drop transitions removed 589 transitions
Iterating global reduction 0 with 589 rules applied. Total rules applied 589 place count 2501 transition count 2101
Applied a total of 589 rules in 191 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 2101 rows 2501 cols
[2024-05-29 14:26:39] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:26:40] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:26:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 212 ms returned sat
[2024-05-29 14:26:42] [INFO ] After 1692ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:26:43] [INFO ] After 2787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 633 ms.
[2024-05-29 14:26:44] [INFO ] After 4510ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 164 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 87 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
// Phase 1: matrix 2101 rows 2501 cols
[2024-05-29 14:26:45] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:26:47] [INFO ] Implicit Places using invariants in 1888 ms returned []
[2024-05-29 14:26:47] [INFO ] Invariant cache hit.
[2024-05-29 14:26:50] [INFO ] Implicit Places using invariants and state equation in 3703 ms returned []
Implicit Place search using SMT with State Equation took 5593 ms to find 0 implicit places.
[2024-05-29 14:26:50] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:26:50] [INFO ] Invariant cache hit.
[2024-05-29 14:26:52] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7268 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 170 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 74191 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74191 steps, saw 52645 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 14:26:57] [INFO ] Invariant cache hit.
[2024-05-29 14:26:57] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:26:58] [INFO ] [Nat]Absence check using 1098 positive place invariants in 226 ms returned sat
[2024-05-29 14:27:00] [INFO ] After 1727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:27:01] [INFO ] After 2854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 654 ms.
[2024-05-29 14:27:02] [INFO ] After 4621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 456 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 79 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 73752 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73752 steps, saw 52349 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-29 14:27:07] [INFO ] Invariant cache hit.
[2024-05-29 14:27:07] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:27:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 208 ms returned sat
[2024-05-29 14:27:10] [INFO ] After 1699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:27:11] [INFO ] After 2874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 664 ms.
[2024-05-29 14:27:12] [INFO ] After 4653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 481 ms.
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 91 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
[2024-05-29 14:27:13] [INFO ] Invariant cache hit.
[2024-05-29 14:27:15] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2024-05-29 14:27:15] [INFO ] Invariant cache hit.
[2024-05-29 14:27:18] [INFO ] Implicit Places using invariants and state equation in 3746 ms returned []
Implicit Place search using SMT with State Equation took 5619 ms to find 0 implicit places.
[2024-05-29 14:27:18] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-29 14:27:18] [INFO ] Invariant cache hit.
[2024-05-29 14:27:20] [INFO ] Dead Transitions using invariants and state equation in 1592 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7342 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Partial Free-agglomeration rule applied 589 times.
Drop transitions removed 589 transitions
Iterating global reduction 0 with 589 rules applied. Total rules applied 589 place count 2501 transition count 2101
Applied a total of 589 rules in 198 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 2101 rows 2501 cols
[2024-05-29 14:27:20] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:27:21] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 14:27:22] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:27:24] [INFO ] After 1725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 14:27:25] [INFO ] After 2848ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 654 ms.
[2024-05-29 14:27:25] [INFO ] After 4616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 178 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 1220 ms.
Product exploration explored 100000 steps with 0 reset in 1654 ms.
Built C files in :
/tmp/ltsmin4311017224006287855
[2024-05-29 14:27:29] [INFO ] Too many transitions (2101) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:27:29] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4311017224006287855
Running compilation step : cd /tmp/ltsmin4311017224006287855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4311017224006287855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4311017224006287855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 2101/2101 transitions.
Applied a total of 0 rules in 90 ms. Remains 2501 /2501 variables (removed 0) and now considering 2101/2101 (removed 0) transitions.
// Phase 1: matrix 2101 rows 2501 cols
[2024-05-29 14:27:32] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:27:34] [INFO ] Implicit Places using invariants in 1928 ms returned []
[2024-05-29 14:27:34] [INFO ] Invariant cache hit.
[2024-05-29 14:27:38] [INFO ] Implicit Places using invariants and state equation in 3833 ms returned []
Implicit Place search using SMT with State Equation took 5767 ms to find 0 implicit places.
[2024-05-29 14:27:38] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:27:38] [INFO ] Invariant cache hit.
[2024-05-29 14:27:40] [INFO ] Dead Transitions using invariants and state equation in 1552 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7455 ms. Remains : 2501/2501 places, 2101/2101 transitions.
Built C files in :
/tmp/ltsmin11208737908618782882
[2024-05-29 14:27:40] [INFO ] Too many transitions (2101) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:27:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11208737908618782882
Running compilation step : cd /tmp/ltsmin11208737908618782882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11208737908618782882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11208737908618782882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:27:43] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:27:43] [INFO ] Flatten gal took : 50 ms
[2024-05-29 14:27:43] [INFO ] Time to serialize gal into /tmp/LTL1515266347404037675.gal : 14 ms
[2024-05-29 14:27:43] [INFO ] Time to serialize properties into /tmp/LTL9086741897355122955.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1515266347404037675.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15192185319171746396.hoa' '-atoms' '/tmp/LTL9086741897355122955.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9086741897355122955.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15192185319171746396.hoa
Detected timeout of ITS tools.
[2024-05-29 14:27:58] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:27:58] [INFO ] Flatten gal took : 51 ms
[2024-05-29 14:27:58] [INFO ] Time to serialize gal into /tmp/LTL9086652454929357965.gal : 9 ms
[2024-05-29 14:27:58] [INFO ] Time to serialize properties into /tmp/LTL17356761065213684059.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9086652454929357965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17356761065213684059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G((F("((p2095==0)||(p1886==1))"))U("((p3409==0)||(p6847==1))")))||(G((F("((p3409==0)||(p6847==1))"))&&(F(G("((p5414==0)&&(p5799==1...165
Formula 0 simplified : F(G!"((p2095==0)||(p1886==1))" R !"((p3409==0)||(p6847==1))") & F(G!"((p3409==0)||(p6847==1))" | GF!"((p5414==0)&&(p5799==1))")
Detected timeout of ITS tools.
[2024-05-29 14:28:13] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:28:13] [INFO ] Applying decomposition
[2024-05-29 14:28:13] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16903866748462488959.txt' '-o' '/tmp/graph16903866748462488959.bin' '-w' '/tmp/graph16903866748462488959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16903866748462488959.bin' '-l' '-1' '-v' '-w' '/tmp/graph16903866748462488959.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:28:13] [INFO ] Decomposing Gal with order
[2024-05-29 14:28:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:28:14] [INFO ] Removed a total of 600 redundant transitions.
[2024-05-29 14:28:14] [INFO ] Flatten gal took : 91 ms
[2024-05-29 14:28:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 598 labels/synchronizations in 15 ms.
[2024-05-29 14:28:14] [INFO ] Time to serialize gal into /tmp/LTL12648956645776406790.gal : 21 ms
[2024-05-29 14:28:14] [INFO ] Time to serialize properties into /tmp/LTL11288331991494276095.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12648956645776406790.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11288331991494276095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G((F("((i11.i0.i2.u209.p2095==0)||(i10.i0.i0.u187.p1886==1))"))U("((i18.i1.i0.u344.p3409==0)||(i38.i1.i0.u704.p6847==1))")))||(G((...285
Formula 0 simplified : F(G!"((i11.i0.i2.u209.p2095==0)||(i10.i0.i0.u187.p1886==1))" R !"((i18.i1.i0.u344.p3409==0)||(i38.i1.i0.u704.p6847==1))") & F(G!"((i...270
Reverse transition relation is NOT exact ! Due to transitions i11.i0.i2.u209.t303.t719, i11.i0.i2.u209.t303.t720, Intersection with reachable at each step...215
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16457591337718169620
[2024-05-29 14:28:29] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16457591337718169620
Running compilation step : cd /tmp/ltsmin16457591337718169620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16457591337718169620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16457591337718169620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-08 finished in 153550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 3 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1399 transitions
Trivial Post-agglo rules discarded 1399 transitions
Performed 1399 trivial Post agglomeration. Transition count delta: 1399
Iterating post reduction 0 with 1399 rules applied. Total rules applied 1399 place count 6703 transition count 4604
Reduce places removed 1399 places and 0 transitions.
Iterating post reduction 1 with 1399 rules applied. Total rules applied 2798 place count 5304 transition count 4604
Performed 798 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 798 Pre rules applied. Total rules applied 2798 place count 5304 transition count 3806
Deduced a syphon composed of 798 places in 12 ms
Reduce places removed 798 places and 0 transitions.
Iterating global reduction 2 with 1596 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4396 place count 4504 transition count 3804
Iterating global reduction 2 with 2 rules applied. Total rules applied 4398 place count 4504 transition count 3804
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4398 place count 4504 transition count 3802
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 4402 place count 4502 transition count 3802
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 2 with 3394 rules applied. Total rules applied 7796 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7797 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7799 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8001 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8203 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 8397 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8399 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8400 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8400 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8404 place count 2500 transition count 2099
Applied a total of 8404 rules in 1824 ms. Remains 2500 /6704 variables (removed 4204) and now considering 2099/6004 (removed 3905) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2024-05-29 14:28:34] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:28:36] [INFO ] Implicit Places using invariants in 1851 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1853 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6704 places, 2099/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 158 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:28:36] [INFO ] Computed 1098 invariants in 4 ms
[2024-05-29 14:28:38] [INFO ] Implicit Places using invariants in 1825 ms returned []
[2024-05-29 14:28:38] [INFO ] Invariant cache hit.
[2024-05-29 14:28:41] [INFO ] Implicit Places using invariants and state equation in 3782 ms returned []
Implicit Place search using SMT with State Equation took 5609 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6704 places, 2097/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9445 ms. Remains : 2496/6704 places, 2097/6004 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s310 1), p1:(AND (NEQ s1615 0) (NEQ s1551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1191 ms.
Product exploration explored 100000 steps with 0 reset in 1609 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82050 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82050 steps, saw 62055 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:28:48] [INFO ] Invariant cache hit.
[2024-05-29 14:28:48] [INFO ] [Real]Absence check using 1098 positive place invariants in 206 ms returned sat
[2024-05-29 14:28:48] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:28:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 209 ms returned sat
[2024-05-29 14:28:50] [INFO ] After 1115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:28:50] [INFO ] After 1355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-29 14:28:51] [INFO ] After 2097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 85 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 93822 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93822 steps, saw 71294 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:28:54] [INFO ] Invariant cache hit.
[2024-05-29 14:28:55] [INFO ] [Real]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:28:55] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:28:55] [INFO ] [Nat]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:28:56] [INFO ] After 1188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:28:57] [INFO ] After 1430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-29 14:28:57] [INFO ] After 2184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 84 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 79 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:28:57] [INFO ] Invariant cache hit.
[2024-05-29 14:28:59] [INFO ] Implicit Places using invariants in 1827 ms returned []
[2024-05-29 14:28:59] [INFO ] Invariant cache hit.
[2024-05-29 14:29:03] [INFO ] Implicit Places using invariants and state equation in 3738 ms returned []
Implicit Place search using SMT with State Equation took 5573 ms to find 0 implicit places.
[2024-05-29 14:29:03] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-29 14:29:03] [INFO ] Invariant cache hit.
[2024-05-29 14:29:04] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7280 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2097
Applied a total of 593 rules in 189 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:29:04] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:29:05] [INFO ] [Real]Absence check using 1098 positive place invariants in 203 ms returned sat
[2024-05-29 14:29:05] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:06] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:29:07] [INFO ] After 1213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:07] [INFO ] After 1468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-05-29 14:29:07] [INFO ] After 2213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:29:08] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-29 14:29:09] [INFO ] Implicit Places using invariants in 1616 ms returned []
[2024-05-29 14:29:09] [INFO ] Invariant cache hit.
[2024-05-29 14:29:13] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 5344 ms to find 0 implicit places.
[2024-05-29 14:29:13] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:29:13] [INFO ] Invariant cache hit.
[2024-05-29 14:29:14] [INFO ] Dead Transitions using invariants and state equation in 1541 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7014 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 91929 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91929 steps, saw 69749 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:29:18] [INFO ] Invariant cache hit.
[2024-05-29 14:29:19] [INFO ] [Real]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:29:19] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 213 ms returned sat
[2024-05-29 14:29:20] [INFO ] After 1185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:21] [INFO ] After 1424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-29 14:29:21] [INFO ] After 2185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 66 ms.
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 87 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 92213 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92213 steps, saw 69963 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 14:29:24] [INFO ] Invariant cache hit.
[2024-05-29 14:29:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 238 ms returned sat
[2024-05-29 14:29:25] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:25] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:29:27] [INFO ] After 1171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:27] [INFO ] After 1411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2024-05-29 14:29:27] [INFO ] After 2181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 81 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 76 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:29:27] [INFO ] Invariant cache hit.
[2024-05-29 14:29:29] [INFO ] Implicit Places using invariants in 1730 ms returned []
[2024-05-29 14:29:29] [INFO ] Invariant cache hit.
[2024-05-29 14:29:33] [INFO ] Implicit Places using invariants and state equation in 3677 ms returned []
Implicit Place search using SMT with State Equation took 5410 ms to find 0 implicit places.
[2024-05-29 14:29:33] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 14:29:33] [INFO ] Invariant cache hit.
[2024-05-29 14:29:34] [INFO ] Dead Transitions using invariants and state equation in 1525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7059 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2097
Applied a total of 593 rules in 185 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:29:34] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:29:35] [INFO ] [Real]Absence check using 1098 positive place invariants in 209 ms returned sat
[2024-05-29 14:29:35] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 14:29:36] [INFO ] [Nat]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:29:37] [INFO ] After 1180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 14:29:37] [INFO ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-05-29 14:29:37] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1198 ms.
Product exploration explored 100000 steps with 0 reset in 1619 ms.
Built C files in :
/tmp/ltsmin16125889888316483662
[2024-05-29 14:29:40] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:29:40] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16125889888316483662
Running compilation step : cd /tmp/ltsmin16125889888316483662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16125889888316483662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16125889888316483662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:29:43] [INFO ] Computed 1098 invariants in 10 ms
[2024-05-29 14:29:45] [INFO ] Implicit Places using invariants in 1792 ms returned []
[2024-05-29 14:29:45] [INFO ] Invariant cache hit.
[2024-05-29 14:29:49] [INFO ] Implicit Places using invariants and state equation in 3714 ms returned []
Implicit Place search using SMT with State Equation took 5507 ms to find 0 implicit places.
[2024-05-29 14:29:49] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 14:29:49] [INFO ] Invariant cache hit.
[2024-05-29 14:29:51] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7159 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Built C files in :
/tmp/ltsmin11088351529796382031
[2024-05-29 14:29:51] [INFO ] Too many transitions (2097) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:29:51] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11088351529796382031
Running compilation step : cd /tmp/ltsmin11088351529796382031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11088351529796382031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11088351529796382031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:29:54] [INFO ] Flatten gal took : 46 ms
[2024-05-29 14:29:54] [INFO ] Flatten gal took : 46 ms
[2024-05-29 14:29:54] [INFO ] Time to serialize gal into /tmp/LTL15487509800874001300.gal : 9 ms
[2024-05-29 14:29:54] [INFO ] Time to serialize properties into /tmp/LTL9371679697004454935.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15487509800874001300.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16989845742236489923.hoa' '-atoms' '/tmp/LTL9371679697004454935.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9371679697004454935.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16989845742236489923.hoa
Detected timeout of ITS tools.
[2024-05-29 14:30:09] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:30:09] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:30:09] [INFO ] Time to serialize gal into /tmp/LTL16428667254453620651.gal : 8 ms
[2024-05-29 14:30:09] [INFO ] Time to serialize properties into /tmp/LTL11548730344039393997.ltl : 56 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16428667254453620651.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11548730344039393997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("(p1047!=1)")||(F("((p5054!=0)&&(p4863!=1))")))))
Formula 0 simplified : F(!"(p1047!=1)" & G!"((p5054!=0)&&(p4863!=1))")
Detected timeout of ITS tools.
[2024-05-29 14:30:24] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:30:24] [INFO ] Applying decomposition
[2024-05-29 14:30:24] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4025736366677526928.txt' '-o' '/tmp/graph4025736366677526928.bin' '-w' '/tmp/graph4025736366677526928.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4025736366677526928.bin' '-l' '-1' '-v' '-w' '/tmp/graph4025736366677526928.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:30:24] [INFO ] Decomposing Gal with order
[2024-05-29 14:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:30:25] [INFO ] Removed a total of 614 redundant transitions.
[2024-05-29 14:30:25] [INFO ] Flatten gal took : 85 ms
[2024-05-29 14:30:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 21 ms.
[2024-05-29 14:30:25] [INFO ] Time to serialize gal into /tmp/LTL7805760851461923853.gal : 21 ms
[2024-05-29 14:30:25] [INFO ] Time to serialize properties into /tmp/LTL11302457070092605900.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7805760851461923853.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11302457070092605900.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(i5.i0.i0.u102.p1047!=1)")||(F("((i27.i0.i2.u521.p5054!=0)&&(i25.i1.i1.u498.p4863!=1))")))))
Formula 0 simplified : F(!"(i5.i0.i0.u102.p1047!=1)" & G!"((i27.i0.i2.u521.p5054!=0)&&(i25.i1.i1.u498.p4863!=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15514489997161368565
[2024-05-29 14:30:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15514489997161368565
Running compilation step : cd /tmp/ltsmin15514489997161368565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15514489997161368565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15514489997161368565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-10 finished in 130891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1398 transitions
Trivial Post-agglo rules discarded 1398 transitions
Performed 1398 trivial Post agglomeration. Transition count delta: 1398
Iterating post reduction 0 with 1398 rules applied. Total rules applied 1398 place count 6703 transition count 4605
Reduce places removed 1398 places and 0 transitions.
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2796 place count 5305 transition count 4605
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 799 Pre rules applied. Total rules applied 2796 place count 5305 transition count 3806
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 2 with 1598 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4396 place count 4504 transition count 3804
Iterating global reduction 2 with 2 rules applied. Total rules applied 4398 place count 4504 transition count 3804
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4398 place count 4504 transition count 3802
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 4402 place count 4502 transition count 3802
Performed 1698 Post agglomeration using F-continuation condition.Transition count delta: 1698
Deduced a syphon composed of 1698 places in 4 ms
Reduce places removed 1698 places and 0 transitions.
Iterating global reduction 2 with 3396 rules applied. Total rules applied 7798 place count 2804 transition count 2104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2804 transition count 2103
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7801 place count 2803 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8003 place count 2702 transition count 2102
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8205 place count 2601 transition count 2102
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 8397 place count 2505 transition count 2102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8399 place count 2503 transition count 2100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8400 place count 2502 transition count 2100
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 8400 place count 2502 transition count 2098
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8404 place count 2500 transition count 2098
Applied a total of 8404 rules in 1872 ms. Remains 2500 /6704 variables (removed 4204) and now considering 2098/6004 (removed 3906) transitions.
// Phase 1: matrix 2098 rows 2500 cols
[2024-05-29 14:30:45] [INFO ] Computed 1100 invariants in 13 ms
[2024-05-29 14:30:46] [INFO ] Implicit Places using invariants in 1856 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1858 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6704 places, 2098/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2096
Applied a total of 4 rules in 149 ms. Remains 2496 /2498 variables (removed 2) and now considering 2096/2098 (removed 2) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2024-05-29 14:30:47] [INFO ] Computed 1098 invariants in 5 ms
[2024-05-29 14:30:48] [INFO ] Implicit Places using invariants in 1870 ms returned []
[2024-05-29 14:30:48] [INFO ] Invariant cache hit.
[2024-05-29 14:30:52] [INFO ] Implicit Places using invariants and state equation in 3742 ms returned []
Implicit Place search using SMT with State Equation took 5614 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6704 places, 2096/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9494 ms. Remains : 2496/6704 places, 2096/6004 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1697 0) (EQ s1893 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1187 ms.
Product exploration explored 100000 steps with 0 reset in 1620 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102528 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102528 steps, saw 77568 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:30:59] [INFO ] Invariant cache hit.
[2024-05-29 14:30:59] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:30:59] [INFO ] [Nat]Absence check using 1098 positive place invariants in 209 ms returned sat
[2024-05-29 14:31:00] [INFO ] After 1108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:01] [INFO ] After 1229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 14:31:01] [INFO ] After 1835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 88 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103642 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103642 steps, saw 78410 distinct states, run finished after 3003 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:31:04] [INFO ] Invariant cache hit.
[2024-05-29 14:31:04] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:05] [INFO ] [Nat]Absence check using 1098 positive place invariants in 210 ms returned sat
[2024-05-29 14:31:06] [INFO ] After 1119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:06] [INFO ] After 1243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:31:06] [INFO ] After 1860ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 75 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 80 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2024-05-29 14:31:06] [INFO ] Invariant cache hit.
[2024-05-29 14:31:08] [INFO ] Implicit Places using invariants in 1915 ms returned []
[2024-05-29 14:31:08] [INFO ] Invariant cache hit.
[2024-05-29 14:31:12] [INFO ] Implicit Places using invariants and state equation in 3971 ms returned []
Implicit Place search using SMT with State Equation took 5901 ms to find 0 implicit places.
[2024-05-29 14:31:12] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 14:31:12] [INFO ] Invariant cache hit.
[2024-05-29 14:31:14] [INFO ] Dead Transitions using invariants and state equation in 1536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7557 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 202 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2024-05-29 14:31:14] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:31:14] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:31:16] [INFO ] After 1134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:16] [INFO ] After 1255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:31:16] [INFO ] After 1873ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 86 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2024-05-29 14:31:17] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:31:18] [INFO ] Implicit Places using invariants in 1836 ms returned []
[2024-05-29 14:31:18] [INFO ] Invariant cache hit.
[2024-05-29 14:31:22] [INFO ] Implicit Places using invariants and state equation in 3708 ms returned []
Implicit Place search using SMT with State Equation took 5545 ms to find 0 implicit places.
[2024-05-29 14:31:22] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:31:22] [INFO ] Invariant cache hit.
[2024-05-29 14:31:24] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7199 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 102020 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 102020 steps, saw 77178 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:31:27] [INFO ] Invariant cache hit.
[2024-05-29 14:31:27] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:28] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:31:29] [INFO ] After 1120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:29] [INFO ] After 1245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 14:31:29] [INFO ] After 1858ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 106 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101122 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101122 steps, saw 76470 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:31:33] [INFO ] Invariant cache hit.
[2024-05-29 14:31:33] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:33] [INFO ] [Nat]Absence check using 1098 positive place invariants in 223 ms returned sat
[2024-05-29 14:31:35] [INFO ] After 1194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:35] [INFO ] After 1318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 14:31:35] [INFO ] After 1964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 104 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 80 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2024-05-29 14:31:35] [INFO ] Invariant cache hit.
[2024-05-29 14:31:37] [INFO ] Implicit Places using invariants in 1824 ms returned []
[2024-05-29 14:31:37] [INFO ] Invariant cache hit.
[2024-05-29 14:31:41] [INFO ] Implicit Places using invariants and state equation in 3704 ms returned []
Implicit Place search using SMT with State Equation took 5530 ms to find 0 implicit places.
[2024-05-29 14:31:41] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 14:31:41] [INFO ] Invariant cache hit.
[2024-05-29 14:31:42] [INFO ] Dead Transitions using invariants and state equation in 1567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7224 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Partial Free-agglomeration rule applied 593 times.
Drop transitions removed 593 transitions
Iterating global reduction 0 with 593 rules applied. Total rules applied 593 place count 2496 transition count 2096
Applied a total of 593 rules in 204 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2096 rows 2496 cols
[2024-05-29 14:31:42] [INFO ] Computed 1098 invariants in 11 ms
[2024-05-29 14:31:43] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:31:43] [INFO ] [Nat]Absence check using 1098 positive place invariants in 211 ms returned sat
[2024-05-29 14:31:44] [INFO ] After 1096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:31:44] [INFO ] After 1222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:31:45] [INFO ] After 1829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 1200 ms.
Product exploration explored 100000 steps with 0 reset in 1638 ms.
Built C files in :
/tmp/ltsmin9621496866593555028
[2024-05-29 14:31:48] [INFO ] Too many transitions (2096) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:31:48] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9621496866593555028
Running compilation step : cd /tmp/ltsmin9621496866593555028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9621496866593555028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9621496866593555028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2096/2096 transitions.
Applied a total of 0 rules in 84 ms. Remains 2496 /2496 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
// Phase 1: matrix 2096 rows 2496 cols
[2024-05-29 14:31:51] [INFO ] Computed 1098 invariants in 3 ms
[2024-05-29 14:31:53] [INFO ] Implicit Places using invariants in 1814 ms returned []
[2024-05-29 14:31:53] [INFO ] Invariant cache hit.
[2024-05-29 14:31:56] [INFO ] Implicit Places using invariants and state equation in 3702 ms returned []
Implicit Place search using SMT with State Equation took 5517 ms to find 0 implicit places.
[2024-05-29 14:31:56] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-29 14:31:56] [INFO ] Invariant cache hit.
[2024-05-29 14:31:58] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7117 ms. Remains : 2496/2496 places, 2096/2096 transitions.
Built C files in :
/tmp/ltsmin1277339521022289383
[2024-05-29 14:31:58] [INFO ] Too many transitions (2096) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:31:58] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1277339521022289383
Running compilation step : cd /tmp/ltsmin1277339521022289383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1277339521022289383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1277339521022289383;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 14:32:01] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:32:01] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:32:01] [INFO ] Time to serialize gal into /tmp/LTL11246435365310152456.gal : 18 ms
[2024-05-29 14:32:01] [INFO ] Time to serialize properties into /tmp/LTL17705227910393773230.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11246435365310152456.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13635666506044678082.hoa' '-atoms' '/tmp/LTL17705227910393773230.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17705227910393773230.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13635666506044678082.hoa
Detected timeout of ITS tools.
[2024-05-29 14:32:16] [INFO ] Flatten gal took : 47 ms
[2024-05-29 14:32:16] [INFO ] Flatten gal took : 48 ms
[2024-05-29 14:32:16] [INFO ] Time to serialize gal into /tmp/LTL2201984383789018323.gal : 8 ms
[2024-05-29 14:32:16] [INFO ] Time to serialize properties into /tmp/LTL10482936342676298788.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2201984383789018323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10482936342676298788.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p5299==0)||(p5906==1))"))))
Formula 0 simplified : FG!"((p5299==0)||(p5906==1))"
Detected timeout of ITS tools.
[2024-05-29 14:32:31] [INFO ] Flatten gal took : 49 ms
[2024-05-29 14:32:31] [INFO ] Applying decomposition
[2024-05-29 14:32:31] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11564878897508087158.txt' '-o' '/tmp/graph11564878897508087158.bin' '-w' '/tmp/graph11564878897508087158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11564878897508087158.bin' '-l' '-1' '-v' '-w' '/tmp/graph11564878897508087158.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:32:32] [INFO ] Decomposing Gal with order
[2024-05-29 14:32:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:32:32] [INFO ] Removed a total of 608 redundant transitions.
[2024-05-29 14:32:32] [INFO ] Flatten gal took : 76 ms
[2024-05-29 14:32:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 11 ms.
[2024-05-29 14:32:32] [INFO ] Time to serialize gal into /tmp/LTL2913068867864181413.gal : 18 ms
[2024-05-29 14:32:32] [INFO ] Time to serialize properties into /tmp/LTL14572850343769014930.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2913068867864181413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14572850343769014930.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i30.i1.i1.u545.p5299==0)||(i33.i1.i1.u608.p5906==1))"))))
Formula 0 simplified : FG!"((i30.i1.i1.u545.p5299==0)||(i33.i1.i1.u608.p5906==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.87656e+166 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1252 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8035,203564,1,0,312902,349,5791,731737,221,1940,361965
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-100B-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-12 finished in 122918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 6704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6704/6704 places, 6004/6004 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1397 transitions
Trivial Post-agglo rules discarded 1397 transitions
Performed 1397 trivial Post agglomeration. Transition count delta: 1397
Iterating post reduction 0 with 1397 rules applied. Total rules applied 1397 place count 6703 transition count 4606
Reduce places removed 1397 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1398 rules applied. Total rules applied 2795 place count 5306 transition count 4605
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2796 place count 5305 transition count 4605
Performed 799 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 799 Pre rules applied. Total rules applied 2796 place count 5305 transition count 3806
Deduced a syphon composed of 799 places in 11 ms
Reduce places removed 799 places and 0 transitions.
Iterating global reduction 3 with 1598 rules applied. Total rules applied 4394 place count 4506 transition count 3806
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 4396 place count 4504 transition count 3804
Iterating global reduction 3 with 2 rules applied. Total rules applied 4398 place count 4504 transition count 3804
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4398 place count 4504 transition count 3802
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4402 place count 4502 transition count 3802
Performed 1697 Post agglomeration using F-continuation condition.Transition count delta: 1697
Deduced a syphon composed of 1697 places in 4 ms
Reduce places removed 1697 places and 0 transitions.
Iterating global reduction 3 with 3394 rules applied. Total rules applied 7796 place count 2805 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7797 place count 2805 transition count 2104
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 7799 place count 2804 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8001 place count 2703 transition count 2103
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 8203 place count 2602 transition count 2103
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 4 with 194 rules applied. Total rules applied 8397 place count 2505 transition count 2103
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 8399 place count 2503 transition count 2101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8400 place count 2502 transition count 2101
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 8400 place count 2502 transition count 2099
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 8404 place count 2500 transition count 2099
Applied a total of 8404 rules in 1888 ms. Remains 2500 /6704 variables (removed 4204) and now considering 2099/6004 (removed 3905) transitions.
// Phase 1: matrix 2099 rows 2500 cols
[2024-05-29 14:32:48] [INFO ] Computed 1100 invariants in 8 ms
[2024-05-29 14:32:49] [INFO ] Implicit Places using invariants in 1822 ms returned [2483, 2487]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1825 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2498/6704 places, 2099/6004 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2496 transition count 2097
Applied a total of 4 rules in 168 ms. Remains 2496 /2498 variables (removed 2) and now considering 2097/2099 (removed 2) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:32:50] [INFO ] Computed 1098 invariants in 3 ms
[2024-05-29 14:32:51] [INFO ] Implicit Places using invariants in 1694 ms returned []
[2024-05-29 14:32:51] [INFO ] Invariant cache hit.
[2024-05-29 14:32:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:32:55] [INFO ] Implicit Places using invariants and state equation in 3855 ms returned []
Implicit Place search using SMT with State Equation took 5554 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2496/6704 places, 2097/6004 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9435 ms. Remains : 2496/6704 places, 2097/6004 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-100B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s1707 0) (EQ s1174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1206 ms.
Product exploration explored 100000 steps with 0 reset in 1716 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97369 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97369 steps, saw 73816 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:33:01] [INFO ] Invariant cache hit.
[2024-05-29 14:33:02] [INFO ] After 311ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:02] [INFO ] [Nat]Absence check using 1098 positive place invariants in 214 ms returned sat
[2024-05-29 14:33:03] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:33:04] [INFO ] After 74ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:04] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:33:04] [INFO ] After 1958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2496 transition count 2097
Applied a total of 3 rules in 206 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 100172 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100172 steps, saw 75702 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:33:07] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:33:08] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:08] [INFO ] [Nat]Absence check using 1098 positive place invariants in 216 ms returned sat
[2024-05-29 14:33:09] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:33:09] [INFO ] After 76ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:09] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-29 14:33:09] [INFO ] After 1965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 78 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 78 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
[2024-05-29 14:33:10] [INFO ] Invariant cache hit.
[2024-05-29 14:33:12] [INFO ] Implicit Places using invariants in 1932 ms returned []
[2024-05-29 14:33:12] [INFO ] Invariant cache hit.
[2024-05-29 14:33:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:33:16] [INFO ] Implicit Places using invariants and state equation in 3958 ms returned []
Implicit Place search using SMT with State Equation took 5892 ms to find 0 implicit places.
[2024-05-29 14:33:16] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-29 14:33:16] [INFO ] Invariant cache hit.
[2024-05-29 14:33:17] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7577 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 597 times.
Drop transitions removed 597 transitions
Iterating global reduction 0 with 597 rules applied. Total rules applied 597 place count 2496 transition count 2097
Applied a total of 597 rules in 198 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:33:17] [INFO ] Computed 1098 invariants in 9 ms
[2024-05-29 14:33:18] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 212 ms returned sat
[2024-05-29 14:33:19] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 14:33:19] [INFO ] After 77ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:20] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 14:33:20] [INFO ] After 1956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Applied a total of 0 rules in 82 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:33:20] [INFO ] Computed 1098 invariants in 4 ms
[2024-05-29 14:33:22] [INFO ] Implicit Places using invariants in 1890 ms returned []
[2024-05-29 14:33:22] [INFO ] Invariant cache hit.
[2024-05-29 14:33:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:33:26] [INFO ] Implicit Places using invariants and state equation in 3976 ms returned []
Implicit Place search using SMT with State Equation took 5867 ms to find 0 implicit places.
[2024-05-29 14:33:26] [INFO ] Redundant transitions in 39 ms returned []
[2024-05-29 14:33:26] [INFO ] Invariant cache hit.
[2024-05-29 14:33:27] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7556 ms. Remains : 2496/2496 places, 2097/2097 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101951 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101951 steps, saw 77101 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 14:33:31] [INFO ] Invariant cache hit.
[2024-05-29 14:33:31] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:32] [INFO ] [Nat]Absence check using 1098 positive place invariants in 205 ms returned sat
[2024-05-29 14:33:33] [INFO ] After 1095ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:33:33] [INFO ] After 75ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:33] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-29 14:33:33] [INFO ] After 1900ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 2097/2097 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2496 transition count 2097
Applied a total of 3 rules in 178 ms. Remains 2496 /2496 variables (removed 0) and now considering 2097/2097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 2496/2496 places, 2097/2097 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 104295 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 104295 steps, saw 78844 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2496 cols
[2024-05-29 14:33:36] [INFO ] Computed 1098 invariants in 6 ms
[2024-05-29 14:33:37] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 14:33:37] [INFO ] [Nat]Absence check using 1098 positive place invariants in 204 ms returned sat
[2024-05-29 14:33:38] [INFO ] After 1139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 14:33:38] [INFO ] After 74ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 14:33:39] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-29 14:33:39] [INFO ] After 1926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1485 steps, including 101 resets, run visited all 1 properties in 21 ms. (steps per millisecond=70 )
Parikh walk visited 1 properties in 20 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-100B-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100B-LTLCardinality-13 finished in 53084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0) U p1))||G((F(p1)&&F(G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
[2024-05-29 14:33:39] [INFO ] Flatten gal took : 124 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10268113456391596234
[2024-05-29 14:33:39] [INFO ] Too many transitions (6004) to apply POR reductions. Disabling POR matrices.
[2024-05-29 14:33:39] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10268113456391596234
Running compilation step : cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 14:33:39] [INFO ] Applying decomposition
[2024-05-29 14:33:40] [INFO ] Flatten gal took : 135 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14928767732169605738.txt' '-o' '/tmp/graph14928767732169605738.bin' '-w' '/tmp/graph14928767732169605738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14928767732169605738.bin' '-l' '-1' '-v' '-w' '/tmp/graph14928767732169605738.weights' '-q' '0' '-e' '0.001'
[2024-05-29 14:33:40] [INFO ] Decomposing Gal with order
[2024-05-29 14:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:33:42] [INFO ] Removed a total of 993 redundant transitions.
[2024-05-29 14:33:42] [INFO ] Flatten gal took : 245 ms
[2024-05-29 14:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 14:33:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality6698069376104719643.gal : 34 ms
[2024-05-29 14:33:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality8438551532861467706.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6698069376104719643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8438551532861467706.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((F(G(("(((i14.u427.p1346==0)||(i17.u524.p1664==1))||((i61.u2073.p6718==0)||(i54.u1818.p5895==1)))")||(F("((i61.u2073.p6718==0)||(i54...179
Formula 0 simplified : G(F!"(((i14.u427.p1346==0)||(i17.u524.p1664==1))||((i61.u2073.p6718==0)||(i54.u1818.p5895==1)))" & FG!"((i61.u2073.p6718==0)||(i54.u...172
Compilation finished in 24483 ms.
Running link step : cd /tmp/ltsmin10268113456391596234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp2==true)))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-29 14:58:35] [INFO ] Applying decomposition
[2024-05-29 14:58:37] [INFO ] Flatten gal took : 1421 ms
[2024-05-29 14:58:40] [INFO ] Decomposing Gal with order
[2024-05-29 14:58:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 14:58:52] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-29 14:58:52] [INFO ] Flatten gal took : 539 ms
[2024-05-29 14:58:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1192 labels/synchronizations in 225 ms.
[2024-05-29 14:58:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality14657068534792925123.gal : 1155 ms
[2024-05-29 14:58:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality13168114524286212255.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14657068534792925123.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13168114524286212255.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((F(G(("(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...969
Formula 0 simplified : G(F!"(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...962
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](<>((LTLAPp2==true)))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp4==true)) U (LTLAPp5==true)))||[]((<>((LTLAPp5==true))&&<>([]((LTLAPp6==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((<>((LTLAPp4==true)) U (LTLAPp5==true)))||[]((<>((LTLAPp5==true))&&<>([]((LTLAPp6==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10268113456391596234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp7==true)||<>((LTLAPp8==true))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4264416 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15588756 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789300437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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