/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:48:24,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:48:24,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:48:24,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:48:24,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:48:24,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:48:24,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:48:24,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:48:24,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:48:24,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:48:24,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:48:24,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:48:24,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:48:24,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:48:24,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:48:24,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:48:24,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:48:24,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:48:24,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:48:24,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:48:24,815 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:48:24,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:48:24,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:48:24,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:48:24,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:48:24,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:48:24,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:48:24,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:48:24,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:48:24,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:48:24,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:48:24,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:48:24,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:48:24,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:48:24,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:48:24,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:48:24,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:48:24,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:48:24,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:48:24,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:48:24,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:48:24,848 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:48:24,885 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:48:24,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:48:24,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:48:24,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:48:24,887 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:48:24,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:48:24,888 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:48:24,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:48:24,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:48:24,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:48:24,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:48:24,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:48:24,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:48:24,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:48:24,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:48:24,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:48:24,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:48:24,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:48:24,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:48:24,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:48:24,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:48:24,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:48:24,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:48:25,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:48:25,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:48:25,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:48:25,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:48:25,210 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:48:25,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-13 07:48:26,379 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:48:26,626 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:48:26,626 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c [2022-12-13 07:48:26,642 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66b8e626/9cfebfbb3a9640e2beaac53e8d905d20/FLAG64e50389a [2022-12-13 07:48:26,657 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b66b8e626/9cfebfbb3a9640e2beaac53e8d905d20 [2022-12-13 07:48:26,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:48:26,661 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:48:26,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:48:26,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:48:26,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:48:26,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:48:26" (1/1) ... [2022-12-13 07:48:26,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@682e0153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:26, skipping insertion in model container [2022-12-13 07:48:26,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:48:26" (1/1) ... [2022-12-13 07:48:26,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:48:26,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:48:26,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,920 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-12-13 07:48:26,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:48:26,943 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:48:26,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:48:26,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:48:26,994 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-2.wvr.c[5846,5859] [2022-12-13 07:48:27,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:48:27,010 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:48:27,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27 WrapperNode [2022-12-13 07:48:27,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:48:27,012 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:48:27,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:48:27,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:48:27,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,062 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 456 [2022-12-13 07:48:27,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:48:27,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:48:27,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:48:27,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:48:27,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,100 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:48:27,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:48:27,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:48:27,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:48:27,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (1/1) ... [2022-12-13 07:48:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:48:27,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:27,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:48:27,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:48:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:48:27,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:48:27,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:48:27,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:48:27,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:48:27,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:48:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:48:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:48:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:48:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:48:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 07:48:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 07:48:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:48:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:48:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:48:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:48:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:48:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:48:27,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:48:27,211 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:48:27,353 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:48:27,361 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:48:27,916 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:48:28,174 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:48:28,174 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 07:48:28,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:48:28 BoogieIcfgContainer [2022-12-13 07:48:28,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:48:28,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:48:28,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:48:28,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:48:28,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:48:26" (1/3) ... [2022-12-13 07:48:28,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d09791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:48:28, skipping insertion in model container [2022-12-13 07:48:28,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:48:27" (2/3) ... [2022-12-13 07:48:28,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d09791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:48:28, skipping insertion in model container [2022-12-13 07:48:28,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:48:28" (3/3) ... [2022-12-13 07:48:28,188 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2022-12-13 07:48:28,203 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:48:28,204 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:48:28,204 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:48:28,276 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 07:48:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 303 transitions, 638 flow [2022-12-13 07:48:28,412 INFO L130 PetriNetUnfolder]: 25/299 cut-off events. [2022-12-13 07:48:28,412 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:48:28,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 299 events. 25/299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-13 07:48:28,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 303 transitions, 638 flow [2022-12-13 07:48:28,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 275 places, 287 transitions, 598 flow [2022-12-13 07:48:28,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:28,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-13 07:48:28,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 275 places, 287 transitions, 598 flow [2022-12-13 07:48:28,498 INFO L130 PetriNetUnfolder]: 25/287 cut-off events. [2022-12-13 07:48:28,499 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:48:28,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 287 events. 25/287 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 179 event pairs, 0 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 261. Up to 2 conditions per place. [2022-12-13 07:48:28,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 275 places, 287 transitions, 598 flow [2022-12-13 07:48:28,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 2544 [2022-12-13 07:48:40,238 INFO L241 LiptonReduction]: Total number of compositions: 246 [2022-12-13 07:48:40,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:48:40,257 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@61faa2fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:48:40,257 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 07:48:40,265 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-13 07:48:40,265 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:48:40,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:40,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:40,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash 13481392, now seen corresponding path program 1 times [2022-12-13 07:48:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:40,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246565688] [2022-12-13 07:48:40,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:40,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246565688] [2022-12-13 07:48:40,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246565688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:40,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:40,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:48:40,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028867632] [2022-12-13 07:48:40,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:48:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:40,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:48:40,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:48:40,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 07:48:40,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 106 flow. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:40,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:40,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 07:48:40,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:41,465 INFO L130 PetriNetUnfolder]: 2346/3110 cut-off events. [2022-12-13 07:48:41,466 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2022-12-13 07:48:41,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 3110 events. 2346/3110 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11907 event pairs, 381 based on Foata normal form. 1/2317 useless extension candidates. Maximal degree in co-relation 5552. Up to 2810 conditions per place. [2022-12-13 07:48:41,486 INFO L137 encePairwiseOnDemand]: 35/41 looper letters, 58 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2022-12-13 07:48:41,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 301 flow [2022-12-13 07:48:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:48:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:48:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 07:48:41,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2022-12-13 07:48:41,503 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2022-12-13 07:48:41,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 64 transitions, 301 flow [2022-12-13 07:48:41,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 63 transitions, 294 flow [2022-12-13 07:48:41,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:41,527 INFO L89 Accepts]: Start accepts. Operand has 48 places, 63 transitions, 294 flow [2022-12-13 07:48:41,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:41,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:41,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 63 transitions, 294 flow [2022-12-13 07:48:41,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 63 transitions, 294 flow [2022-12-13 07:48:41,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:41,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:41,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 396 [2022-12-13 07:48:41,923 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 63 transitions, 294 flow [2022-12-13 07:48:41,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:41,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:41,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:41,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:48:41,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1846233153, now seen corresponding path program 1 times [2022-12-13 07:48:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:41,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010492892] [2022-12-13 07:48:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:42,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010492892] [2022-12-13 07:48:42,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010492892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:42,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:42,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:48:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308339887] [2022-12-13 07:48:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:42,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:48:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:48:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:48:42,152 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 07:48:42,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 63 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:42,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:42,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 07:48:42,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:42,764 INFO L130 PetriNetUnfolder]: 2945/4069 cut-off events. [2022-12-13 07:48:42,764 INFO L131 PetriNetUnfolder]: For 383/383 co-relation queries the response was YES. [2022-12-13 07:48:42,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12647 conditions, 4069 events. 2945/4069 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17725 event pairs, 447 based on Foata normal form. 208/3268 useless extension candidates. Maximal degree in co-relation 8223. Up to 3346 conditions per place. [2022-12-13 07:48:42,785 INFO L137 encePairwiseOnDemand]: 29/42 looper letters, 62 selfloop transitions, 2 changer transitions 83/147 dead transitions. [2022-12-13 07:48:42,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 147 transitions, 990 flow [2022-12-13 07:48:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:48:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:48:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 07:48:42,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2022-12-13 07:48:42,788 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-13 07:48:42,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 147 transitions, 990 flow [2022-12-13 07:48:42,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 64 transitions, 426 flow [2022-12-13 07:48:42,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:42,819 INFO L89 Accepts]: Start accepts. Operand has 50 places, 64 transitions, 426 flow [2022-12-13 07:48:42,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:42,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:42,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 64 transitions, 426 flow [2022-12-13 07:48:42,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 64 transitions, 426 flow [2022-12-13 07:48:42,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:44,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:44,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1882 [2022-12-13 07:48:44,700 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 63 transitions, 420 flow [2022-12-13 07:48:44,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:44,701 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:44,701 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:44,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:48:44,701 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:44,702 INFO L85 PathProgramCache]: Analyzing trace with hash -557203363, now seen corresponding path program 1 times [2022-12-13 07:48:44,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:44,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165817528] [2022-12-13 07:48:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:44,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165817528] [2022-12-13 07:48:44,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165817528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:44,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:44,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:48:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413156562] [2022-12-13 07:48:44,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:44,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:48:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:44,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:48:44,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:48:44,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 07:48:44,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 63 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:44,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:44,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 07:48:44,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:45,398 INFO L130 PetriNetUnfolder]: 2595/3490 cut-off events. [2022-12-13 07:48:45,398 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 07:48:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14288 conditions, 3490 events. 2595/3490 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13363 event pairs, 321 based on Foata normal form. 0/2642 useless extension candidates. Maximal degree in co-relation 11706. Up to 3491 conditions per place. [2022-12-13 07:48:45,424 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 83 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2022-12-13 07:48:45,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:48:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:48:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 07:48:45,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2022-12-13 07:48:45,428 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2022-12-13 07:48:45,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:45,457 INFO L89 Accepts]: Start accepts. Operand has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:45,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:45,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:45,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:45,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 463 [2022-12-13 07:48:45,920 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 86 transitions, 751 flow [2022-12-13 07:48:45,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:45,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:45,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:45,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:48:45,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:45,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash 237914969, now seen corresponding path program 1 times [2022-12-13 07:48:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:45,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693254776] [2022-12-13 07:48:45,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:46,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:46,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693254776] [2022-12-13 07:48:46,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693254776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:46,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:46,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:48:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221210451] [2022-12-13 07:48:46,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:48:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:48:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:48:46,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:46,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 86 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:46,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:46,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:46,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:46,515 INFO L130 PetriNetUnfolder]: 2162/2951 cut-off events. [2022-12-13 07:48:46,516 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-13 07:48:46,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15041 conditions, 2951 events. 2162/2951 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11151 event pairs, 293 based on Foata normal form. 0/2299 useless extension candidates. Maximal degree in co-relation 12514. Up to 2952 conditions per place. [2022-12-13 07:48:46,534 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 95 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2022-12-13 07:48:46,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:48:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:48:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 07:48:46,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2022-12-13 07:48:46,539 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2022-12-13 07:48:46,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:46,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:46,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:46,569 INFO L89 Accepts]: Start accepts. Operand has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:46,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:46,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:46,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:46,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:46,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:47,812 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 07:48:47,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1244 [2022-12-13 07:48:47,813 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 97 transitions, 1042 flow [2022-12-13 07:48:47,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:47,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:47,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:47,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:48:47,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1158882052, now seen corresponding path program 1 times [2022-12-13 07:48:47,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:47,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465428970] [2022-12-13 07:48:47,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:48,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:48,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:48,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465428970] [2022-12-13 07:48:48,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465428970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:48,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:48,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:48:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708127767] [2022-12-13 07:48:48,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:48,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:48:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:48,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:48:48,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:48:48,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:48,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 97 transitions, 1042 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:48,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:48,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:48,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:48,502 INFO L130 PetriNetUnfolder]: 2380/3237 cut-off events. [2022-12-13 07:48:48,502 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-13 07:48:48,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19739 conditions, 3237 events. 2380/3237 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12482 event pairs, 221 based on Foata normal form. 104/2607 useless extension candidates. Maximal degree in co-relation 17883. Up to 3238 conditions per place. [2022-12-13 07:48:48,522 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 92 selfloop transitions, 2 changer transitions 7/101 dead transitions. [2022-12-13 07:48:48,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 1281 flow [2022-12-13 07:48:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:48:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:48:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 07:48:48,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2022-12-13 07:48:48,527 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2022-12-13 07:48:48,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 101 transitions, 1281 flow [2022-12-13 07:48:48,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 94 transitions, 1188 flow [2022-12-13 07:48:48,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:48,563 INFO L89 Accepts]: Start accepts. Operand has 55 places, 94 transitions, 1188 flow [2022-12-13 07:48:48,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:48,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:48,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 94 transitions, 1188 flow [2022-12-13 07:48:48,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 94 transitions, 1188 flow [2022-12-13 07:48:48,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:49,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:49,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1268 [2022-12-13 07:48:49,831 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 94 transitions, 1200 flow [2022-12-13 07:48:49,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:49,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:49,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:48:49,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash -222873217, now seen corresponding path program 1 times [2022-12-13 07:48:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:49,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022933395] [2022-12-13 07:48:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:49,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022933395] [2022-12-13 07:48:49,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022933395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:49,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:49,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:48:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63319682] [2022-12-13 07:48:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:48:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:48:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:48:49,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 07:48:49,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 94 transitions, 1200 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:49,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:49,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 07:48:49,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:50,819 INFO L130 PetriNetUnfolder]: 3887/5415 cut-off events. [2022-12-13 07:48:50,820 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-12-13 07:48:50,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38444 conditions, 5415 events. 3887/5415 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24529 event pairs, 261 based on Foata normal form. 160/4618 useless extension candidates. Maximal degree in co-relation 20054. Up to 5416 conditions per place. [2022-12-13 07:48:50,846 INFO L137 encePairwiseOnDemand]: 38/46 looper letters, 89 selfloop transitions, 3 changer transitions 115/207 dead transitions. [2022-12-13 07:48:50,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 207 transitions, 3036 flow [2022-12-13 07:48:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:48:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:48:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 07:48:50,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4217391304347826 [2022-12-13 07:48:50,850 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2022-12-13 07:48:50,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 207 transitions, 3036 flow [2022-12-13 07:48:50,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 92 transitions, 1348 flow [2022-12-13 07:48:50,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:50,905 INFO L89 Accepts]: Start accepts. Operand has 58 places, 92 transitions, 1348 flow [2022-12-13 07:48:50,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:50,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:50,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 92 transitions, 1348 flow [2022-12-13 07:48:50,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 92 transitions, 1348 flow [2022-12-13 07:48:50,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:51,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:51,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 403 [2022-12-13 07:48:51,308 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 91 transitions, 1334 flow [2022-12-13 07:48:51,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:51,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:51,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:51,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:48:51,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:51,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:51,309 INFO L85 PathProgramCache]: Analyzing trace with hash -434244893, now seen corresponding path program 1 times [2022-12-13 07:48:51,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:51,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171042515] [2022-12-13 07:48:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:51,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:51,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171042515] [2022-12-13 07:48:51,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171042515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:51,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:51,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:48:51,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559762451] [2022-12-13 07:48:51,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:51,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:48:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:51,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:48:51,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:48:51,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:51,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 91 transitions, 1334 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:51,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:51,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:52,011 INFO L130 PetriNetUnfolder]: 2387/3321 cut-off events. [2022-12-13 07:48:52,011 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 07:48:52,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26912 conditions, 3321 events. 2387/3321 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 13121 event pairs, 165 based on Foata normal form. 76/2778 useless extension candidates. Maximal degree in co-relation 22885. Up to 3322 conditions per place. [2022-12-13 07:48:52,033 INFO L137 encePairwiseOnDemand]: 37/43 looper letters, 89 selfloop transitions, 3 changer transitions 51/143 dead transitions. [2022-12-13 07:48:52,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 143 transitions, 2390 flow [2022-12-13 07:48:52,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:48:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:48:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-13 07:48:52,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3581395348837209 [2022-12-13 07:48:52,035 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2022-12-13 07:48:52,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 143 transitions, 2390 flow [2022-12-13 07:48:52,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 92 transitions, 1532 flow [2022-12-13 07:48:52,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:52,071 INFO L89 Accepts]: Start accepts. Operand has 60 places, 92 transitions, 1532 flow [2022-12-13 07:48:52,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:52,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:52,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 92 transitions, 1532 flow [2022-12-13 07:48:52,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 92 transitions, 1532 flow [2022-12-13 07:48:52,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:52,526 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:52,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 457 [2022-12-13 07:48:52,527 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 91 transitions, 1516 flow [2022-12-13 07:48:52,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:52,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:52,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:52,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:48:52,528 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1321736077, now seen corresponding path program 1 times [2022-12-13 07:48:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:52,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384239948] [2022-12-13 07:48:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384239948] [2022-12-13 07:48:52,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384239948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:52,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:52,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:48:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147156776] [2022-12-13 07:48:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:52,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:48:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:48:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:48:52,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:52,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 91 transitions, 1516 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:52,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:52,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:52,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:53,342 INFO L130 PetriNetUnfolder]: 2389/3300 cut-off events. [2022-12-13 07:48:53,342 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 07:48:53,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30035 conditions, 3300 events. 2389/3300 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12917 event pairs, 126 based on Foata normal form. 56/2729 useless extension candidates. Maximal degree in co-relation 25716. Up to 3301 conditions per place. [2022-12-13 07:48:53,363 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 89 selfloop transitions, 3 changer transitions 37/129 dead transitions. [2022-12-13 07:48:53,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 2412 flow [2022-12-13 07:48:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:48:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:48:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-13 07:48:53,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28837209302325584 [2022-12-13 07:48:53,366 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-13 07:48:53,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 129 transitions, 2412 flow [2022-12-13 07:48:53,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 92 transitions, 1716 flow [2022-12-13 07:48:53,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:53,400 INFO L89 Accepts]: Start accepts. Operand has 62 places, 92 transitions, 1716 flow [2022-12-13 07:48:53,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:53,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:53,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 92 transitions, 1716 flow [2022-12-13 07:48:53,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 92 transitions, 1716 flow [2022-12-13 07:48:53,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:53,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:53,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 367 [2022-12-13 07:48:53,766 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 91 transitions, 1698 flow [2022-12-13 07:48:53,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:53,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:53,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:53,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:48:53,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 552124666, now seen corresponding path program 1 times [2022-12-13 07:48:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:53,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045941610] [2022-12-13 07:48:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:53,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:53,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:53,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045941610] [2022-12-13 07:48:54,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045941610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:54,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:54,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:48:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258737386] [2022-12-13 07:48:54,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:54,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:48:54,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:48:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:48:54,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:54,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 91 transitions, 1698 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:54,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:54,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:54,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:54,271 INFO L130 PetriNetUnfolder]: 1182/1595 cut-off events. [2022-12-13 07:48:54,271 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-13 07:48:54,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16020 conditions, 1595 events. 1182/1595 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4725 event pairs, 199 based on Foata normal form. 30/1235 useless extension candidates. Maximal degree in co-relation 15189. Up to 1596 conditions per place. [2022-12-13 07:48:54,282 INFO L137 encePairwiseOnDemand]: 40/43 looper letters, 64 selfloop transitions, 2 changer transitions 1/67 dead transitions. [2022-12-13 07:48:54,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 1364 flow [2022-12-13 07:48:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:48:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:48:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-13 07:48:54,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37209302325581395 [2022-12-13 07:48:54,284 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-13 07:48:54,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 67 transitions, 1364 flow [2022-12-13 07:48:54,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 66 transitions, 1344 flow [2022-12-13 07:48:54,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:54,304 INFO L89 Accepts]: Start accepts. Operand has 63 places, 66 transitions, 1344 flow [2022-12-13 07:48:54,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:54,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:54,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 66 transitions, 1344 flow [2022-12-13 07:48:54,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 66 transitions, 1344 flow [2022-12-13 07:48:54,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:54,314 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:54,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 07:48:54,316 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 1344 flow [2022-12-13 07:48:54,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:54,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:54,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:54,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 07:48:54,316 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:54,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:54,317 INFO L85 PathProgramCache]: Analyzing trace with hash 131338130, now seen corresponding path program 1 times [2022-12-13 07:48:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:54,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665213611] [2022-12-13 07:48:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:54,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665213611] [2022-12-13 07:48:54,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665213611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:54,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:54,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:48:54,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907761877] [2022-12-13 07:48:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:54,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:48:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:54,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:48:54,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:48:54,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:54,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 1344 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:54,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:54,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:55,153 INFO L130 PetriNetUnfolder]: 2508/3421 cut-off events. [2022-12-13 07:48:55,153 INFO L131 PetriNetUnfolder]: For 210/210 co-relation queries the response was YES. [2022-12-13 07:48:55,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37782 conditions, 3421 events. 2508/3421 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12351 event pairs, 287 based on Foata normal form. 36/2643 useless extension candidates. Maximal degree in co-relation 35348. Up to 3422 conditions per place. [2022-12-13 07:48:55,179 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 117 selfloop transitions, 17 changer transitions 0/134 dead transitions. [2022-12-13 07:48:55,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:48:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:48:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-12-13 07:48:55,181 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5290697674418605 [2022-12-13 07:48:55,181 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2022-12-13 07:48:55,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:55,225 INFO L89 Accepts]: Start accepts. Operand has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:55,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:55,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:55,235 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:48:55,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 07:48:55,236 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 134 transitions, 2996 flow [2022-12-13 07:48:55,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:55,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:55,236 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:55,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:48:55,237 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:55,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1016582752, now seen corresponding path program 1 times [2022-12-13 07:48:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:55,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304299555] [2022-12-13 07:48:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:55,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304299555] [2022-12-13 07:48:55,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304299555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:48:55,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912381293] [2022-12-13 07:48:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:55,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:48:55,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:48:55,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:48:55,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:48:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:55,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 07:48:55,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:48:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:48:55,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:48:55,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912381293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:55,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:48:55,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 07:48:55,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249991479] [2022-12-13 07:48:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:55,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:48:55,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:48:55,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:48:55,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:55,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 134 transitions, 2996 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:55,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:55,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:55,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:48:56,425 INFO L130 PetriNetUnfolder]: 2677/3735 cut-off events. [2022-12-13 07:48:56,425 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 07:48:56,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45004 conditions, 3735 events. 2677/3735 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13834 event pairs, 317 based on Foata normal form. 32/2914 useless extension candidates. Maximal degree in co-relation 38553. Up to 3736 conditions per place. [2022-12-13 07:48:56,546 INFO L137 encePairwiseOnDemand]: 32/43 looper letters, 133 selfloop transitions, 2 changer transitions 71/206 dead transitions. [2022-12-13 07:48:56,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 206 transitions, 5016 flow [2022-12-13 07:48:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:48:56,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:48:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-12-13 07:48:56,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3289036544850498 [2022-12-13 07:48:56,548 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2022-12-13 07:48:56,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 206 transitions, 5016 flow [2022-12-13 07:48:56,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 135 transitions, 3288 flow [2022-12-13 07:48:56,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:48:56,608 INFO L89 Accepts]: Start accepts. Operand has 68 places, 135 transitions, 3288 flow [2022-12-13 07:48:56,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:48:56,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:48:56,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 135 transitions, 3288 flow [2022-12-13 07:48:56,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 135 transitions, 3288 flow [2022-12-13 07:48:56,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:48:59,042 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:48:59,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2435 [2022-12-13 07:48:59,043 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 134 transitions, 3264 flow [2022-12-13 07:48:59,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:59,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:48:59,043 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:48:59,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:48:59,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 07:48:59,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:48:59,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:48:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1483800995, now seen corresponding path program 1 times [2022-12-13 07:48:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:48:59,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443682425] [2022-12-13 07:48:59,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:48:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:48:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:48:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:48:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:48:59,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443682425] [2022-12-13 07:48:59,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443682425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:48:59,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:48:59,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:48:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596759290] [2022-12-13 07:48:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:48:59,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:48:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:48:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:48:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:48:59,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:48:59,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 134 transitions, 3264 flow. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:48:59,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:48:59,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:48:59,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:00,234 INFO L130 PetriNetUnfolder]: 2677/3711 cut-off events. [2022-12-13 07:49:00,234 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 07:49:00,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48412 conditions, 3711 events. 2677/3711 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13661 event pairs, 302 based on Foata normal form. 28/2877 useless extension candidates. Maximal degree in co-relation 41758. Up to 3712 conditions per place. [2022-12-13 07:49:00,253 INFO L137 encePairwiseOnDemand]: 37/43 looper letters, 133 selfloop transitions, 2 changer transitions 55/190 dead transitions. [2022-12-13 07:49:00,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 190 transitions, 5000 flow [2022-12-13 07:49:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:49:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:49:00,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-13 07:49:00,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.313953488372093 [2022-12-13 07:49:00,255 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 26 predicate places. [2022-12-13 07:49:00,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 190 transitions, 5000 flow [2022-12-13 07:49:00,271 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 135 transitions, 3558 flow [2022-12-13 07:49:00,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:00,289 INFO L89 Accepts]: Start accepts. Operand has 69 places, 135 transitions, 3558 flow [2022-12-13 07:49:00,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:00,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:00,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 135 transitions, 3558 flow [2022-12-13 07:49:00,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 135 transitions, 3558 flow [2022-12-13 07:49:00,295 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:02,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:49:02,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2310 [2022-12-13 07:49:02,598 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 134 transitions, 3532 flow [2022-12-13 07:49:02,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:02,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:02,598 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:02,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 07:49:02,599 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1116799260, now seen corresponding path program 1 times [2022-12-13 07:49:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:02,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809425473] [2022-12-13 07:49:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809425473] [2022-12-13 07:49:03,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809425473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147497792] [2022-12-13 07:49:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:03,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:03,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:03,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:49:03,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:49:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:03,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 07:49:03,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 07:49:03,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:49:03,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147497792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:03,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:49:03,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-12-13 07:49:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121902222] [2022-12-13 07:49:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:03,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:03,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:03,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:49:03,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:49:03,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 134 transitions, 3532 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:03,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:03,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:49:03,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:04,284 INFO L130 PetriNetUnfolder]: 4351/6187 cut-off events. [2022-12-13 07:49:04,284 INFO L131 PetriNetUnfolder]: For 325/325 co-relation queries the response was YES. [2022-12-13 07:49:04,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86882 conditions, 6187 events. 4351/6187 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 27120 event pairs, 365 based on Foata normal form. 480/5296 useless extension candidates. Maximal degree in co-relation 44963. Up to 6188 conditions per place. [2022-12-13 07:49:04,316 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 132 selfloop transitions, 3 changer transitions 227/362 dead transitions. [2022-12-13 07:49:04,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 362 transitions, 10262 flow [2022-12-13 07:49:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:49:04,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:49:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2022-12-13 07:49:04,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43521594684385384 [2022-12-13 07:49:04,318 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 28 predicate places. [2022-12-13 07:49:04,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 362 transitions, 10262 flow [2022-12-13 07:49:04,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 135 transitions, 3828 flow [2022-12-13 07:49:04,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:04,378 INFO L89 Accepts]: Start accepts. Operand has 71 places, 135 transitions, 3828 flow [2022-12-13 07:49:04,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:04,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:04,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 135 transitions, 3828 flow [2022-12-13 07:49:04,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 135 transitions, 3828 flow [2022-12-13 07:49:04,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:04,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:49:04,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 480 [2022-12-13 07:49:04,858 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 134 transitions, 3800 flow [2022-12-13 07:49:04,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:04,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:04,859 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:04,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:49:05,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 07:49:05,064 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1319833857, now seen corresponding path program 1 times [2022-12-13 07:49:05,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:05,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472469623] [2022-12-13 07:49:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472469623] [2022-12-13 07:49:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472469623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:05,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:05,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:49:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106001271] [2022-12-13 07:49:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:05,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:49:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:49:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:49:05,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-13 07:49:05,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 134 transitions, 3800 flow. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:05,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:05,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-13 07:49:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:07,228 INFO L130 PetriNetUnfolder]: 6327/8703 cut-off events. [2022-12-13 07:49:07,228 INFO L131 PetriNetUnfolder]: For 566/566 co-relation queries the response was YES. [2022-12-13 07:49:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130920 conditions, 8703 events. 6327/8703 cut-off events. For 566/566 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 38658 event pairs, 758 based on Foata normal form. 0/6727 useless extension candidates. Maximal degree in co-relation 77074. Up to 8704 conditions per place. [2022-12-13 07:49:07,301 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 319 selfloop transitions, 16 changer transitions 4/339 dead transitions. [2022-12-13 07:49:07,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 339 transitions, 10302 flow [2022-12-13 07:49:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:49:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:49:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-12-13 07:49:07,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27906976744186046 [2022-12-13 07:49:07,303 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2022-12-13 07:49:07,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 339 transitions, 10302 flow [2022-12-13 07:49:07,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 335 transitions, 10182 flow [2022-12-13 07:49:07,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:07,409 INFO L89 Accepts]: Start accepts. Operand has 78 places, 335 transitions, 10182 flow [2022-12-13 07:49:07,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:07,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:07,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 335 transitions, 10182 flow [2022-12-13 07:49:07,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 335 transitions, 10182 flow [2022-12-13 07:49:07,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:08,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:49:08,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1487 [2022-12-13 07:49:08,896 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 334 transitions, 10152 flow [2022-12-13 07:49:08,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:08,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:08,896 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:08,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 07:49:08,897 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:08,897 INFO L85 PathProgramCache]: Analyzing trace with hash 628506860, now seen corresponding path program 1 times [2022-12-13 07:49:08,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:08,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341878531] [2022-12-13 07:49:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:08,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341878531] [2022-12-13 07:49:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341878531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:09,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:09,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140597051] [2022-12-13 07:49:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:09,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:09,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 07:49:09,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 334 transitions, 10152 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:09,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:09,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 07:49:09,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:11,878 INFO L130 PetriNetUnfolder]: 10917/15172 cut-off events. [2022-12-13 07:49:11,878 INFO L131 PetriNetUnfolder]: For 1130/1130 co-relation queries the response was YES. [2022-12-13 07:49:11,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243420 conditions, 15172 events. 10917/15172 cut-off events. For 1130/1130 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 75407 event pairs, 1356 based on Foata normal form. 0/11864 useless extension candidates. Maximal degree in co-relation 82216. Up to 15173 conditions per place. [2022-12-13 07:49:12,182 INFO L137 encePairwiseOnDemand]: 39/44 looper letters, 619 selfloop transitions, 16 changer transitions 18/653 dead transitions. [2022-12-13 07:49:12,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 653 transitions, 21160 flow [2022-12-13 07:49:12,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:49:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:49:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-13 07:49:12,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2022-12-13 07:49:12,184 INFO L295 CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places. [2022-12-13 07:49:12,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 653 transitions, 21160 flow [2022-12-13 07:49:12,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 635 transitions, 20584 flow [2022-12-13 07:49:12,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:12,359 INFO L89 Accepts]: Start accepts. Operand has 82 places, 635 transitions, 20584 flow [2022-12-13 07:49:12,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:12,369 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:12,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 635 transitions, 20584 flow [2022-12-13 07:49:12,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 635 transitions, 20584 flow [2022-12-13 07:49:12,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:12,384 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:12,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 07:49:12,385 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 635 transitions, 20584 flow [2022-12-13 07:49:12,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:12,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:12,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:12,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 07:49:12,386 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:12,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1319849758, now seen corresponding path program 1 times [2022-12-13 07:49:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:12,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322685419] [2022-12-13 07:49:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:17,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:17,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322685419] [2022-12-13 07:49:17,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322685419] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:17,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676013133] [2022-12-13 07:49:17,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:17,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:17,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:49:17,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:49:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:18,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 149 conjunts are in the unsatisfiable core [2022-12-13 07:49:18,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:18,188 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-12-13 07:49:18,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 43 [2022-12-13 07:49:18,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:49:18,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:49:18,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:49:18,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:49:18,253 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-12-13 07:49:18,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 47 [2022-12-13 07:49:18,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:49:18,366 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 07:49:18,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 07:49:18,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 07:49:18,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:49:18,560 INFO L321 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-12-13 07:49:18,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 33 [2022-12-13 07:49:18,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:49:18,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:49:19,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:49:19,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:49:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:21,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:57,706 WARN L233 SmtUtils]: Spent 16.30s on a formula simplification that was a NOOP. DAG size: 180 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:50:15,886 WARN L233 SmtUtils]: Spent 14.13s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:50:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:15,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676013133] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:15,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:15,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 53 [2022-12-13 07:50:15,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836141295] [2022-12-13 07:50:15,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:15,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-13 07:50:15,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:15,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 07:50:15,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=2520, Unknown=13, NotChecked=0, Total=2970 [2022-12-13 07:50:15,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 44 [2022-12-13 07:50:15,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 635 transitions, 20584 flow. Second operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:15,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:15,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 44 [2022-12-13 07:50:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:34,600 WARN L233 SmtUtils]: Spent 17.76s on a formula simplification. DAG size of input: 618 DAG size of output: 375 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:51:24,863 WARN L233 SmtUtils]: Spent 46.20s on a formula simplification. DAG size of input: 320 DAG size of output: 313 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:51:32,377 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 446 DAG size of output: 297 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:51:34,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:51:36,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:51:38,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:51:40,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:51:42,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:51:44,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:51:51,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:52:18,260 WARN L233 SmtUtils]: Spent 22.55s on a formula simplification. DAG size of input: 324 DAG size of output: 254 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:52:20,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:52:25,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:52:27,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:52:30,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:52:32,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:54:35,860 WARN L233 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 676 DAG size of output: 598 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:54:39,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:54:41,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:54:43,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:54:46,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:54:48,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:55:24,019 WARN L233 SmtUtils]: Spent 28.15s on a formula simplification. DAG size of input: 442 DAG size of output: 335 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:55:31,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:55:33,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:09,238 WARN L233 SmtUtils]: Spent 1.57m on a formula simplification. DAG size of input: 454 DAG size of output: 453 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:57:11,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:13,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:40,065 WARN L233 SmtUtils]: Spent 20.81s on a formula simplification. DAG size of input: 446 DAG size of output: 364 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:57:42,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:46,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:49,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:51,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:57:54,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:59:09,003 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-13 07:59:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 07:59:09,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-12-13 07:59:09,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:59:09,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:09,205 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 60 more [2022-12-13 07:59:09,209 INFO L158 Benchmark]: Toolchain (without parser) took 642547.49ms. Allocated memory was 182.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 158.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-13 07:59:09,209 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:59:09,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.55ms. Allocated memory is still 182.5MB. Free memory was 158.6MB in the beginning and 142.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-13 07:59:09,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.55ms. Allocated memory is still 182.5MB. Free memory was 142.3MB in the beginning and 139.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 07:59:09,210 INFO L158 Benchmark]: Boogie Preprocessor took 42.68ms. Allocated memory is still 182.5MB. Free memory was 139.2MB in the beginning and 136.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:59:09,210 INFO L158 Benchmark]: RCFGBuilder took 1074.45ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 136.6MB in the beginning and 164.1MB in the end (delta: -27.5MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2022-12-13 07:59:09,210 INFO L158 Benchmark]: TraceAbstraction took 641025.44ms. Allocated memory was 219.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 163.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-13 07:59:09,211 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 347.55ms. Allocated memory is still 182.5MB. Free memory was 158.6MB in the beginning and 142.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.55ms. Allocated memory is still 182.5MB. Free memory was 142.3MB in the beginning and 139.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.68ms. Allocated memory is still 182.5MB. Free memory was 139.2MB in the beginning and 136.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1074.45ms. Allocated memory was 182.5MB in the beginning and 219.2MB in the end (delta: 36.7MB). Free memory was 136.6MB in the beginning and 164.1MB in the end (delta: -27.5MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. * TraceAbstraction took 641025.44ms. Allocated memory was 219.2MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 163.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 275 PlacesBefore, 46 PlacesAfterwards, 287 TransitionsBefore, 41 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 192 TrivialYvCompositions, 37 ConcurrentYvCompositions, 17 ChoiceCompositions, 246 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 1300, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1348, independent: 1300, independent conditional: 0, independent unconditional: 1300, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1268, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1268, independent: 1236, independent conditional: 0, independent unconditional: 1236, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1348, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 1268, unknown conditional: 0, unknown unconditional: 1268] , Statistics on independence cache: Total cache size (in pairs): 1891, Positive cache size: 1871, Positive conditional cache size: 0, Positive unconditional cache size: 1871, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 48 PlacesBefore, 48 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 50 PlacesBefore, 49 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 51 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 53 PlacesBefore, 53 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 55 PlacesBefore, 55 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 58 PlacesBefore, 57 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 60 PlacesBefore, 59 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 62 PlacesBefore, 61 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 68 PlacesBefore, 67 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 69 PlacesBefore, 68 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 71 PlacesBefore, 70 PlacesAfterwards, 135 TransitionsBefore, 134 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 78 PlacesBefore, 77 PlacesAfterwards, 335 TransitionsBefore, 334 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 82 PlacesBefore, 82 PlacesAfterwards, 635 TransitionsBefore, 635 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...