Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689600628.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BART-PT-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689600628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 2.4M Apr 29 23:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.8M Apr 29 23:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 29 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.2M Apr 29 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 889K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 884K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 184K May 9 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 7.1M May 10 09:33 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 BART-PT-030-LTLFireability-00
FORMULA_NAME BART-PT-030-LTLFireability-01
FORMULA_NAME BART-PT-030-LTLFireability-02
FORMULA_NAME BART-PT-030-LTLFireability-03
FORMULA_NAME BART-PT-030-LTLFireability-04
FORMULA_NAME BART-PT-030-LTLFireability-05
FORMULA_NAME BART-PT-030-LTLFireability-06
FORMULA_NAME BART-PT-030-LTLFireability-07
FORMULA_NAME BART-PT-030-LTLFireability-08
FORMULA_NAME BART-PT-030-LTLFireability-09
FORMULA_NAME BART-PT-030-LTLFireability-10
FORMULA_NAME BART-PT-030-LTLFireability-11
FORMULA_NAME BART-PT-030-LTLFireability-12
FORMULA_NAME BART-PT-030-LTLFireability-13
FORMULA_NAME BART-PT-030-LTLFireability-14
FORMULA_NAME BART-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652667910857

Running Version 202205111006
[2022-05-16 02:25:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 02:25:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:25:13] [INFO ] Load time of PNML (sax parser for PT used): 559 ms
[2022-05-16 02:25:13] [INFO ] Transformed 4170 places.
[2022-05-16 02:25:13] [INFO ] Transformed 6060 transitions.
[2022-05-16 02:25:13] [INFO ] Found NUPN structural information;
[2022-05-16 02:25:13] [INFO ] Parsed PT model containing 4170 places and 6060 transitions in 742 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 92 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-030-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3960 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 51 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:25:13] [INFO ] Computed 30 place invariants in 111 ms
[2022-05-16 02:25:15] [INFO ] Implicit Places using invariants in 1352 ms returned []
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:25:15] [INFO ] Computed 30 place invariants in 45 ms
[2022-05-16 02:25:16] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 2396 ms to find 0 implicit places.
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:25:16] [INFO ] Computed 30 place invariants in 25 ms
[2022-05-16 02:25:16] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3960/3960 places, 6060/6060 transitions.
Support contains 3960 out of 3960 places after structural reductions.
[2022-05-16 02:25:17] [INFO ] Flatten gal took : 447 ms
[2022-05-16 02:25:18] [INFO ] Flatten gal took : 302 ms
[2022-05-16 02:25:19] [INFO ] Input system was already deterministic with 6060 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 27) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:25:20] [INFO ] Computed 30 place invariants in 24 ms
[2022-05-16 02:25:21] [INFO ] [Real]Absence check using 30 positive place invariants in 57 ms returned sat
[2022-05-16 02:25:24] [INFO ] After 3282ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-16 02:25:25] [INFO ] After 3832ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 246 ms.
[2022-05-16 02:25:25] [INFO ] After 5036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 227 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 27 ms.
FORMULA BART-PT-030-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-030-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G(F(G(!p0))))) U X(p0))))'
Support contains 270 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 690 places :
Symmetric choice reduction at 0 with 690 rule applications. Total rules 690 place count 3270 transition count 5370
Iterating global reduction 0 with 690 rules applied. Total rules applied 1380 place count 3270 transition count 5370
Discarding 570 places :
Symmetric choice reduction at 0 with 570 rule applications. Total rules 1950 place count 2700 transition count 4800
Iterating global reduction 0 with 570 rules applied. Total rules applied 2520 place count 2700 transition count 4800
Applied a total of 2520 rules in 1211 ms. Remains 2700 /3960 variables (removed 1260) and now considering 4800/6060 (removed 1260) transitions.
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:27] [INFO ] Computed 30 place invariants in 62 ms
[2022-05-16 02:25:27] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:27] [INFO ] Computed 30 place invariants in 18 ms
[2022-05-16 02:25:28] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:28] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:25:31] [INFO ] Dead Transitions using invariants and state equation in 3063 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2700/3960 places, 4800/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 2700/3960 places, 4800/6060 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Running random walk in product with property : BART-PT-030-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s166 1) (EQ s361 1) (EQ s464 1) (EQ s567 1) (EQ s826 1) (EQ s1002 1) (EQ s731 1) (EQ s907 1) (EQ s218 1) (EQ s232 1) (EQ s152 1) (EQ s812 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1020 ms.
Product exploration explored 100000 steps with 0 reset in 1326 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:36] [INFO ] Computed 30 place invariants in 34 ms
[2022-05-16 02:25:42] [INFO ] [Real]Absence check using 30 positive place invariants in 92 ms returned sat
[2022-05-16 02:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-16 02:25:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 270 out of 2700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2700/2700 places, 4800/4800 transitions.
Applied a total of 0 rules in 243 ms. Remains 2700 /2700 variables (removed 0) and now considering 4800/4800 (removed 0) transitions.
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:51] [INFO ] Computed 30 place invariants in 33 ms
[2022-05-16 02:25:52] [INFO ] Implicit Places using invariants in 509 ms returned []
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:52] [INFO ] Computed 30 place invariants in 26 ms
[2022-05-16 02:25:54] [INFO ] Implicit Places using invariants and state equation in 2801 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:55] [INFO ] Computed 30 place invariants in 30 ms
[2022-05-16 02:25:57] [INFO ] Dead Transitions using invariants and state equation in 2462 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2700/2700 places, 4800/4800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
// Phase 1: matrix 4800 rows 2700 cols
[2022-05-16 02:25:58] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:26:04] [INFO ] [Real]Absence check using 30 positive place invariants in 47 ms returned sat
[2022-05-16 02:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:26:11] [INFO ] [Real]Absence check using state equation in 6966 ms returned sat
[2022-05-16 02:26:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:26:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 92 ms returned sat
[2022-05-16 02:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:26:22] [INFO ] [Nat]Absence check using state equation in 4659 ms returned sat
[2022-05-16 02:26:23] [INFO ] Computed and/alt/rep : 3720/6840/3720 causal constraints (skipped 0 transitions) in 260 ms.
[2022-05-16 02:26:28] [INFO ] Deduced a trap composed of 90 places in 1928 ms of which 5 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-16 02:26:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Product exploration explored 100000 steps with 0 reset in 940 ms.
Product exploration explored 100000 steps with 0 reset in 1082 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), p0]
Support contains 270 out of 2700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2700/2700 places, 4800/4800 transitions.
Graph (trivial) has 4230 edges and 2700 vertex of which 1230 / 2700 are part of one of the 30 SCC in 10 ms
Free SCC test removed 1200 places
Ensure Unique test removed 2250 transitions
Reduce isomorphic transitions removed 2250 transitions.
Performed 300 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 300 rules applied. Total rules applied 301 place count 1500 transition count 2550
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 571 place count 1500 transition count 2280
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 571 place count 1500 transition count 2280
Deduced a syphon composed of 420 places in 0 ms
Iterating global reduction 2 with 120 rules applied. Total rules applied 691 place count 1500 transition count 2280
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 721 place count 1470 transition count 2250
Deduced a syphon composed of 390 places in 1 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 751 place count 1470 transition count 2250
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 900 places in 1 ms
Iterating global reduction 2 with 510 rules applied. Total rules applied 1261 place count 1470 transition count 2250
Ensure Unique test removed 480 transitions
Reduce isomorphic transitions removed 480 transitions.
Iterating post reduction 2 with 480 rules applied. Total rules applied 1741 place count 1470 transition count 1770
Discarding 510 places :
Symmetric choice reduction at 3 with 510 rule applications. Total rules 2251 place count 960 transition count 1260
Deduced a syphon composed of 390 places in 0 ms
Iterating global reduction 3 with 510 rules applied. Total rules applied 2761 place count 960 transition count 1260
Deduced a syphon composed of 390 places in 0 ms
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 2791 place count 960 transition count 1230
Deduced a syphon composed of 390 places in 0 ms
Applied a total of 2791 rules in 1027 ms. Remains 960 /2700 variables (removed 1740) and now considering 1230/4800 (removed 3570) transitions.
[2022-05-16 02:26:32] [INFO ] Redundant transitions in 112 ms returned []
[2022-05-16 02:26:32] [INFO ] Flow matrix only has 1201 transitions (discarded 29 similar events)
// Phase 1: matrix 1201 rows 960 cols
[2022-05-16 02:26:32] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-16 02:26:33] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 960/2700 places, 1230/4800 transitions.
Finished structural reductions, in 1 iterations. Remains : 960/2700 places, 1230/4800 transitions.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 8 ms.
FORMULA BART-PT-030-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-00 finished in 67583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(F(p0)))||!(p1 U G(p2))))))'
Support contains 300 out of 3960 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Performed 690 Post agglomeration using F-continuation condition.Transition count delta: 690
Iterating post reduction 0 with 690 rules applied. Total rules applied 690 place count 3960 transition count 5370
Reduce places removed 690 places and 0 transitions.
Iterating post reduction 1 with 690 rules applied. Total rules applied 1380 place count 3270 transition count 5370
Applied a total of 1380 rules in 300 ms. Remains 3270 /3960 variables (removed 690) and now considering 5370/6060 (removed 690) transitions.
// Phase 1: matrix 5370 rows 3270 cols
[2022-05-16 02:26:33] [INFO ] Computed 30 place invariants in 25 ms
[2022-05-16 02:26:34] [INFO ] Implicit Places using invariants in 521 ms returned []
// Phase 1: matrix 5370 rows 3270 cols
[2022-05-16 02:26:34] [INFO ] Computed 30 place invariants in 27 ms
[2022-05-16 02:26:35] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2022-05-16 02:26:35] [INFO ] Redundant transitions in 360 ms returned []
// Phase 1: matrix 5370 rows 3270 cols
[2022-05-16 02:26:35] [INFO ] Computed 30 place invariants in 42 ms
[2022-05-16 02:26:38] [INFO ] Dead Transitions using invariants and state equation in 2595 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3270/3960 places, 5370/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 3270/3960 places, 5370/6060 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : BART-PT-030-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s166 0) (EQ s361 0) (EQ s464 0) (EQ s567 0) (EQ s886 0) (EQ s1122 0) (EQ s761 0) (EQ s997 0) (EQ s218 0) (EQ s232 0) (EQ s152 0) (EQ s872 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 306 reset in 1135 ms.
Product exploration explored 100000 steps with 341 reset in 1090 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 p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 123 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 300 out of 3270 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3270/3270 places, 5370/5370 transitions.
Applied a total of 0 rules in 160 ms. Remains 3270 /3270 variables (removed 0) and now considering 5370/5370 (removed 0) transitions.
// Phase 1: matrix 5370 rows 3270 cols
[2022-05-16 02:26:49] [INFO ] Computed 30 place invariants in 40 ms
[2022-05-16 02:26:50] [INFO ] Implicit Places using invariants in 668 ms returned []
// Phase 1: matrix 5370 rows 3270 cols
[2022-05-16 02:26:50] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 02:26:50] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2022-05-16 02:26:50] [INFO ] Redundant transitions in 197 ms returned []
// Phase 1: matrix 5370 rows 3270 cols
[2022-05-16 02:26:50] [INFO ] Computed 30 place invariants in 34 ms
[2022-05-16 02:26:53] [INFO ] Dead Transitions using invariants and state equation in 3080 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3270/3270 places, 5370/5370 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 p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 151 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 334 reset in 1213 ms.
Product exploration explored 100000 steps with 321 reset in 1296 ms.
Built C files in :
/tmp/ltsmin7715318832745829949
[2022-05-16 02:27:05] [INFO ] Too many transitions (5370) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:27:05] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7715318832745829949
Running compilation step : cd /tmp/ltsmin7715318832745829949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7715318832745829949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin7715318832745829949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 300 out of 3270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3270/3270 places, 5370/5370 transitions.
Drop transitions removed 1020 transitions
Trivial Post-agglo rules discarded 1020 transitions
Performed 1020 trivial Post agglomeration. Transition count delta: 1020
Iterating post reduction 0 with 1020 rules applied. Total rules applied 1020 place count 3270 transition count 4350
Reduce places removed 1020 places and 0 transitions.
Iterating post reduction 1 with 1020 rules applied. Total rules applied 2040 place count 2250 transition count 4350
Discarding 150 places :
Symmetric choice reduction at 2 with 150 rule applications. Total rules 2190 place count 2100 transition count 4200
Iterating global reduction 2 with 150 rules applied. Total rules applied 2340 place count 2100 transition count 4200
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 1 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 3240 place count 1650 transition count 3750
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 3270 place count 1650 transition count 3720
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 3330 place count 1620 transition count 3690
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 3360 place count 1620 transition count 3660
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 3420 place count 1590 transition count 3630
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 3450 place count 1590 transition count 3600
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 3510 place count 1560 transition count 3570
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 3540 place count 1560 transition count 3540
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 3600 place count 1530 transition count 3510
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 3660 place count 1530 transition count 3450
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 3720 place count 1500 transition count 3420
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 3780 place count 1500 transition count 3360
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 8 with 60 rules applied. Total rules applied 3840 place count 1470 transition count 3330
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 3900 place count 1470 transition count 3270
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 3960 place count 1440 transition count 3240
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 4020 place count 1440 transition count 3180
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 4080 place count 1410 transition count 3150
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 4140 place count 1410 transition count 3090
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 4200 place count 1380 transition count 3060
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 4260 place count 1380 transition count 3000
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 60 rules applied. Total rules applied 4320 place count 1350 transition count 2970
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 4380 place count 1350 transition count 2910
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 60 rules applied. Total rules applied 4440 place count 1320 transition count 2880
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 4500 place count 1320 transition count 2820
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 14 with 60 rules applied. Total rules applied 4560 place count 1290 transition count 2790
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 4620 place count 1290 transition count 2730
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 15 with 60 rules applied. Total rules applied 4680 place count 1260 transition count 2700
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 4740 place count 1260 transition count 2640
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 4800 place count 1230 transition count 2610
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 4860 place count 1230 transition count 2550
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 4920 place count 1200 transition count 2520
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 4980 place count 1200 transition count 2460
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 18 with 60 rules applied. Total rules applied 5040 place count 1170 transition count 2430
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 5100 place count 1170 transition count 2370
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 5160 place count 1140 transition count 2340
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 5220 place count 1140 transition count 2280
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 5280 place count 1110 transition count 2250
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 5340 place count 1110 transition count 2190
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 5400 place count 1080 transition count 2160
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 5460 place count 1080 transition count 2100
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 22 with 60 rules applied. Total rules applied 5520 place count 1050 transition count 2070
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 5580 place count 1050 transition count 2010
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 5640 place count 1020 transition count 1980
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 5700 place count 1020 transition count 1920
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 24 with 60 rules applied. Total rules applied 5760 place count 990 transition count 1890
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 5820 place count 990 transition count 1830
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 25 with 60 rules applied. Total rules applied 5880 place count 960 transition count 1800
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 25 with 30 rules applied. Total rules applied 5910 place count 960 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 26 with 60 rules applied. Total rules applied 5970 place count 930 transition count 1740
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 26 with 30 rules applied. Total rules applied 6000 place count 930 transition count 1710
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 27 with 60 rules applied. Total rules applied 6060 place count 900 transition count 1680
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 27 with 30 rules applied. Total rules applied 6090 place count 900 transition count 1650
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 28 with 60 rules applied. Total rules applied 6150 place count 870 transition count 1620
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 6210 place count 870 transition count 1560
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 29 with 60 rules applied. Total rules applied 6270 place count 840 transition count 1530
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 6330 place count 840 transition count 1470
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 30 with 60 rules applied. Total rules applied 6390 place count 810 transition count 1440
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 6450 place count 810 transition count 1380
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 31 with 60 rules applied. Total rules applied 6510 place count 780 transition count 1350
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 6570 place count 780 transition count 1290
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 32 with 60 rules applied. Total rules applied 6630 place count 750 transition count 1260
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 32 with 30 rules applied. Total rules applied 6660 place count 750 transition count 1230
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 33 with 60 rules applied. Total rules applied 6720 place count 720 transition count 1200
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 33 with 30 rules applied. Total rules applied 6750 place count 720 transition count 1170
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 34 with 60 rules applied. Total rules applied 6810 place count 690 transition count 1140
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 6870 place count 690 transition count 1080
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 35 with 60 rules applied. Total rules applied 6930 place count 660 transition count 1050
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 6990 place count 660 transition count 990
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 7020 place count 660 transition count 960
Partial Post-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 36 with 30 rules applied. Total rules applied 7050 place count 660 transition count 960
Discarding 30 places :
Symmetric choice reduction at 36 with 30 rule applications. Total rules 7080 place count 630 transition count 930
Iterating global reduction 36 with 30 rules applied. Total rules applied 7110 place count 630 transition count 930
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 36 with 30 rules applied. Total rules applied 7140 place count 630 transition count 900
Applied a total of 7140 rules in 2299 ms. Remains 630 /3270 variables (removed 2640) and now considering 900/5370 (removed 4470) transitions.
// Phase 1: matrix 900 rows 630 cols
[2022-05-16 02:27:10] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 02:27:10] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 900 rows 630 cols
[2022-05-16 02:27:10] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 02:27:11] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2022-05-16 02:27:11] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 900 rows 630 cols
[2022-05-16 02:27:11] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-16 02:27:11] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/3270 places, 900/5370 transitions.
Finished structural reductions, in 1 iterations. Remains : 630/3270 places, 900/5370 transitions.
Built C files in :
/tmp/ltsmin2919135185873720287
[2022-05-16 02:27:11] [INFO ] Computing symmetric may disable matrix : 900 transitions.
[2022-05-16 02:27:11] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:27:11] [INFO ] Computing symmetric may enable matrix : 900 transitions.
[2022-05-16 02:27:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:27:11] [INFO ] Computing Do-Not-Accords matrix : 900 transitions.
[2022-05-16 02:27:11] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:27:11] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2919135185873720287
Running compilation step : cd /tmp/ltsmin2919135185873720287;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2012 ms.
Running link step : cd /tmp/ltsmin2919135185873720287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin2919135185873720287;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11552716958336443247.hoa' '--buchi-type=spotba'
LTSmin run took 7878 ms.
FORMULA BART-PT-030-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-030-LTLFireability-01 finished in 48217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||F((G((X(p1)&&p1))||G(p2)))))'
Support contains 2070 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 3960 transition count 5970
Reduce places removed 90 places and 0 transitions.
Performed 780 Post agglomeration using F-continuation condition.Transition count delta: 780
Iterating post reduction 1 with 870 rules applied. Total rules applied 960 place count 3870 transition count 5190
Reduce places removed 780 places and 0 transitions.
Iterating post reduction 2 with 780 rules applied. Total rules applied 1740 place count 3090 transition count 5190
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1770 place count 3060 transition count 5160
Iterating global reduction 3 with 30 rules applied. Total rules applied 1800 place count 3060 transition count 5160
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 2040 place count 2940 transition count 5040
Applied a total of 2040 rules in 621 ms. Remains 2940 /3960 variables (removed 1020) and now considering 5040/6060 (removed 1020) transitions.
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:27:22] [INFO ] Computed 30 place invariants in 106 ms
[2022-05-16 02:27:22] [INFO ] Implicit Places using invariants in 438 ms returned []
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:27:22] [INFO ] Computed 30 place invariants in 14 ms
[2022-05-16 02:27:23] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2022-05-16 02:27:23] [INFO ] Redundant transitions in 166 ms returned []
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:27:23] [INFO ] Computed 30 place invariants in 29 ms
[2022-05-16 02:27:26] [INFO ] Dead Transitions using invariants and state equation in 2655 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2940/3960 places, 5040/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 2940/3960 places, 5040/6060 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-030-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s199 1) (EQ s380 1) (EQ s287 1) (EQ s453 1) (EQ s2067 1) (EQ s2398 1) (EQ s2403 1) (EQ s1013 1) (EQ s1591 1) (EQ s998 1) (EQ s1606 1) (EQ s2229...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 937 reset in 3452 ms.
Product exploration explored 100000 steps with 929 reset in 3419 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 (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
Knowledge based reduction with 7 factoid took 520 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1178 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:28:40] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-16 02:28:47] [INFO ] After 794ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-16 02:28:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 35 ms returned sat
[2022-05-16 02:28:48] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 485 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2))]
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2))]
Support contains 2070 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 5040/5040 transitions.
Applied a total of 0 rules in 81 ms. Remains 2940 /2940 variables (removed 0) and now considering 5040/5040 (removed 0) transitions.
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:28:49] [INFO ] Computed 30 place invariants in 34 ms
[2022-05-16 02:28:49] [INFO ] Implicit Places using invariants in 447 ms returned []
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:28:49] [INFO ] Computed 30 place invariants in 29 ms
[2022-05-16 02:28:51] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2334 ms to find 0 implicit places.
[2022-05-16 02:28:51] [INFO ] Redundant transitions in 166 ms returned []
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:28:51] [INFO ] Computed 30 place invariants in 34 ms
[2022-05-16 02:28:54] [INFO ] Dead Transitions using invariants and state equation in 2965 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2940/2940 places, 5040/5040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 5 factoid took 378 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2232 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:30:06] [INFO ] Computed 30 place invariants in 31 ms
[2022-05-16 02:30:19] [INFO ] After 7626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:30:27] [INFO ] [Nat]Absence check using 30 positive place invariants in 76 ms returned sat
[2022-05-16 02:30:33] [INFO ] After 13478ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2))))), (G (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 6 factoid took 418 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 59 ms :[false, false]
Stuttering acceptance computed with spot in 78 ms :[false, false]
Stuttering acceptance computed with spot in 60 ms :[false, false]
Product exploration explored 100000 steps with 934 reset in 2460 ms.
Product exploration explored 100000 steps with 934 reset in 2617 ms.
Built C files in :
/tmp/ltsmin6377108007737463801
[2022-05-16 02:30:38] [INFO ] Too many transitions (5040) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:30:38] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6377108007737463801
Running compilation step : cd /tmp/ltsmin6377108007737463801;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6377108007737463801;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6377108007737463801;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2070 out of 2940 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2940/2940 places, 5040/5040 transitions.
Applied a total of 0 rules in 68 ms. Remains 2940 /2940 variables (removed 0) and now considering 5040/5040 (removed 0) transitions.
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:30:42] [INFO ] Computed 30 place invariants in 26 ms
[2022-05-16 02:30:42] [INFO ] Implicit Places using invariants in 371 ms returned []
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:30:42] [INFO ] Computed 30 place invariants in 19 ms
[2022-05-16 02:30:43] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2022-05-16 02:30:43] [INFO ] Redundant transitions in 239 ms returned []
// Phase 1: matrix 5040 rows 2940 cols
[2022-05-16 02:30:43] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:30:45] [INFO ] Dead Transitions using invariants and state equation in 2218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2940/2940 places, 5040/5040 transitions.
Built C files in :
/tmp/ltsmin1915091272003682724
[2022-05-16 02:30:45] [INFO ] Too many transitions (5040) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:30:45] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1915091272003682724
Running compilation step : cd /tmp/ltsmin1915091272003682724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1915091272003682724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1915091272003682724;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:30:49] [INFO ] Flatten gal took : 170 ms
[2022-05-16 02:30:49] [INFO ] Flatten gal took : 154 ms
[2022-05-16 02:30:49] [INFO ] Time to serialize gal into /tmp/LTL13370224385736446126.gal : 25 ms
[2022-05-16 02:30:49] [INFO ] Time to serialize properties into /tmp/LTL12751212273238222952.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13370224385736446126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12751212273238222952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1337022...268
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1)|...163149
Formula 0 simplified : !(GF"((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1)||(...163132
Detected timeout of ITS tools.
[2022-05-16 02:31:05] [INFO ] Flatten gal took : 102 ms
[2022-05-16 02:31:05] [INFO ] Applying decomposition
[2022-05-16 02:31:05] [INFO ] Flatten gal took : 101 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7230189994030982298.txt' '-o' '/tmp/graph7230189994030982298.bin' '-w' '/tmp/graph7230189994030982298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7230189994030982298.bin' '-l' '-1' '-v' '-w' '/tmp/graph7230189994030982298.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:31:05] [INFO ] Decomposing Gal with order
[2022-05-16 02:31:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:31:06] [INFO ] Removed a total of 241 redundant transitions.
[2022-05-16 02:31:06] [INFO ] Flatten gal took : 321 ms
[2022-05-16 02:31:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 32 ms.
[2022-05-16 02:31:06] [INFO ] Time to serialize gal into /tmp/LTL16094377590785713781.gal : 38 ms
[2022-05-16 02:31:06] [INFO ] Time to serialize properties into /tmp/LTL11307758403512602738.ltl : 35 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16094377590785713781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11307758403512602738.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1609437...247
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((i29.u18.TrainState_1_1_1==1)||(i24.u19.TrainState_2_1_1==1))||((i13.u20.TrainState_3_1_1==1)||(i14.u0.TrainState_4_1_1=...213907
Formula 0 simplified : !(GF"((((((i29.u18.TrainState_1_1_1==1)||(i24.u19.TrainState_2_1_1==1))||((i13.u20.TrainState_3_1_1==1)||(i14.u0.TrainState_4_1_1==1...213890
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14832707096427524899
[2022-05-16 02:31:21] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14832707096427524899
Running compilation step : cd /tmp/ltsmin14832707096427524899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14832707096427524899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin14832707096427524899;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BART-PT-030-LTLFireability-04 finished in 243224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 60 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions removed 1920 transitions
Trivial Post-agglo rules discarded 1920 transitions
Performed 1920 trivial Post agglomeration. Transition count delta: 1920
Iterating post reduction 0 with 1920 rules applied. Total rules applied 1920 place count 3960 transition count 4140
Reduce places removed 1920 places and 0 transitions.
Iterating post reduction 1 with 1920 rules applied. Total rules applied 3840 place count 2040 transition count 4140
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 3840 place count 2040 transition count 4020
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 4080 place count 1920 transition count 4020
Discarding 180 places :
Symmetric choice reduction at 2 with 180 rule applications. Total rules 4260 place count 1740 transition count 3840
Iterating global reduction 2 with 180 rules applied. Total rules applied 4440 place count 1740 transition count 3840
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4470 place count 1740 transition count 3810
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 4590 place count 1620 transition count 3690
Iterating global reduction 3 with 120 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 4800 place count 1530 transition count 3600
Iterating global reduction 3 with 90 rules applied. Total rules applied 4890 place count 1530 transition count 3600
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 4980 place count 1440 transition count 3510
Iterating global reduction 3 with 90 rules applied. Total rules applied 5070 place count 1440 transition count 3510
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 5130 place count 1380 transition count 3450
Iterating global reduction 3 with 60 rules applied. Total rules applied 5190 place count 1380 transition count 3450
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 5250 place count 1320 transition count 3390
Iterating global reduction 3 with 60 rules applied. Total rules applied 5310 place count 1320 transition count 3390
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 5340 place count 1290 transition count 3360
Iterating global reduction 3 with 30 rules applied. Total rules applied 5370 place count 1290 transition count 3360
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 210
Deduced a syphon composed of 210 places in 1 ms
Reduce places removed 210 places and 0 transitions.
Iterating global reduction 3 with 420 rules applied. Total rules applied 5790 place count 1080 transition count 3150
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 3 with 120 rules applied. Total rules applied 5910 place count 1080 transition count 3030
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 6030 place count 1020 transition count 2970
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 4 with 120 rules applied. Total rules applied 6150 place count 1020 transition count 2850
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 6270 place count 960 transition count 2790
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 5 with 120 rules applied. Total rules applied 6390 place count 960 transition count 2670
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 6510 place count 900 transition count 2610
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 6 with 120 rules applied. Total rules applied 6630 place count 900 transition count 2490
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 7 with 120 rules applied. Total rules applied 6750 place count 840 transition count 2430
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 7 with 120 rules applied. Total rules applied 6870 place count 840 transition count 2310
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 8 with 120 rules applied. Total rules applied 6990 place count 780 transition count 2250
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 8 with 120 rules applied. Total rules applied 7110 place count 780 transition count 2130
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 9 with 120 rules applied. Total rules applied 7230 place count 720 transition count 2070
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 9 with 120 rules applied. Total rules applied 7350 place count 720 transition count 1950
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 10 with 120 rules applied. Total rules applied 7470 place count 660 transition count 1890
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 10 with 120 rules applied. Total rules applied 7590 place count 660 transition count 1770
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 11 with 120 rules applied. Total rules applied 7710 place count 600 transition count 1710
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 11 with 120 rules applied. Total rules applied 7830 place count 600 transition count 1590
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 12 with 120 rules applied. Total rules applied 7950 place count 540 transition count 1530
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 12 with 120 rules applied. Total rules applied 8070 place count 540 transition count 1410
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 13 with 120 rules applied. Total rules applied 8190 place count 480 transition count 1350
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 13 with 120 rules applied. Total rules applied 8310 place count 480 transition count 1230
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 14 with 120 rules applied. Total rules applied 8430 place count 420 transition count 1170
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 14 with 120 rules applied. Total rules applied 8550 place count 420 transition count 1050
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 15 with 120 rules applied. Total rules applied 8670 place count 360 transition count 990
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 15 with 120 rules applied. Total rules applied 8790 place count 360 transition count 870
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 16 with 120 rules applied. Total rules applied 8910 place count 300 transition count 810
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 16 with 120 rules applied. Total rules applied 9030 place count 300 transition count 690
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 17 with 120 rules applied. Total rules applied 9150 place count 240 transition count 630
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 17 with 120 rules applied. Total rules applied 9270 place count 240 transition count 510
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 18 with 120 rules applied. Total rules applied 9390 place count 180 transition count 450
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 18 with 120 rules applied. Total rules applied 9510 place count 180 transition count 330
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 19 with 120 rules applied. Total rules applied 9630 place count 120 transition count 270
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 19 with 150 rules applied. Total rules applied 9780 place count 120 transition count 120
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 9840 place count 90 transition count 90
Applied a total of 9840 rules in 935 ms. Remains 90 /3960 variables (removed 3870) and now considering 90/6060 (removed 5970) transitions.
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:25] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-16 02:31:25] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:25] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-16 02:31:26] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-16 02:31:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:26] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-16 02:31:26] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/3960 places, 90/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/3960 places, 90/6060 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s30 1) (EQ s31 1) (EQ s32 1) (EQ s33 1) (EQ s34 1) (EQ s35 1) (EQ s36 1) (EQ s37 1) (EQ s39 1) (EQ s38 1) (EQ s41 1) (EQ s40 1) (EQ s43 1) (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 284 ms.
Product exploration explored 100000 steps with 0 reset in 384 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Finished Best-First random walk after 930 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=310 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 544 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:28] [INFO ] Computed 30 place invariants in 0 ms
[2022-05-16 02:31:28] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2022-05-16 02:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:31:28] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-16 02:31:28] [INFO ] Computed and/alt/rep : 60/60/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 02:31:28] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 60 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:28] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 02:31:28] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:28] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 02:31:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-05-16 02:31:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:28] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 02:31:28] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Finished Best-First random walk after 930 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=310 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 90 rows 90 cols
[2022-05-16 02:31:29] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 02:31:30] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2022-05-16 02:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:31:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-16 02:31:30] [INFO ] Computed and/alt/rep : 60/60/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 02:31:30] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 339 ms.
Built C files in :
/tmp/ltsmin8648677263232138619
[2022-05-16 02:31:31] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2022-05-16 02:31:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:31:31] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2022-05-16 02:31:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:31:31] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2022-05-16 02:31:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 02:31:31] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8648677263232138619
Running compilation step : cd /tmp/ltsmin8648677263232138619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin8648677263232138619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8648677263232138619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14472325709686409775.hoa' '--buchi-type=spotba'
LTSmin run took 101 ms.
FORMULA BART-PT-030-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-030-LTLFireability-05 finished in 6682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(F((X(p0)&&p1))) U (F(!G(p2))&&p1))))'
Support contains 3660 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 27 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:31:31] [INFO ] Computed 30 place invariants in 36 ms
[2022-05-16 02:31:32] [INFO ] Implicit Places using invariants in 629 ms returned []
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:31:32] [INFO ] Computed 30 place invariants in 40 ms
[2022-05-16 02:31:33] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
// Phase 1: matrix 6060 rows 3960 cols
[2022-05-16 02:31:33] [INFO ] Computed 30 place invariants in 22 ms
[2022-05-16 02:31:33] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3960/3960 places, 6060/6060 transitions.
Stuttering acceptance computed with spot in 447 ms :[true, (AND p1 (NOT p2)), (AND p0 (NOT p2)), (AND p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p0 p1 (NOT p2)), (AND p1 p0), (NOT p2), p0]
Running random walk in product with property : BART-PT-030-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=3, aps=[p1:(OR (EQ s9 1) (EQ s28 1) (EQ s4 1) (EQ s1 1) (EQ s22 1) (EQ s20 1) (EQ s14 1) (EQ s24 1) (EQ s8 1) (EQ s7 1) (EQ s5 1) (EQ s27 1) (EQ s10 1) (EQ s26 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1553 ms.
Product exploration explored 100000 steps with 0 reset in 1392 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 (NOT p2) (NOT p0)), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 722 ms. Reduced automaton from 9 states, 25 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (AND p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F p2)]
Property proved to be false thanks to negative knowledge :(X (X (AND p1 (NOT p2))))
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-030-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-07 finished in 8987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(X(p0)) U p1)&&F(p2)))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 957 places :
Symmetric choice reduction at 0 with 957 rule applications. Total rules 957 place count 3003 transition count 5103
Iterating global reduction 0 with 957 rules applied. Total rules applied 1914 place count 3003 transition count 5103
Discarding 808 places :
Symmetric choice reduction at 0 with 808 rule applications. Total rules 2722 place count 2195 transition count 4295
Iterating global reduction 0 with 808 rules applied. Total rules applied 3530 place count 2195 transition count 4295
Discarding 118 places :
Symmetric choice reduction at 0 with 118 rule applications. Total rules 3648 place count 2077 transition count 4177
Iterating global reduction 0 with 118 rules applied. Total rules applied 3766 place count 2077 transition count 4177
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3855 place count 1988 transition count 4088
Iterating global reduction 0 with 89 rules applied. Total rules applied 3944 place count 1988 transition count 4088
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4033 place count 1899 transition count 3999
Iterating global reduction 0 with 89 rules applied. Total rules applied 4122 place count 1899 transition count 3999
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4210 place count 1811 transition count 3911
Iterating global reduction 0 with 88 rules applied. Total rules applied 4298 place count 1811 transition count 3911
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4385 place count 1724 transition count 3824
Iterating global reduction 0 with 87 rules applied. Total rules applied 4472 place count 1724 transition count 3824
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4559 place count 1637 transition count 3737
Iterating global reduction 0 with 87 rules applied. Total rules applied 4646 place count 1637 transition count 3737
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 4703 place count 1580 transition count 3680
Iterating global reduction 0 with 57 rules applied. Total rules applied 4760 place count 1580 transition count 3680
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 4817 place count 1523 transition count 3623
Iterating global reduction 0 with 57 rules applied. Total rules applied 4874 place count 1523 transition count 3623
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4903 place count 1494 transition count 3594
Iterating global reduction 0 with 29 rules applied. Total rules applied 4932 place count 1494 transition count 3594
Applied a total of 4932 rules in 839 ms. Remains 1494 /3960 variables (removed 2466) and now considering 3594/6060 (removed 2466) transitions.
// Phase 1: matrix 3594 rows 1494 cols
[2022-05-16 02:31:41] [INFO ] Computed 30 place invariants in 19 ms
[2022-05-16 02:31:41] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 3594 rows 1494 cols
[2022-05-16 02:31:41] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-16 02:31:42] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
// Phase 1: matrix 3594 rows 1494 cols
[2022-05-16 02:31:42] [INFO ] Computed 30 place invariants in 13 ms
[2022-05-16 02:31:44] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1494/3960 places, 3594/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 1494/3960 places, 3594/6060 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) p1), true, (NOT p2), (AND p0 p1), p0]
Running random walk in product with property : BART-PT-030-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s422 1), p2:(EQ s636 1), p0:(NEQ s330 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 44 reset in 604 ms.
Product exploration explored 100000 steps with 61 reset in 666 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 (NOT p1) (NOT p2) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p2)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 337 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (AND p0 p1)), (NOT p2), (AND p0 p1), p0]
Finished random walk after 2043 steps, including 0 resets, run visited all 4 properties in 67 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p2)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 474 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) (AND p0 p1)), (NOT p2), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (AND p0 p1)), (NOT p2), (AND p0 p1), p0]
// Phase 1: matrix 3594 rows 1494 cols
[2022-05-16 02:31:47] [INFO ] Computed 30 place invariants in 14 ms
[2022-05-16 02:31:49] [INFO ] [Real]Absence check using 30 positive place invariants in 3 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT p2)), true, (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p2), (F (AND p1 p0)), (F (NOT (AND (NOT p1) p0))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-030-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-08 finished in 8588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(F((G(p0)||p1))))||p2))))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3656 place count 2072 transition count 4172
Iterating global reduction 0 with 120 rules applied. Total rules applied 3776 place count 2072 transition count 4172
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3866 place count 1982 transition count 4082
Iterating global reduction 0 with 90 rules applied. Total rules applied 3956 place count 1982 transition count 4082
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4045 place count 1893 transition count 3993
Iterating global reduction 0 with 89 rules applied. Total rules applied 4134 place count 1893 transition count 3993
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4223 place count 1804 transition count 3904
Iterating global reduction 0 with 89 rules applied. Total rules applied 4312 place count 1804 transition count 3904
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4401 place count 1715 transition count 3815
Iterating global reduction 0 with 89 rules applied. Total rules applied 4490 place count 1715 transition count 3815
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4579 place count 1626 transition count 3726
Iterating global reduction 0 with 89 rules applied. Total rules applied 4668 place count 1626 transition count 3726
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4727 place count 1567 transition count 3667
Iterating global reduction 0 with 59 rules applied. Total rules applied 4786 place count 1567 transition count 3667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4845 place count 1508 transition count 3608
Iterating global reduction 0 with 59 rules applied. Total rules applied 4904 place count 1508 transition count 3608
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4933 place count 1479 transition count 3579
Iterating global reduction 0 with 29 rules applied. Total rules applied 4962 place count 1479 transition count 3579
Applied a total of 4962 rules in 921 ms. Remains 1479 /3960 variables (removed 2481) and now considering 3579/6060 (removed 2481) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:31:50] [INFO ] Computed 30 place invariants in 19 ms
[2022-05-16 02:31:50] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:31:50] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-16 02:31:51] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:31:51] [INFO ] Computed 30 place invariants in 25 ms
[2022-05-16 02:31:52] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1479/3960 places, 3579/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 1479/3960 places, 3579/6060 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-030-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s29 1), p1:(EQ s270 0), p0:(EQ s1240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4963 reset in 2727 ms.
Product exploration explored 100000 steps with 4950 reset in 3013 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:31:59] [INFO ] Computed 30 place invariants in 18 ms
[2022-05-16 02:32:00] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:32:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2022-05-16 02:32:01] [INFO ] After 945ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:32:01] [INFO ] After 1136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-16 02:32:01] [INFO ] After 1495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 231 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 379 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1479/1479 places, 3579/3579 transitions.
Applied a total of 0 rules in 64 ms. Remains 1479 /1479 variables (removed 0) and now considering 3579/3579 (removed 0) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:02] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:32:02] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:02] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-16 02:32:03] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:03] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-16 02:32:05] [INFO ] Dead Transitions using invariants and state equation in 1282 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1479/1479 places, 3579/3579 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 p2 (NOT p0) p1), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 369 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:06] [INFO ] Computed 30 place invariants in 18 ms
[2022-05-16 02:32:06] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 02:32:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 16 ms returned sat
[2022-05-16 02:32:07] [INFO ] After 929ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 02:32:07] [INFO ] After 1132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 142 ms.
[2022-05-16 02:32:08] [INFO ] After 1536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 293 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 273 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4936 reset in 3132 ms.
Product exploration explored 100000 steps with 4948 reset in 3176 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1479/1479 places, 3579/3579 transitions.
Graph (trivial) has 3536 edges and 1479 vertex of which 1420 / 1479 are part of one of the 29 SCC in 2 ms
Free SCC test removed 1391 places
Ensure Unique test removed 3412 transitions
Reduce isomorphic transitions removed 3412 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 61 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 61 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 61 transition count 140
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 61 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 59 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 59 transition count 138
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 52 place count 59 transition count 139
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 61 place count 59 transition count 130
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 75 place count 45 transition count 116
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 3 with 14 rules applied. Total rules applied 89 place count 45 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 45 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 45 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 44 transition count 113
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 44 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 44 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 97 place count 44 transition count 111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 98 place count 43 transition count 110
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 99 place count 43 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 43 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 102 place count 43 transition count 108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 103 place count 42 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 104 place count 42 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 105 place count 42 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 107 place count 42 transition count 105
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 108 place count 41 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 109 place count 41 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 7 with 1 rules applied. Total rules applied 110 place count 41 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 112 place count 41 transition count 102
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 113 place count 40 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 114 place count 40 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 115 place count 40 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 117 place count 40 transition count 99
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 118 place count 39 transition count 98
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 119 place count 39 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 120 place count 39 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 122 place count 39 transition count 96
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 123 place count 38 transition count 95
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 124 place count 38 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 10 with 1 rules applied. Total rules applied 125 place count 38 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 127 place count 38 transition count 93
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 128 place count 37 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 129 place count 37 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 11 with 1 rules applied. Total rules applied 130 place count 37 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 132 place count 37 transition count 90
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 133 place count 36 transition count 89
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 134 place count 36 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 12 with 1 rules applied. Total rules applied 135 place count 36 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 137 place count 36 transition count 87
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 138 place count 35 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 139 place count 35 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 13 with 1 rules applied. Total rules applied 140 place count 35 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 142 place count 35 transition count 84
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 143 place count 34 transition count 83
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 144 place count 34 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 14 with 1 rules applied. Total rules applied 145 place count 34 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 147 place count 34 transition count 81
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 148 place count 33 transition count 80
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 149 place count 33 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 15 with 1 rules applied. Total rules applied 150 place count 33 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 152 place count 33 transition count 78
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 153 place count 32 transition count 77
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 154 place count 32 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 16 with 1 rules applied. Total rules applied 155 place count 32 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 157 place count 32 transition count 75
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 158 place count 31 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 159 place count 31 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 17 with 1 rules applied. Total rules applied 160 place count 31 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 162 place count 31 transition count 72
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 163 place count 30 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 164 place count 30 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 18 with 1 rules applied. Total rules applied 165 place count 30 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 167 place count 30 transition count 69
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 168 place count 29 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 169 place count 29 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 19 with 1 rules applied. Total rules applied 170 place count 29 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 172 place count 29 transition count 66
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 173 place count 28 transition count 65
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 174 place count 28 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 20 with 1 rules applied. Total rules applied 175 place count 28 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 177 place count 28 transition count 63
Discarding 1 places :
Symmetric choice reduction at 21 with 1 rule applications. Total rules 178 place count 27 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 179 place count 27 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 21 with 1 rules applied. Total rules applied 180 place count 27 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 182 place count 27 transition count 60
Discarding 1 places :
Symmetric choice reduction at 22 with 1 rule applications. Total rules 183 place count 26 transition count 59
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 184 place count 26 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 22 with 1 rules applied. Total rules applied 185 place count 26 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 187 place count 26 transition count 57
Discarding 1 places :
Symmetric choice reduction at 23 with 1 rule applications. Total rules 188 place count 25 transition count 56
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 189 place count 25 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 23 with 1 rules applied. Total rules applied 190 place count 25 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 192 place count 25 transition count 54
Discarding 1 places :
Symmetric choice reduction at 24 with 1 rule applications. Total rules 193 place count 24 transition count 53
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 194 place count 24 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 24 with 1 rules applied. Total rules applied 195 place count 24 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 197 place count 24 transition count 51
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 198 place count 23 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 199 place count 23 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 25 with 1 rules applied. Total rules applied 200 place count 23 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 202 place count 23 transition count 48
Discarding 1 places :
Symmetric choice reduction at 26 with 1 rule applications. Total rules 203 place count 22 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 204 place count 22 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 26 with 1 rules applied. Total rules applied 205 place count 22 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 207 place count 22 transition count 45
Discarding 1 places :
Symmetric choice reduction at 27 with 1 rule applications. Total rules 208 place count 21 transition count 44
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 209 place count 21 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 27 with 1 rules applied. Total rules applied 210 place count 21 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 212 place count 21 transition count 42
Discarding 1 places :
Symmetric choice reduction at 28 with 1 rule applications. Total rules 213 place count 20 transition count 41
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 214 place count 20 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 28 with 1 rules applied. Total rules applied 215 place count 20 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 217 place count 20 transition count 39
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 218 place count 19 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 219 place count 19 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 29 with 1 rules applied. Total rules applied 220 place count 19 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 222 place count 19 transition count 36
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 223 place count 18 transition count 35
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 224 place count 18 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 30 with 1 rules applied. Total rules applied 225 place count 18 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 227 place count 18 transition count 33
Discarding 1 places :
Symmetric choice reduction at 31 with 1 rule applications. Total rules 228 place count 17 transition count 32
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 229 place count 17 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 31 with 1 rules applied. Total rules applied 230 place count 17 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 232 place count 17 transition count 30
Discarding 1 places :
Symmetric choice reduction at 32 with 1 rule applications. Total rules 233 place count 16 transition count 29
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 234 place count 16 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 32 with 1 rules applied. Total rules applied 235 place count 16 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 237 place count 16 transition count 27
Discarding 1 places :
Symmetric choice reduction at 33 with 1 rule applications. Total rules 238 place count 15 transition count 26
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 239 place count 15 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 33 with 1 rules applied. Total rules applied 240 place count 15 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 242 place count 15 transition count 24
Discarding 1 places :
Symmetric choice reduction at 34 with 1 rule applications. Total rules 243 place count 14 transition count 23
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 244 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 34 with 1 rules applied. Total rules applied 245 place count 14 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 247 place count 14 transition count 21
Discarding 1 places :
Symmetric choice reduction at 35 with 1 rule applications. Total rules 248 place count 13 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 249 place count 13 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 35 with 1 rules applied. Total rules applied 250 place count 13 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 252 place count 13 transition count 18
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 253 place count 12 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 254 place count 12 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 36 with 1 rules applied. Total rules applied 255 place count 12 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 257 place count 12 transition count 15
Discarding 2 places :
Symmetric choice reduction at 37 with 2 rule applications. Total rules 259 place count 10 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 2 rules applied. Total rules applied 261 place count 10 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 37 with 2 rules applied. Total rules applied 263 place count 10 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 263 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 264 place count 10 transition count 11
Discarding 1 places :
Symmetric choice reduction at 37 with 1 rule applications. Total rules 265 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 266 place count 9 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 266 rules in 60 ms. Remains 9 /1479 variables (removed 1470) and now considering 10/3579 (removed 3569) transitions.
[2022-05-16 02:32:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 10 rows 9 cols
[2022-05-16 02:32:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:32:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/1479 places, 10/3579 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/1479 places, 10/3579 transitions.
Product exploration explored 100000 steps with 4901 reset in 3027 ms.
Product exploration explored 100000 steps with 4934 reset in 3021 ms.
Built C files in :
/tmp/ltsmin1089202436397095596
[2022-05-16 02:32:21] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1089202436397095596
Running compilation step : cd /tmp/ltsmin1089202436397095596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1089202436397095596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin1089202436397095596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1479/1479 places, 3579/3579 transitions.
Applied a total of 0 rules in 82 ms. Remains 1479 /1479 variables (removed 0) and now considering 3579/3579 (removed 0) transitions.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:24] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-16 02:32:25] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:25] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-16 02:32:26] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
// Phase 1: matrix 3579 rows 1479 cols
[2022-05-16 02:32:26] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-16 02:32:27] [INFO ] Dead Transitions using invariants and state equation in 1149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1479/1479 places, 3579/3579 transitions.
Built C files in :
/tmp/ltsmin4044225728541103768
[2022-05-16 02:32:27] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4044225728541103768
Running compilation step : cd /tmp/ltsmin4044225728541103768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4044225728541103768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin4044225728541103768;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:32:30] [INFO ] Flatten gal took : 79 ms
[2022-05-16 02:32:30] [INFO ] Flatten gal took : 74 ms
[2022-05-16 02:32:30] [INFO ] Time to serialize gal into /tmp/LTL10036150197280046729.gal : 10 ms
[2022-05-16 02:32:30] [INFO ] Time to serialize properties into /tmp/LTL4358214489319977871.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10036150197280046729.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4358214489319977871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1003615...267
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X(F((G("(TrainState_4_1_34==1)"))||("(TrainState_21_3_8==0)")))))||("(TrainState_30_0_0==1)")))))
Formula 0 simplified : !GX("(TrainState_30_0_0==1)" | XXF("(TrainState_21_3_8==0)" | G"(TrainState_4_1_34==1)"))
Detected timeout of ITS tools.
[2022-05-16 02:32:45] [INFO ] Flatten gal took : 53 ms
[2022-05-16 02:32:45] [INFO ] Applying decomposition
[2022-05-16 02:32:45] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9727637039838462050.txt' '-o' '/tmp/graph9727637039838462050.bin' '-w' '/tmp/graph9727637039838462050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9727637039838462050.bin' '-l' '-1' '-v' '-w' '/tmp/graph9727637039838462050.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:32:45] [INFO ] Decomposing Gal with order
[2022-05-16 02:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:32:46] [INFO ] Removed a total of 1168 redundant transitions.
[2022-05-16 02:32:46] [INFO ] Flatten gal took : 151 ms
[2022-05-16 02:32:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 641 labels/synchronizations in 23 ms.
[2022-05-16 02:32:46] [INFO ] Time to serialize gal into /tmp/LTL16986557344721622134.gal : 44 ms
[2022-05-16 02:32:46] [INFO ] Time to serialize properties into /tmp/LTL8545699824499353201.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16986557344721622134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8545699824499353201.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1698655...246
Read 1 LTL properties
Checking formula 0 : !((G(X((X(X(F((G("(i10.u265.TrainState_4_1_34==1)"))||("(i8.u92.TrainState_21_3_8==0)")))))||("(i17.u149.TrainState_30_0_0==1)")))))
Formula 0 simplified : !GX("(i17.u149.TrainState_30_0_0==1)" | XXF("(i8.u92.TrainState_21_3_8==0)" | G"(i10.u265.TrainState_4_1_34==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
26 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,0.480481,34144,1,0,1894,730,2625,1649,407,1399,7207
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-LTLFireability-09 finished in 57549 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G(!X(p0))) U (F(p0)||p0)))'
Support contains 1 out of 3960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6058 edges and 3960 vertex of which 3828 / 3960 are part of one of the 29 SCC in 3 ms
Free SCC test removed 3799 places
Ensure Unique test removed 5829 transitions
Reduce isomorphic transitions removed 5829 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 157 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 157 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 165 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 58 transition count 129
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 182 place count 54 transition count 124
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 189 place count 51 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 192 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 48 transition count 118
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 46 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 44 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 43 transition count 113
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 222 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 226 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 234 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 242 place count 32 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 246 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 250 place count 30 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 254 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 258 place count 28 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 262 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 266 place count 26 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 270 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 274 place count 24 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 278 place count 22 transition count 64
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 282 place count 22 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 286 place count 20 transition count 58
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 290 place count 20 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 294 place count 18 transition count 52
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 298 place count 18 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 302 place count 16 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 306 place count 16 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 310 place count 14 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 314 place count 14 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 318 place count 12 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 322 place count 12 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 326 place count 10 transition count 28
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 330 place count 10 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 334 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 338 place count 8 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 342 place count 6 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 346 place count 6 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 350 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 355 place count 4 transition count 5
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 357 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 357 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 359 place count 2 transition count 3
Applied a total of 359 rules in 33 ms. Remains 2 /3960 variables (removed 3958) and now considering 3/6060 (removed 6057) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:32:46] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:32:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:32:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-16 02:32:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-16 02:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 02:32:46] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3960 places, 3/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/3960 places, 3/6060 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-030-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-030-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-10 finished in 259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X((X(p0)||p1)) U X(p2))&&p1)))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 808 places :
Symmetric choice reduction at 0 with 808 rule applications. Total rules 2726 place count 2193 transition count 4293
Iterating global reduction 0 with 808 rules applied. Total rules applied 3534 place count 2193 transition count 4293
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3654 place count 2073 transition count 4173
Iterating global reduction 0 with 120 rules applied. Total rules applied 3774 place count 2073 transition count 4173
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3864 place count 1983 transition count 4083
Iterating global reduction 0 with 90 rules applied. Total rules applied 3954 place count 1983 transition count 4083
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4044 place count 1893 transition count 3993
Iterating global reduction 0 with 90 rules applied. Total rules applied 4134 place count 1893 transition count 3993
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4224 place count 1803 transition count 3903
Iterating global reduction 0 with 90 rules applied. Total rules applied 4314 place count 1803 transition count 3903
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4404 place count 1713 transition count 3813
Iterating global reduction 0 with 90 rules applied. Total rules applied 4494 place count 1713 transition count 3813
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4584 place count 1623 transition count 3723
Iterating global reduction 0 with 90 rules applied. Total rules applied 4674 place count 1623 transition count 3723
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4734 place count 1563 transition count 3663
Iterating global reduction 0 with 60 rules applied. Total rules applied 4794 place count 1563 transition count 3663
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4854 place count 1503 transition count 3603
Iterating global reduction 0 with 60 rules applied. Total rules applied 4914 place count 1503 transition count 3603
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4944 place count 1473 transition count 3573
Iterating global reduction 0 with 30 rules applied. Total rules applied 4974 place count 1473 transition count 3573
Applied a total of 4974 rules in 1013 ms. Remains 1473 /3960 variables (removed 2487) and now considering 3573/6060 (removed 2487) transitions.
// Phase 1: matrix 3573 rows 1473 cols
[2022-05-16 02:32:48] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 02:32:48] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 3573 rows 1473 cols
[2022-05-16 02:32:48] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:32:49] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
// Phase 1: matrix 3573 rows 1473 cols
[2022-05-16 02:32:49] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 02:32:51] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1473/3960 places, 3573/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 1473/3960 places, 3573/6060 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-030-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p0))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s721 1), p2:(EQ s53 1), p0:(EQ s720 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 653 ms.
Product exploration explored 100000 steps with 2 reset in 552 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 (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
Knowledge based reduction with 8 factoid took 476 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Finished random walk after 8178 steps, including 2 resets, run visited all 6 properties in 167 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (AND (NOT p2) p1) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 603 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 3573 rows 1473 cols
[2022-05-16 02:32:55] [INFO ] Computed 30 place invariants in 12 ms
[2022-05-16 02:32:56] [INFO ] [Real]Absence check using 30 positive place invariants in 2 ms returned unsat
Proved EG (NOT p2)
// Phase 1: matrix 3573 rows 1473 cols
[2022-05-16 02:32:56] [INFO ] Computed 30 place invariants in 10 ms
[2022-05-16 02:32:57] [INFO ] [Real]Absence check using 30 positive place invariants in 1 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (AND (NOT p2) p1) (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (G (NOT p2)), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 8 factoid took 232 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA BART-PT-030-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-030-LTLFireability-13 finished in 10455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U (X(G(p1))||p2))||G(p3)))'
Support contains 3 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 959 places :
Symmetric choice reduction at 0 with 959 rule applications. Total rules 959 place count 3001 transition count 5101
Iterating global reduction 0 with 959 rules applied. Total rules applied 1918 place count 3001 transition count 5101
Discarding 809 places :
Symmetric choice reduction at 0 with 809 rule applications. Total rules 2727 place count 2192 transition count 4292
Iterating global reduction 0 with 809 rules applied. Total rules applied 3536 place count 2192 transition count 4292
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 3655 place count 2073 transition count 4173
Iterating global reduction 0 with 119 rules applied. Total rules applied 3774 place count 2073 transition count 4173
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3863 place count 1984 transition count 4084
Iterating global reduction 0 with 89 rules applied. Total rules applied 3952 place count 1984 transition count 4084
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4041 place count 1895 transition count 3995
Iterating global reduction 0 with 89 rules applied. Total rules applied 4130 place count 1895 transition count 3995
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4219 place count 1806 transition count 3906
Iterating global reduction 0 with 89 rules applied. Total rules applied 4308 place count 1806 transition count 3906
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4397 place count 1717 transition count 3817
Iterating global reduction 0 with 89 rules applied. Total rules applied 4486 place count 1717 transition count 3817
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4575 place count 1628 transition count 3728
Iterating global reduction 0 with 89 rules applied. Total rules applied 4664 place count 1628 transition count 3728
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4723 place count 1569 transition count 3669
Iterating global reduction 0 with 59 rules applied. Total rules applied 4782 place count 1569 transition count 3669
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4841 place count 1510 transition count 3610
Iterating global reduction 0 with 59 rules applied. Total rules applied 4900 place count 1510 transition count 3610
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4929 place count 1481 transition count 3581
Iterating global reduction 0 with 29 rules applied. Total rules applied 4958 place count 1481 transition count 3581
Applied a total of 4958 rules in 664 ms. Remains 1481 /3960 variables (removed 2479) and now considering 3581/6060 (removed 2479) transitions.
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:32:58] [INFO ] Computed 30 place invariants in 18 ms
[2022-05-16 02:32:58] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:32:58] [INFO ] Computed 30 place invariants in 21 ms
[2022-05-16 02:32:59] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:32:59] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 02:33:00] [INFO ] Dead Transitions using invariants and state equation in 1515 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1481/3960 places, 3581/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 1481/3960 places, 3581/6060 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), true, p1, p2, (NOT p3), (AND p1 (NOT p3))]
Running random walk in product with property : BART-PT-030-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p1), acceptance={} source=5 dest: 2}, { cond=(AND p3 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s19 1), p2:(EQ s150 1), p3:(AND (EQ s19 1) (EQ s37 1)), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33903 reset in 2820 ms.
Product exploration explored 100000 steps with 33820 reset in 2565 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 p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p2 p3))), (X (NOT (AND p3 p1))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), true, (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 24 factoid took 1187 ms. Reduced automaton from 6 states, 15 edges and 4 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 166 ms :[p2, true, p1, p2]
Finished random walk after 213 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) p3))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND p2 p3))), (X (NOT (AND p3 p1))), (X (NOT (AND p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), true, (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (F (NOT (AND (NOT p2) p0))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2)]
Knowledge based reduction with 24 factoid took 1011 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[p2, true, p1, p2]
Stuttering acceptance computed with spot in 125 ms :[p2, true, p1, p2]
Support contains 3 out of 1481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1481/1481 places, 3581/3581 transitions.
Applied a total of 0 rules in 45 ms. Remains 1481 /1481 variables (removed 0) and now considering 3581/3581 (removed 0) transitions.
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:33:10] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:33:10] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:33:10] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-16 02:33:11] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:33:11] [INFO ] Computed 30 place invariants in 8 ms
[2022-05-16 02:33:13] [INFO ] Dead Transitions using invariants and state equation in 1380 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1481/1481 places, 3581/3581 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 150 ms :[p2, true, p1, p2]
Finished random walk after 273 steps, including 0 resets, run visited all 4 properties in 20 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (NOT (AND (NOT p2) p0))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2)]
Knowledge based reduction with 7 factoid took 434 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 155 ms :[p2, true, p1, p2]
Stuttering acceptance computed with spot in 153 ms :[p2, true, p1, p2]
Stuttering acceptance computed with spot in 144 ms :[p2, true, p1, p2]
Product exploration explored 100000 steps with 25330 reset in 3088 ms.
Product exploration explored 100000 steps with 25480 reset in 2818 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 127 ms :[p2, true, p1, p2]
Support contains 3 out of 1481 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1481/1481 places, 3581/3581 transitions.
Graph (trivial) has 3540 edges and 1481 vertex of which 1372 / 1481 are part of one of the 28 SCC in 2 ms
Free SCC test removed 1344 places
Ensure Unique test removed 3294 transitions
Reduce isomorphic transitions removed 3294 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 110 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 110 transition count 260
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 110 transition count 260
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 110 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 107 transition count 257
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 107 transition count 257
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 31 places in 1 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 68 place count 107 transition count 259
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 82 place count 107 transition count 245
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 106 place count 83 transition count 221
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 130 place count 83 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 83 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 83 transition count 217
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 81 transition count 215
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 81 transition count 215
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 81 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 81 transition count 211
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 79 transition count 209
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 79 transition count 209
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 79 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 156 place count 79 transition count 205
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 158 place count 77 transition count 203
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 77 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 162 place count 77 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 166 place count 77 transition count 199
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 168 place count 75 transition count 197
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 170 place count 75 transition count 197
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 172 place count 75 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 176 place count 75 transition count 193
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 178 place count 73 transition count 191
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 180 place count 73 transition count 191
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 182 place count 73 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 186 place count 73 transition count 187
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 188 place count 71 transition count 185
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 190 place count 71 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 192 place count 71 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 196 place count 71 transition count 181
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 198 place count 69 transition count 179
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 200 place count 69 transition count 179
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 202 place count 69 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 206 place count 69 transition count 175
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 208 place count 67 transition count 173
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 210 place count 67 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 212 place count 67 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 216 place count 67 transition count 169
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 218 place count 65 transition count 167
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 220 place count 65 transition count 167
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 222 place count 65 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 226 place count 65 transition count 163
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 228 place count 63 transition count 161
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 230 place count 63 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 232 place count 63 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 236 place count 63 transition count 157
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 238 place count 61 transition count 155
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 240 place count 61 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 242 place count 61 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 246 place count 61 transition count 151
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 248 place count 59 transition count 149
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 250 place count 59 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 252 place count 59 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 256 place count 59 transition count 145
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 258 place count 57 transition count 143
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 260 place count 57 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 262 place count 57 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 266 place count 57 transition count 139
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 268 place count 55 transition count 137
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 270 place count 55 transition count 137
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 272 place count 55 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 276 place count 55 transition count 133
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 278 place count 53 transition count 131
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 280 place count 53 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 282 place count 53 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 286 place count 53 transition count 127
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 288 place count 51 transition count 125
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 290 place count 51 transition count 125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 292 place count 51 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 296 place count 51 transition count 121
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 298 place count 49 transition count 119
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 300 place count 49 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 302 place count 49 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 306 place count 49 transition count 115
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 308 place count 47 transition count 113
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 310 place count 47 transition count 113
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 312 place count 47 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 316 place count 47 transition count 109
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 318 place count 45 transition count 107
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 320 place count 45 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 322 place count 45 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 326 place count 45 transition count 103
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 328 place count 43 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 330 place count 43 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 332 place count 43 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 336 place count 43 transition count 97
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 338 place count 41 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 340 place count 41 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 342 place count 41 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 346 place count 41 transition count 91
Discarding 2 places :
Symmetric choice reduction at 25 with 2 rule applications. Total rules 348 place count 39 transition count 89
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 350 place count 39 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 352 place count 39 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 356 place count 39 transition count 85
Discarding 2 places :
Symmetric choice reduction at 26 with 2 rule applications. Total rules 358 place count 37 transition count 83
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 360 place count 37 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 362 place count 37 transition count 83
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 366 place count 37 transition count 79
Discarding 2 places :
Symmetric choice reduction at 27 with 2 rule applications. Total rules 368 place count 35 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 370 place count 35 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 372 place count 35 transition count 77
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 376 place count 35 transition count 73
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 378 place count 33 transition count 71
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 380 place count 33 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 382 place count 33 transition count 71
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 386 place count 33 transition count 67
Discarding 2 places :
Symmetric choice reduction at 29 with 2 rule applications. Total rules 388 place count 31 transition count 65
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 390 place count 31 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 392 place count 31 transition count 65
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 396 place count 31 transition count 61
Discarding 2 places :
Symmetric choice reduction at 30 with 2 rule applications. Total rules 398 place count 29 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 400 place count 29 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 402 place count 29 transition count 59
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 406 place count 29 transition count 55
Discarding 2 places :
Symmetric choice reduction at 31 with 2 rule applications. Total rules 408 place count 27 transition count 53
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 410 place count 27 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 412 place count 27 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 416 place count 27 transition count 49
Discarding 2 places :
Symmetric choice reduction at 32 with 2 rule applications. Total rules 418 place count 25 transition count 47
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 420 place count 25 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 422 place count 25 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 426 place count 25 transition count 43
Discarding 2 places :
Symmetric choice reduction at 33 with 2 rule applications. Total rules 428 place count 23 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 430 place count 23 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 432 place count 23 transition count 41
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 436 place count 23 transition count 37
Discarding 2 places :
Symmetric choice reduction at 34 with 2 rule applications. Total rules 438 place count 21 transition count 35
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 440 place count 21 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 442 place count 21 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 446 place count 21 transition count 31
Discarding 2 places :
Symmetric choice reduction at 35 with 2 rule applications. Total rules 448 place count 19 transition count 29
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 450 place count 19 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 452 place count 19 transition count 29
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 456 place count 19 transition count 25
Discarding 2 places :
Symmetric choice reduction at 36 with 2 rule applications. Total rules 458 place count 17 transition count 23
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 460 place count 17 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 36 with 2 rules applied. Total rules applied 462 place count 17 transition count 23
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 466 place count 17 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 466 place count 17 transition count 19
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 467 place count 17 transition count 19
Discarding 6 places :
Symmetric choice reduction at 37 with 6 rule applications. Total rules 473 place count 11 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 6 rules applied. Total rules applied 479 place count 11 transition count 13
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 37 with 1 rules applied. Total rules applied 480 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 1 Pre rules applied. Total rules applied 480 place count 11 transition count 12
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 481 place count 11 transition count 12
Discarding 1 places :
Symmetric choice reduction at 37 with 1 rule applications. Total rules 482 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 37 with 1 rules applied. Total rules applied 483 place count 10 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 483 rules in 75 ms. Remains 10 /1481 variables (removed 1471) and now considering 11/3581 (removed 3570) transitions.
[2022-05-16 02:33:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 10 cols
[2022-05-16 02:33:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-16 02:33:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/1481 places, 11/3581 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/1481 places, 11/3581 transitions.
Product exploration explored 100000 steps with 25464 reset in 2255 ms.
Product exploration explored 100000 steps with 25471 reset in 2353 ms.
Built C files in :
/tmp/ltsmin13996358692490385720
[2022-05-16 02:33:26] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13996358692490385720
Running compilation step : cd /tmp/ltsmin13996358692490385720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13996358692490385720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin13996358692490385720;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 1481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1481/1481 places, 3581/3581 transitions.
Applied a total of 0 rules in 82 ms. Remains 1481 /1481 variables (removed 0) and now considering 3581/3581 (removed 0) transitions.
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:33:29] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 02:33:29] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:33:29] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-16 02:33:30] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
// Phase 1: matrix 3581 rows 1481 cols
[2022-05-16 02:33:30] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-16 02:33:33] [INFO ] Dead Transitions using invariants and state equation in 2222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1481/1481 places, 3581/3581 transitions.
Built C files in :
/tmp/ltsmin16881791095297304836
[2022-05-16 02:33:33] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16881791095297304836
Running compilation step : cd /tmp/ltsmin16881791095297304836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16881791095297304836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin16881791095297304836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-16 02:33:36] [INFO ] Flatten gal took : 62 ms
[2022-05-16 02:33:36] [INFO ] Flatten gal took : 56 ms
[2022-05-16 02:33:36] [INFO ] Time to serialize gal into /tmp/LTL1434153502687313056.gal : 30 ms
[2022-05-16 02:33:36] [INFO ] Time to serialize properties into /tmp/LTL1918313764825510175.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1434153502687313056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1918313764825510175.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1434153...266
Read 1 LTL properties
Checking formula 0 : !(((!(("(TrainState_20_0_0==1)")U((X(G("(TrainState_8_1_1==1)")))||("(TrainState_6_2_4==1)"))))||(G("((TrainState_20_0_0==1)&&(TrainSt...174
Formula 0 simplified : !(!("(TrainState_20_0_0==1)" U ("(TrainState_6_2_4==1)" | XG"(TrainState_8_1_1==1)")) | G"((TrainState_20_0_0==1)&&(TrainState_8_1_1...162
Detected timeout of ITS tools.
[2022-05-16 02:33:51] [INFO ] Flatten gal took : 83 ms
[2022-05-16 02:33:51] [INFO ] Applying decomposition
[2022-05-16 02:33:51] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2960083504774202413.txt' '-o' '/tmp/graph2960083504774202413.bin' '-w' '/tmp/graph2960083504774202413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2960083504774202413.bin' '-l' '-1' '-v' '-w' '/tmp/graph2960083504774202413.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:33:51] [INFO ] Decomposing Gal with order
[2022-05-16 02:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:33:52] [INFO ] Removed a total of 1157 redundant transitions.
[2022-05-16 02:33:52] [INFO ] Flatten gal took : 136 ms
[2022-05-16 02:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 644 labels/synchronizations in 11 ms.
[2022-05-16 02:33:52] [INFO ] Time to serialize gal into /tmp/LTL7479861465008780682.gal : 17 ms
[2022-05-16 02:33:52] [INFO ] Time to serialize properties into /tmp/LTL3516658817942518830.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7479861465008780682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3516658817942518830.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7479861...245
Read 1 LTL properties
Checking formula 0 : !(((!(("(i14.u141.TrainState_20_0_0==1)")U((X(G("(i3.u14.TrainState_8_1_1==1)")))||("(i25.u48.TrainState_6_2_4==1)"))))||(G("((i14.u14...214
Formula 0 simplified : !(!("(i14.u141.TrainState_20_0_0==1)" U ("(i25.u48.TrainState_6_2_4==1)" | XG"(i3.u14.TrainState_8_1_1==1)")) | G"((i14.u141.TrainSt...202
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
36 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,0.568763,34768,1,0,3690,1135,2630,4870,530,2203,10775
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-030-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-030-LTLFireability-14 finished in 55334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U X(!p1)))'
Support contains 4 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 957 places :
Symmetric choice reduction at 0 with 957 rule applications. Total rules 957 place count 3003 transition count 5103
Iterating global reduction 0 with 957 rules applied. Total rules applied 1914 place count 3003 transition count 5103
Discarding 807 places :
Symmetric choice reduction at 0 with 807 rule applications. Total rules 2721 place count 2196 transition count 4296
Iterating global reduction 0 with 807 rules applied. Total rules applied 3528 place count 2196 transition count 4296
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3648 place count 2076 transition count 4176
Iterating global reduction 0 with 120 rules applied. Total rules applied 3768 place count 2076 transition count 4176
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3857 place count 1987 transition count 4087
Iterating global reduction 0 with 89 rules applied. Total rules applied 3946 place count 1987 transition count 4087
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4034 place count 1899 transition count 3999
Iterating global reduction 0 with 88 rules applied. Total rules applied 4122 place count 1899 transition count 3999
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4210 place count 1811 transition count 3911
Iterating global reduction 0 with 88 rules applied. Total rules applied 4298 place count 1811 transition count 3911
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4386 place count 1723 transition count 3823
Iterating global reduction 0 with 88 rules applied. Total rules applied 4474 place count 1723 transition count 3823
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4561 place count 1636 transition count 3736
Iterating global reduction 0 with 87 rules applied. Total rules applied 4648 place count 1636 transition count 3736
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 4706 place count 1578 transition count 3678
Iterating global reduction 0 with 58 rules applied. Total rules applied 4764 place count 1578 transition count 3678
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 4821 place count 1521 transition count 3621
Iterating global reduction 0 with 57 rules applied. Total rules applied 4878 place count 1521 transition count 3621
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4907 place count 1492 transition count 3592
Iterating global reduction 0 with 29 rules applied. Total rules applied 4936 place count 1492 transition count 3592
Applied a total of 4936 rules in 856 ms. Remains 1492 /3960 variables (removed 2468) and now considering 3592/6060 (removed 2468) transitions.
// Phase 1: matrix 3592 rows 1492 cols
[2022-05-16 02:33:53] [INFO ] Computed 30 place invariants in 21 ms
[2022-05-16 02:33:53] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 3592 rows 1492 cols
[2022-05-16 02:33:53] [INFO ] Computed 30 place invariants in 22 ms
[2022-05-16 02:33:55] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
// Phase 1: matrix 3592 rows 1492 cols
[2022-05-16 02:33:55] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-16 02:33:56] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1492/3960 places, 3592/6060 transitions.
Finished structural reductions, in 1 iterations. Remains : 1492/3960 places, 3592/6060 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (AND p0 (NOT p1)), p0, (NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-030-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}]], initial=1, aps=[p0:(EQ s480 1), p1:(AND (OR (EQ s511 1) (EQ s43 1) (EQ s726 1)) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-030-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-030-LTLFireability-15 finished in 3827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||F((G((X(p1)&&p1))||G(p2)))))'
[2022-05-16 02:33:57] [INFO ] Flatten gal took : 166 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15786216848391300568
[2022-05-16 02:33:57] [INFO ] Too many transitions (6060) to apply POR reductions. Disabling POR matrices.
[2022-05-16 02:33:57] [INFO ] Applying decomposition
[2022-05-16 02:33:57] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15786216848391300568
Running compilation step : cd /tmp/ltsmin15786216848391300568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 02:33:57] [INFO ] Flatten gal took : 150 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2614003895825277858.txt' '-o' '/tmp/graph2614003895825277858.bin' '-w' '/tmp/graph2614003895825277858.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2614003895825277858.bin' '-l' '-1' '-v' '-w' '/tmp/graph2614003895825277858.weights' '-q' '0' '-e' '0.001'
[2022-05-16 02:33:57] [INFO ] Decomposing Gal with order
[2022-05-16 02:33:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:33:58] [INFO ] Removed a total of 678 redundant transitions.
[2022-05-16 02:33:59] [INFO ] Flatten gal took : 275 ms
[2022-05-16 02:34:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 25 ms.
[2022-05-16 02:34:02] [INFO ] Time to serialize gal into /tmp/LTLFireability10154690963522891969.gal : 38 ms
[2022-05-16 02:34:02] [INFO ] Time to serialize properties into /tmp/LTLFireability3315274313519853277.ltl : 19 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10154690963522891969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3315274313519853277.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((i0.i0.u9.TrainState_1_1_1==1)||(i19.i1.u10.TrainState_2_1_1==1))||((i9.i0.u11.TrainState_3_1_1==1)||(i18.i0.u12.TrainSt...233623
Formula 0 simplified : !(GF"((((((i0.i0.u9.TrainState_1_1_1==1)||(i19.i1.u10.TrainState_2_1_1==1))||((i9.i0.u11.TrainState_3_1_1==1)||(i18.i0.u12.TrainStat...233606
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 21026 ms.
Running link step : cd /tmp/ltsmin15786216848391300568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 107 ms.
Running LTSmin : cd /tmp/ltsmin15786216848391300568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((LTLAPp0==true)))||<>(([]((X((LTLAPp1==true))&&(LTLAPp1==true)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 02:56:56] [INFO ] Applying decomposition
[2022-05-16 02:56:56] [INFO ] Flatten gal took : 350 ms
[2022-05-16 02:56:56] [INFO ] Decomposing Gal with order
[2022-05-16 02:56:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 02:56:57] [INFO ] Removed a total of 777 redundant transitions.
[2022-05-16 02:56:58] [INFO ] Flatten gal took : 582 ms
[2022-05-16 02:56:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 63 ms.
[2022-05-16 02:56:58] [INFO ] Time to serialize gal into /tmp/LTLFireability9461795065457589110.gal : 77 ms
[2022-05-16 02:56:58] [INFO ] Time to serialize properties into /tmp/LTLFireability16674283608730578121.ltl : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9461795065457589110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16674283608730578121.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((G(F("((((((u4.TrainState_1_1_1==1)||(u206.TrainState_2_1_1==1))||((u407.TrainState_3_1_1==1)||(u408.TrainState_4_1_1==1)))||(((u40...192911
Formula 0 simplified : !(GF"((((((u4.TrainState_1_1_1==1)||(u206.TrainState_2_1_1==1))||((u407.TrainState_3_1_1==1)||(u408.TrainState_4_1_1==1)))||(((u409....192894
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
ITS-tools command line returned an error code 137
[2022-05-16 03:09:47] [INFO ] Flatten gal took : 477 ms
[2022-05-16 03:09:49] [INFO ] Input system was already deterministic with 6060 transitions.
[2022-05-16 03:09:49] [INFO ] Transformed 3960 places.
[2022-05-16 03:09:49] [INFO ] Transformed 6060 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 03:09:52] [INFO ] Time to serialize gal into /tmp/LTLFireability12178461891821598675.gal : 40 ms
[2022-05-16 03:09:52] [INFO ] Time to serialize properties into /tmp/LTLFireability3279518478362842003.ltl : 50 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12178461891821598675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3279518478362842003.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(F("((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1)|...163149
Formula 0 simplified : !(GF"((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1)||(...163132
ITS-tools command line returned an error code 137

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BART-PT-030"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BART-PT-030, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245689600628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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