Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110800756.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-PT-L00400M0040C020P020G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110800756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 334M
-rw-r--r-- 1 mcc users 4.8M Apr 30 20:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24M Apr 30 20:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11M Apr 30 18:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 36M Apr 30 18:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 889K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 3.4M May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0M May 9 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 13M May 9 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 568K May 9 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.6M May 9 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 235M 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 FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652729668213

Running Version 202205111006
[2022-05-16 19:34:29] [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 19:34:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:34:36] [INFO ] Load time of PNML (sax parser for PT used): 6591 ms
[2022-05-16 19:34:36] [INFO ] Transformed 537708 places.
[2022-05-16 19:34:37] [INFO ] Transformed 508489 transitions.
[2022-05-16 19:34:37] [INFO ] Parsed PT model containing 537708 places and 508489 transitions in 8598 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 333 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 106 places and 0 transitions.
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79469 out of 537602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 537602/537602 places, 508489/508489 transitions.
Reduce places removed 1339 places and 0 transitions.
Discarding 82205 places :
Implicit places reduction removed 82205 places
Iterating post reduction 0 with 83544 rules applied. Total rules applied 83544 place count 454058 transition count 508489
Discarding 4010 places :
Symmetric choice reduction at 1 with 4010 rule applications. Total rules 87554 place count 450048 transition count 500469
Iterating global reduction 1 with 4010 rules applied. Total rules applied 91564 place count 450048 transition count 500469
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 91574 place count 450038 transition count 496459
Iterating global reduction 1 with 10 rules applied. Total rules applied 91584 place count 450038 transition count 496459
Applied a total of 91584 rules in 92837 ms. Remains 450038 /537602 variables (removed 87564) and now considering 496459/508489 (removed 12030) transitions.
// Phase 1: matrix 496459 rows 450038 cols
[2022-05-16 19:38:33] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 19:39:05] [INFO ] Implicit Places using invariants in 152362 ms returned []
Implicit Place search using SMT only with invariants took 152391 ms to find 0 implicit places.
// Phase 1: matrix 496459 rows 450038 cols
[2022-05-16 19:41:05] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 19:41:36] [INFO ] Dead Transitions using invariants and state equation in 151481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 450038/537602 places, 496459/508489 transitions.
Finished structural reductions, in 1 iterations. Remains : 450038/537602 places, 496459/508489 transitions.
Support contains 79469 out of 450038 places after structural reductions.
[2022-05-16 19:41:55] [INFO ] Flatten gal took : 14076 ms
[2022-05-16 19:42:12] [INFO ] Flatten gal took : 13226 ms
[2022-05-16 19:42:39] [INFO ] Input system was already deterministic with 496459 transitions.
Support contains 79053 out of 450038 places (down from 79469) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9347 ms. (steps per millisecond=1 ) properties (out of 27) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=12 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=1 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=4 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=23 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=7 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
// Phase 1: matrix 496459 rows 450038 cols
[2022-05-16 19:44:57] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 19:44:59] [INFO ] Computed 30080 place invariants in 505853 ms
[2022-05-16 19:45:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 19:45:22] [INFO ] After 25065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 28907 out of 450038 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 450038/450038 places, 496459/496459 transitions.
Graph (complete) has 664457 edges and 450038 vertex of which 448836 are kept as prefixes of interest. Removing 1202 places using SCC suffix rule.628 ms
Discarding 1202 places :
Also discarding 1202 output transitions
Drop transitions removed 1202 transitions
Discarding 16441 places :
Implicit places reduction removed 16441 places
Drop transitions removed 243403 transitions
Trivial Post-agglo rules discarded 243403 transitions
Performed 243403 trivial Post agglomeration. Transition count delta: 243403
Iterating post reduction 0 with 259844 rules applied. Total rules applied 259845 place count 432395 transition count 251854
[2022-05-16 19:47:31] [INFO ] Computed 30080 place invariants in 506215 ms
Reduce places removed 243403 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 243404 rules applied. Total rules applied 503249 place count 188992 transition count 251853
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 503250 place count 188991 transition count 251853
Performed 19646 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19646 Pre rules applied. Total rules applied 503250 place count 188991 transition count 232207
Deduced a syphon composed of 19646 places in 289 ms
Ensure Unique test removed 1202 places
Reduce places removed 20848 places and 0 transitions.
Iterating global reduction 3 with 40494 rules applied. Total rules applied 543744 place count 168143 transition count 232207
Discarding 8422 places :
Implicit places reduction removed 8422 places
Iterating post reduction 3 with 8422 rules applied. Total rules applied 552166 place count 159721 transition count 232207
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 400 Pre rules applied. Total rules applied 552166 place count 159721 transition count 231807
Deduced a syphon composed of 400 places in 286 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 4 with 800 rules applied. Total rules applied 552966 place count 159321 transition count 231807
Performed 1804 Post agglomeration using F-continuation condition.
Performed 7178 Post agglomeration using F-continuation condition.
Performed 12372 Post agglomeration using F-continuation condition.
Performed 17651 Post agglomeration using F-continuation condition.
[2022-05-16 19:52:11] [INFO ] Computed 30080 place invariants in 554236 ms
Performed 23925 Post agglomeration using F-continuation condition.
Performed 26778 Post agglomeration using F-continuation condition.Transition count delta: 26778
Deduced a syphon composed of 26778 places in 200 ms
Reduce places removed 26778 places and 0 transitions.
Iterating global reduction 4 with 53556 rules applied. Total rules applied 606522 place count 132543 transition count 205029
Free-agglomeration rule (complex) applied 34866 times.
Iterating global reduction 4 with 34866 rules applied. Total rules applied 641388 place count 132543 transition count 409763
Ensure Unique test removed 802 places
Reduce places removed 35668 places and 0 transitions.
Iterating post reduction 4 with 35668 rules applied. Total rules applied 677056 place count 96875 transition count 409763
Discarding 80 places :
Symmetric choice reduction at 5 with 80 rule applications. Total rules 677136 place count 96795 transition count 225883
Iterating global reduction 5 with 80 rules applied. Total rules applied 677216 place count 96795 transition count 225883
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 677234 place count 96777 transition count 146845
Iterating global reduction 5 with 18 rules applied. Total rules applied 677252 place count 96777 transition count 146845
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 5 with 400 rules applied. Total rules applied 677652 place count 96777 transition count 305645
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 5 with 400 rules applied. Total rules applied 678052 place count 96377 transition count 305645
Discarding 7960 places :
Symmetric choice reduction at 6 with 7960 rule applications. Total rules 686012 place count 88417 transition count 138485
Iterating global reduction 6 with 7960 rules applied. Total rules applied 693972 place count 88417 transition count 138485
Applied a total of 693972 rules in 938851 ms. Remains 88417 /450038 variables (removed 361621) and now considering 138485/496459 (removed 357974) transitions.
Finished structural reductions, in 1 iterations. Remains : 88417/450038 places, 138485/496459 transitions.
Computed a total of 450038 stabilizing places and 496459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 450038 transition count 496459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 401 out of 450038 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450038/450038 places, 496459/496459 transitions.
Discarding 16441 places :
Implicit places reduction removed 16441 places
Iterating post reduction 0 with 16441 rules applied. Total rules applied 16441 place count 433597 transition count 496459
Applied a total of 16441 rules in 40050 ms. Remains 433597 /450038 variables (removed 16441) and now considering 496459/496459 (removed 0) transitions.
// Phase 1: matrix 496459 rows 433597 cols
[2022-05-16 20:03:44] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 20:04:15] [INFO ] Implicit Places using invariants in 151163 ms returned []
Implicit Place search using SMT only with invariants took 151165 ms to find 0 implicit places.
// Phase 1: matrix 496459 rows 433597 cols
[2022-05-16 20:06:10] [INFO ] Computed 13639 place invariants in 266301 ms
[2022-05-16 20:06:15] [WARNING] Invariant computation timed out after 120 seconds.
[2022-05-16 20:06:46] [INFO ] Dead Transitions using invariants and state equation in 151295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433597/450038 places, 496459/496459 transitions.
Finished structural reductions, in 1 iterations. Remains : 433597/450038 places, 496459/496459 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00400M0040C020P020G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s334945 1) (GEQ s335205 1) (GEQ s335270 1) (GEQ s335140 1) (GEQ s335010 1) (GEQ s335075 1) (GEQ s334961 1) (GEQ s335156 1) (GEQ s335221 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 48890 steps with 11 reset in 10002 ms.
Product exploration timeout after 50430 steps with 12 reset in 10001 ms.
Computed a total of 433597 stabilizing places and 496459 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 433597 transition count 496459
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Could not satisfy deadlock states : solver returned unknown
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2132 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8882 steps, run visited all 1 properties in 497 ms. (steps per millisecond=17 )
Probabilistic random walk after 8882 steps, saw 8863 distinct states, run finished after 521 ms. (steps per millisecond=17 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 496459 rows 433597 cols
[2022-05-16 20:08:59] [INFO ] Computed 13639 place invariants in 283720 ms
[2022-05-16 20:10:15] [WARNING] Invariant computation timed out after 120 seconds.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
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 20:10:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 401 out of 433597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433597/433597 places, 496459/496459 transitions.
Graph (complete) has 631575 edges and 433597 vertex of which 282746 are kept as prefixes of interest. Removing 150851 places using SCC suffix rule.1115 ms
Discarding 150851 places :
Also discarding 182476 output transitions
Drop transitions removed 182476 transitions
Reduce places removed 401 places and 401 transitions.
Drop transitions removed 230575 transitions
Trivial Post-agglo rules discarded 230575 transitions
Performed 230575 trivial Post agglomeration. Transition count delta: 230575
Iterating post reduction 0 with 230575 rules applied. Total rules applied 230576 place count 282345 transition count 83007
Reduce places removed 230575 places and 0 transitions.
Iterating post reduction 1 with 230575 rules applied. Total rules applied 461151 place count 51770 transition count 83007
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 461151 place count 51770 transition count 82606
Deduced a syphon composed of 401 places in 42 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 461953 place count 51369 transition count 82606
Performed 16441 Post agglomeration using F-continuation condition.Transition count delta: 16441
Deduced a syphon composed of 16441 places in 28 ms
Reduce places removed 16441 places and 0 transitions.
Iterating global reduction 2 with 32882 rules applied. Total rules applied 494835 place count 34928 transition count 66165
Applied a total of 494835 rules in 76280 ms. Remains 34928 /433597 variables (removed 398669) and now considering 66165/496459 (removed 430294) transitions.
// Phase 1: matrix 66165 rows 34928 cols
[2022-05-16 20:11:55] [INFO ] Computed 803 place invariants in 8484 ms
[2022-05-16 20:11:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 20:11:58] [INFO ] Implicit Places using invariants in 11336 ms returned []
Implicit Place search using SMT only with invariants took 11337 ms to find 0 implicit places.
// Phase 1: matrix 66165 rows 34928 cols
[2022-05-16 20:12:07] [INFO ] Computed 803 place invariants in 8454 ms
[2022-05-16 20:12:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 20:12:09] [INFO ] Dead Transitions using invariants and state equation in 11221 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34928/433597 places, 66165/496459 transitions.
Finished structural reductions, in 1 iterations. Remains : 34928/433597 places, 66165/496459 transitions.
Computed a total of 34928 stabilizing places and 66165 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34928 transition count 66165
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
[2022-05-16 20:12:39] [INFO ] Computed 13639 place invariants in 264185 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 450 steps, including 0 resets, run visited all 1 properties in 192 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 66165 rows 34928 cols
[2022-05-16 20:15:57] [INFO ] Computed 803 place invariants in 8674 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration timeout after 23790 steps with 51 reset in 10003 ms.
Product exploration timeout after 23270 steps with 50 reset in 10005 ms.
Built C files in :
/tmp/ltsmin16351201431726048164
[2022-05-16 20:16:32] [INFO ] Too many transitions (66165) to apply POR reductions. Disabling POR matrices.
[2022-05-16 20:16:33] [INFO ] Built C files in 606ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16351201431726048164
Running compilation step : cd /tmp/ltsmin16351201431726048164;'/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/ltsmin16351201431726048164;'/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/ltsmin16351201431726048164;'/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 401 out of 34928 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34928/34928 places, 66165/66165 transitions.
Applied a total of 0 rules in 2984 ms. Remains 34928 /34928 variables (removed 0) and now considering 66165/66165 (removed 0) transitions.
// Phase 1: matrix 66165 rows 34928 cols
[2022-05-16 20:16:48] [INFO ] Computed 803 place invariants in 8442 ms
[2022-05-16 20:16:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 20:16:50] [INFO ] Implicit Places using invariants in 11161 ms returned []
Implicit Place search using SMT only with invariants took 11162 ms to find 0 implicit places.
// Phase 1: matrix 66165 rows 34928 cols
[2022-05-16 20:16:59] [INFO ] Computed 803 place invariants in 8570 ms
[2022-05-16 20:17:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 20:17:02] [INFO ] Dead Transitions using invariants and state equation in 11556 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34928/34928 places, 66165/66165 transitions.
Built C files in :
/tmp/ltsmin9470927613254999136
[2022-05-16 20:17:02] [INFO ] Too many transitions (66165) to apply POR reductions. Disabling POR matrices.
[2022-05-16 20:17:02] [INFO ] Built C files in 449ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9470927613254999136
Running compilation step : cd /tmp/ltsmin9470927613254999136;'/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/ltsmin9470927613254999136;'/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/ltsmin9470927613254999136;'/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 20:17:54] [INFO ] Flatten gal took : 11937 ms
[2022-05-16 20:18:05] [INFO ] Flatten gal took : 2487 ms
[2022-05-16 20:18:10] [INFO ] Time to serialize gal into /tmp/LTL6367869353302070197.gal : 4708 ms
[2022-05-16 20:18:10] [INFO ] Time to serialize properties into /tmp/LTL15279451526708453136.ltl : 65 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/LTL6367869353302070197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15279451526708453136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

BK_STOP 1652732292862

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.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="FamilyReunion-PT-L00400M0040C020P020G001"
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 FamilyReunion-PT-L00400M0040C020P020G001, 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 r078-tall-165260110800756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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