/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:15:33,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:15:33,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:15:33,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:15:33,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:15:33,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:15:33,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:15:33,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:15:33,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:15:33,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:15:33,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:15:33,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:15:33,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:15:33,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:15:33,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:15:33,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:15:33,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:15:34,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:15:34,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:15:34,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:15:34,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:15:34,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:15:34,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:15:34,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:15:34,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:15:34,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:15:34,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:15:34,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:15:34,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:15:34,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:15:34,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:15:34,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:15:34,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:15:34,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:15:34,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:15:34,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:15:34,020 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:15:34,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:15:34,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:15:34,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:15:34,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:15:34,025 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 03:15:34,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:15:34,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:15:34,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:15:34,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:15:34,057 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:15:34,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:15:34,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:15:34,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:15:34,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:15:34,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:15:34,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:15:34,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:15:34,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:15:34,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:15:34,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:15:34,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:15:34,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:15:34,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:15:34,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:15:34,060 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:15:34,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:15:34,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:15:34,060 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 [2022-12-13 03:15:34,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:15:34,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:15:34,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:15:34,352 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:15:34,352 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:15:34,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2022-12-13 03:15:35,295 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:15:35,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:15:35,516 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i [2022-12-13 03:15:35,531 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1613a7b03/d4677ca746b54459aecea5b5f3a86050/FLAGc6ef5a9f9 [2022-12-13 03:15:35,548 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1613a7b03/d4677ca746b54459aecea5b5f3a86050 [2022-12-13 03:15:35,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:15:35,552 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:15:35,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:15:35,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:15:35,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:15:35,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:35,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6b7924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35, skipping insertion in model container [2022-12-13 03:15:35,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:35,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:15:35,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:15:35,737 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i[945,958] [2022-12-13 03:15:35,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:15:35,898 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:15:35,908 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_tso.i[945,958] [2022-12-13 03:15:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:15:35,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:15:35,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:15:35,985 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:15:35,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35 WrapperNode [2022-12-13 03:15:35,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:15:35,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:15:35,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:15:35,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:15:35,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,017 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-12-13 03:15:36,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:15:36,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:15:36,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:15:36,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:15:36,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,036 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:15:36,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:15:36,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:15:36,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:15:36,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (1/1) ... [2022-12-13 03:15:36,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:15:36,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:15:36,071 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 03:15:36,075 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 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:15:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:15:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:15:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:15:36,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:15:36,100 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 03:15:36,238 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:15:36,240 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:15:36,387 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:15:36,391 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:15:36,391 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:15:36,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:15:36 BoogieIcfgContainer [2022-12-13 03:15:36,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:15:36,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:15:36,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:15:36,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:15:36,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:15:35" (1/3) ... [2022-12-13 03:15:36,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f2bd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:15:36, skipping insertion in model container [2022-12-13 03:15:36,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:15:35" (2/3) ... [2022-12-13 03:15:36,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15f2bd0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:15:36, skipping insertion in model container [2022-12-13 03:15:36,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:15:36" (3/3) ... [2022-12-13 03:15:36,398 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_tso.i [2022-12-13 03:15:36,411 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:15:36,411 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:15:36,411 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:15:36,466 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:15:36,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 82 transitions, 179 flow [2022-12-13 03:15:36,547 INFO L130 PetriNetUnfolder]: 2/79 cut-off events. [2022-12-13 03:15:36,547 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:15:36,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 79 events. 2/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-13 03:15:36,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 82 transitions, 179 flow [2022-12-13 03:15:36,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 67 transitions, 143 flow [2022-12-13 03:15:36,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:36,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 67 transitions, 143 flow [2022-12-13 03:15:36,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 67 transitions, 143 flow [2022-12-13 03:15:36,600 INFO L130 PetriNetUnfolder]: 1/67 cut-off events. [2022-12-13 03:15:36,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:15:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 67 events. 1/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-13 03:15:36,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 67 transitions, 143 flow [2022-12-13 03:15:36,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-13 03:15:38,217 INFO L241 LiptonReduction]: Total number of compositions: 51 [2022-12-13 03:15:38,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:15:38,232 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;@7fde88ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:15:38,232 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:15:38,235 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-13 03:15:38,235 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:15:38,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:38,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:38,236 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 1 more)] === [2022-12-13 03:15:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash 700814117, now seen corresponding path program 1 times [2022-12-13 03:15:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:38,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331452045] [2022-12-13 03:15:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:38,614 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 03:15:38,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:38,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331452045] [2022-12-13 03:15:38,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331452045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:38,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:38,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:15:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458730846] [2022-12-13 03:15:38,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:38,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:15:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:15:38,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:15:38,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 03:15:38,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 03:15:38,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:38,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 03:15:38,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:38,848 INFO L130 PetriNetUnfolder]: 1006/1703 cut-off events. [2022-12-13 03:15:38,848 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 03:15:38,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1703 events. 1006/1703 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9378 event pairs, 372 based on Foata normal form. 85/1402 useless extension candidates. Maximal degree in co-relation 3348. Up to 861 conditions per place. [2022-12-13 03:15:38,857 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 29 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2022-12-13 03:15:38,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:15:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:15:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 03:15:38,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2022-12-13 03:15:38,867 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-13 03:15:38,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,872 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:38,879 INFO L89 Accepts]: Start accepts. Operand has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:38,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:38,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 03:15:38,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:15:38,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 95 [2022-12-13 03:15:38,973 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 167 flow [2022-12-13 03:15:38,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 03:15:38,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:38,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:38,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:15:38,974 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 1 more)] === [2022-12-13 03:15:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 250400585, now seen corresponding path program 1 times [2022-12-13 03:15:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:38,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531451661] [2022-12-13 03:15:38,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:39,048 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 03:15:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:39,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531451661] [2022-12-13 03:15:39,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531451661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:39,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:39,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:15:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051265991] [2022-12-13 03:15:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:39,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:39,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 03:15:39,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 03:15:39,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:39,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 03:15:39,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:39,180 INFO L130 PetriNetUnfolder]: 933/1623 cut-off events. [2022-12-13 03:15:39,181 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 03:15:39,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4659 conditions, 1623 events. 933/1623 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 9226 event pairs, 90 based on Foata normal form. 32/1284 useless extension candidates. Maximal degree in co-relation 4645. Up to 778 conditions per place. [2022-12-13 03:15:39,189 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 42 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-12-13 03:15:39,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 321 flow [2022-12-13 03:15:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-13 03:15:39,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-13 03:15:39,192 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-13 03:15:39,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 55 transitions, 321 flow [2022-12-13 03:15:39,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 55 transitions, 321 flow [2022-12-13 03:15:39,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:39,208 INFO L89 Accepts]: Start accepts. Operand has 40 places, 55 transitions, 321 flow [2022-12-13 03:15:39,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:39,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:39,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 55 transitions, 321 flow [2022-12-13 03:15:39,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 55 transitions, 321 flow [2022-12-13 03:15:39,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 312 [2022-12-13 03:15:39,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:15:39,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 03:15:39,275 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 55 transitions, 325 flow [2022-12-13 03:15:39,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 03:15:39,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:39,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:39,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:15:39,276 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 1 more)] === [2022-12-13 03:15:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 250399934, now seen corresponding path program 1 times [2022-12-13 03:15:39,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:39,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598319846] [2022-12-13 03:15:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:39,410 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 03:15:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:39,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598319846] [2022-12-13 03:15:39,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598319846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:39,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:39,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:15:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594087509] [2022-12-13 03:15:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:39,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:39,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:39,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2022-12-13 03:15:39,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 55 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 03:15:39,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:39,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2022-12-13 03:15:39,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:39,551 INFO L130 PetriNetUnfolder]: 827/1509 cut-off events. [2022-12-13 03:15:39,551 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:15:39,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5666 conditions, 1509 events. 827/1509 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8962 event pairs, 39 based on Foata normal form. 10/1152 useless extension candidates. Maximal degree in co-relation 5649. Up to 748 conditions per place. [2022-12-13 03:15:39,559 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 55 selfloop transitions, 15 changer transitions 0/76 dead transitions. [2022-12-13 03:15:39,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 03:15:39,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2022-12-13 03:15:39,563 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-13 03:15:39,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:39,583 INFO L89 Accepts]: Start accepts. Operand has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:39,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:39,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-13 03:15:39,595 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:39,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:15:39,596 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 76 transitions, 596 flow [2022-12-13 03:15:39,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 03:15:39,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:39,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:39,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:15:39,597 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 1 more)] === [2022-12-13 03:15:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash -827523436, now seen corresponding path program 1 times [2022-12-13 03:15:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:39,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854482553] [2022-12-13 03:15:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:39,695 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 03:15:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:39,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854482553] [2022-12-13 03:15:39,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854482553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:39,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:39,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:15:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982037474] [2022-12-13 03:15:39,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:39,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:39,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:39,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:39,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 03:15:39,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 76 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 03:15:39,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:39,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 03:15:39,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:39,841 INFO L130 PetriNetUnfolder]: 804/1471 cut-off events. [2022-12-13 03:15:39,841 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:15:39,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6849 conditions, 1471 events. 804/1471 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 8670 event pairs, 39 based on Foata normal form. 6/1117 useless extension candidates. Maximal degree in co-relation 6829. Up to 728 conditions per place. [2022-12-13 03:15:39,849 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 62 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2022-12-13 03:15:39,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 03:15:39,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 03:15:39,853 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-13 03:15:39,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:39,869 INFO L89 Accepts]: Start accepts. Operand has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:39,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:39,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-13 03:15:39,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:39,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 03:15:39,882 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 87 transitions, 849 flow [2022-12-13 03:15:39,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 03:15:39,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:39,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:39,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:15:39,883 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 1 more)] === [2022-12-13 03:15:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 116730768, now seen corresponding path program 1 times [2022-12-13 03:15:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:39,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464843354] [2022-12-13 03:15:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:39,967 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 03:15:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:39,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464843354] [2022-12-13 03:15:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464843354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:39,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:39,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:15:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339789538] [2022-12-13 03:15:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:39,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:39,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 03:15:39,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 87 transitions, 849 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 03:15:39,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:39,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 03:15:39,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:40,100 INFO L130 PetriNetUnfolder]: 886/1643 cut-off events. [2022-12-13 03:15:40,100 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-13 03:15:40,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9192 conditions, 1643 events. 886/1643 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9977 event pairs, 72 based on Foata normal form. 24/1221 useless extension candidates. Maximal degree in co-relation 9169. Up to 763 conditions per place. [2022-12-13 03:15:40,109 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 68 selfloop transitions, 19 changer transitions 5/98 dead transitions. [2022-12-13 03:15:40,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 98 transitions, 1143 flow [2022-12-13 03:15:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 03:15:40,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7115384615384616 [2022-12-13 03:15:40,111 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2022-12-13 03:15:40,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 98 transitions, 1143 flow [2022-12-13 03:15:40,118 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 93 transitions, 1083 flow [2022-12-13 03:15:40,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:40,132 INFO L89 Accepts]: Start accepts. Operand has 49 places, 93 transitions, 1083 flow [2022-12-13 03:15:40,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:40,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:40,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 93 transitions, 1083 flow [2022-12-13 03:15:40,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 93 transitions, 1083 flow [2022-12-13 03:15:40,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 03:15:40,137 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:40,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:15:40,138 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 93 transitions, 1083 flow [2022-12-13 03:15:40,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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 03:15:40,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:40,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:40,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:15:40,139 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 1 more)] === [2022-12-13 03:15:40,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash 116769208, now seen corresponding path program 1 times [2022-12-13 03:15:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:40,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328904458] [2022-12-13 03:15:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:40,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:40,232 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 03:15:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328904458] [2022-12-13 03:15:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328904458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:40,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:40,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:15:40,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109826737] [2022-12-13 03:15:40,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:40,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:40,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:40,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 03:15:40,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 93 transitions, 1083 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 03:15:40,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:40,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 03:15:40,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:40,464 INFO L130 PetriNetUnfolder]: 1555/2729 cut-off events. [2022-12-13 03:15:40,464 INFO L131 PetriNetUnfolder]: For 3713/3745 co-relation queries the response was YES. [2022-12-13 03:15:40,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15889 conditions, 2729 events. 1555/2729 cut-off events. For 3713/3745 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 17764 event pairs, 266 based on Foata normal form. 135/2188 useless extension candidates. Maximal degree in co-relation 15863. Up to 1690 conditions per place. [2022-12-13 03:15:40,477 INFO L137 encePairwiseOnDemand]: 13/26 looper letters, 86 selfloop transitions, 36 changer transitions 99/235 dead transitions. [2022-12-13 03:15:40,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 235 transitions, 3151 flow [2022-12-13 03:15:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:15:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:15:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 03:15:40,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2022-12-13 03:15:40,481 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-13 03:15:40,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 235 transitions, 3151 flow [2022-12-13 03:15:40,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 136 transitions, 1825 flow [2022-12-13 03:15:40,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:40,508 INFO L89 Accepts]: Start accepts. Operand has 51 places, 136 transitions, 1825 flow [2022-12-13 03:15:40,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:40,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:40,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 136 transitions, 1825 flow [2022-12-13 03:15:40,513 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 136 transitions, 1825 flow [2022-12-13 03:15:40,513 INFO L226 LiptonReduction]: Number of co-enabled transitions 272 [2022-12-13 03:15:40,514 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:40,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:15:40,515 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 136 transitions, 1825 flow [2022-12-13 03:15:40,515 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 03:15:40,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:40,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:40,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:15:40,515 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 1 more)] === [2022-12-13 03:15:40,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:40,519 INFO L85 PathProgramCache]: Analyzing trace with hash 99028564, now seen corresponding path program 1 times [2022-12-13 03:15:40,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:40,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927040049] [2022-12-13 03:15:40,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:40,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:40,599 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 03:15:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:40,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927040049] [2022-12-13 03:15:40,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927040049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:40,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:40,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:15:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128598029] [2022-12-13 03:15:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:40,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 03:15:40,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 136 transitions, 1825 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 03:15:40,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:40,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 03:15:40,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:40,757 INFO L130 PetriNetUnfolder]: 861/1597 cut-off events. [2022-12-13 03:15:40,758 INFO L131 PetriNetUnfolder]: For 2690/2816 co-relation queries the response was YES. [2022-12-13 03:15:40,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10900 conditions, 1597 events. 861/1597 cut-off events. For 2690/2816 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 9790 event pairs, 37 based on Foata normal form. 82/1307 useless extension candidates. Maximal degree in co-relation 10871. Up to 1429 conditions per place. [2022-12-13 03:15:40,766 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 78 selfloop transitions, 55 changer transitions 18/164 dead transitions. [2022-12-13 03:15:40,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 164 transitions, 2490 flow [2022-12-13 03:15:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 03:15:40,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7019230769230769 [2022-12-13 03:15:40,767 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2022-12-13 03:15:40,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 164 transitions, 2490 flow [2022-12-13 03:15:40,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 146 transitions, 2206 flow [2022-12-13 03:15:40,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:40,782 INFO L89 Accepts]: Start accepts. Operand has 54 places, 146 transitions, 2206 flow [2022-12-13 03:15:40,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:40,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:40,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 146 transitions, 2206 flow [2022-12-13 03:15:40,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 146 transitions, 2206 flow [2022-12-13 03:15:40,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-13 03:15:40,788 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:40,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:15:40,788 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 146 transitions, 2206 flow [2022-12-13 03:15:40,788 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 03:15:40,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:40,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:40,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:15:40,789 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 1 more)] === [2022-12-13 03:15:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1852630993, now seen corresponding path program 1 times [2022-12-13 03:15:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:40,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061471211] [2022-12-13 03:15:40,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:40,861 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 03:15:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:40,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061471211] [2022-12-13 03:15:40,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061471211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:40,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:40,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:15:40,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158317317] [2022-12-13 03:15:40,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:40,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:40,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 03:15:40,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 146 transitions, 2206 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 03:15:40,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:40,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 03:15:40,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:41,024 INFO L130 PetriNetUnfolder]: 808/1674 cut-off events. [2022-12-13 03:15:41,024 INFO L131 PetriNetUnfolder]: For 3556/3631 co-relation queries the response was YES. [2022-12-13 03:15:41,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12284 conditions, 1674 events. 808/1674 cut-off events. For 3556/3631 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 11842 event pairs, 27 based on Foata normal form. 148/1417 useless extension candidates. Maximal degree in co-relation 12252. Up to 1515 conditions per place. [2022-12-13 03:15:41,034 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 113 selfloop transitions, 25 changer transitions 28/178 dead transitions. [2022-12-13 03:15:41,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 178 transitions, 3046 flow [2022-12-13 03:15:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 03:15:41,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2022-12-13 03:15:41,035 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2022-12-13 03:15:41,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 178 transitions, 3046 flow [2022-12-13 03:15:41,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 150 transitions, 2562 flow [2022-12-13 03:15:41,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:41,060 INFO L89 Accepts]: Start accepts. Operand has 57 places, 150 transitions, 2562 flow [2022-12-13 03:15:41,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:41,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:41,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 150 transitions, 2562 flow [2022-12-13 03:15:41,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 150 transitions, 2562 flow [2022-12-13 03:15:41,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-13 03:15:41,066 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:41,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 03:15:41,067 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 150 transitions, 2562 flow [2022-12-13 03:15:41,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 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 03:15:41,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:41,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:41,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:15:41,068 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 1 more)] === [2022-12-13 03:15:41,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -453644973, now seen corresponding path program 1 times [2022-12-13 03:15:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:41,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970756810] [2022-12-13 03:15:41,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:41,135 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 03:15:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:41,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970756810] [2022-12-13 03:15:41,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970756810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:41,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:41,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:15:41,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051376072] [2022-12-13 03:15:41,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:41,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:15:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:41,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:15:41,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:15:41,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 03:15:41,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 150 transitions, 2562 flow. Second operand has 5 states, 5 states have (on average 7.4) 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 03:15:41,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:41,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 03:15:41,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:41,279 INFO L130 PetriNetUnfolder]: 508/1077 cut-off events. [2022-12-13 03:15:41,279 INFO L131 PetriNetUnfolder]: For 2892/3070 co-relation queries the response was YES. [2022-12-13 03:15:41,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9031 conditions, 1077 events. 508/1077 cut-off events. For 2892/3070 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6859 event pairs, 0 based on Foata normal form. 137/960 useless extension candidates. Maximal degree in co-relation 8996. Up to 971 conditions per place. [2022-12-13 03:15:41,284 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 33 selfloop transitions, 52 changer transitions 60/150 dead transitions. [2022-12-13 03:15:41,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 150 transitions, 2844 flow [2022-12-13 03:15:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:15:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:15:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-13 03:15:41,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 03:15:41,285 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2022-12-13 03:15:41,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 150 transitions, 2844 flow [2022-12-13 03:15:41,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 90 transitions, 1677 flow [2022-12-13 03:15:41,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:41,297 INFO L89 Accepts]: Start accepts. Operand has 59 places, 90 transitions, 1677 flow [2022-12-13 03:15:41,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:41,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:41,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 90 transitions, 1677 flow [2022-12-13 03:15:41,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 90 transitions, 1677 flow [2022-12-13 03:15:41,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 03:15:41,301 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:41,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 03:15:41,301 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 90 transitions, 1677 flow [2022-12-13 03:15:41,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) 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 03:15:41,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:41,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:41,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:15:41,302 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 1 more)] === [2022-12-13 03:15:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -465344564, now seen corresponding path program 1 times [2022-12-13 03:15:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207806326] [2022-12-13 03:15:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:41,366 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 03:15:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:41,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207806326] [2022-12-13 03:15:41,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207806326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:41,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:41,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:15:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959975948] [2022-12-13 03:15:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:41,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:15:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:15:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:15:41,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 03:15:41,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 90 transitions, 1677 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 03:15:41,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:41,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 03:15:41,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:41,456 INFO L130 PetriNetUnfolder]: 220/538 cut-off events. [2022-12-13 03:15:41,456 INFO L131 PetriNetUnfolder]: For 1534/1585 co-relation queries the response was YES. [2022-12-13 03:15:41,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5108 conditions, 538 events. 220/538 cut-off events. For 1534/1585 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3216 event pairs, 0 based on Foata normal form. 45/454 useless extension candidates. Maximal degree in co-relation 5070. Up to 489 conditions per place. [2022-12-13 03:15:41,459 INFO L137 encePairwiseOnDemand]: 12/24 looper letters, 21 selfloop transitions, 31 changer transitions 54/109 dead transitions. [2022-12-13 03:15:41,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 2217 flow [2022-12-13 03:15:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:15:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:15:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 03:15:41,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-13 03:15:41,461 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2022-12-13 03:15:41,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 109 transitions, 2217 flow [2022-12-13 03:15:41,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 55 transitions, 1075 flow [2022-12-13 03:15:41,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:15:41,466 INFO L89 Accepts]: Start accepts. Operand has 61 places, 55 transitions, 1075 flow [2022-12-13 03:15:41,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:15:41,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:41,468 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 55 transitions, 1075 flow [2022-12-13 03:15:41,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 55 transitions, 1075 flow [2022-12-13 03:15:41,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 03:15:41,592 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 03:15:41,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 03:15:41,593 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 1061 flow [2022-12-13 03:15:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 03:15:41,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:15:41,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:41,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:15:41,594 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 1 more)] === [2022-12-13 03:15:41,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:15:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1628484216, now seen corresponding path program 1 times [2022-12-13 03:15:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:15:41,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695713689] [2022-12-13 03:15:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:15:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:15:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:15:41,666 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 03:15:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:15:41,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695713689] [2022-12-13 03:15:41,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695713689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:15:41,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:15:41,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:15:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067557276] [2022-12-13 03:15:41,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:15:41,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:15:41,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:15:41,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:15:41,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:15:41,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2022-12-13 03:15:41,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 1061 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 03:15:41,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:15:41,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2022-12-13 03:15:41,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:15:41,700 INFO L130 PetriNetUnfolder]: 113/208 cut-off events. [2022-12-13 03:15:41,700 INFO L131 PetriNetUnfolder]: For 844/845 co-relation queries the response was YES. [2022-12-13 03:15:41,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 208 events. 113/208 cut-off events. For 844/845 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 725 event pairs, 0 based on Foata normal form. 28/176 useless extension candidates. Maximal degree in co-relation 2047. Up to 196 conditions per place. [2022-12-13 03:15:41,701 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2022-12-13 03:15:41,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 1125 flow [2022-12-13 03:15:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:15:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:15:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-13 03:15:41,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-13 03:15:41,703 INFO L295 CegarLoopForPetriNet]: 35 programPoint places, 27 predicate places. [2022-12-13 03:15:41,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 53 transitions, 1125 flow [2022-12-13 03:15:41,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:15:41,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:15:41,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:15:41,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:15:41,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:15:41,705 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:15:41,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 03:15:41,706 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:15:41,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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 03:15:41,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:15:41,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:15:41,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:15:41,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:15:41,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:15:41,708 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:15:41,712 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:15:41,712 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:15:41,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:15:41 BasicIcfg [2022-12-13 03:15:41,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:15:41,715 INFO L158 Benchmark]: Toolchain (without parser) took 6163.44ms. Allocated memory was 215.0MB in the beginning and 371.2MB in the end (delta: 156.2MB). Free memory was 189.7MB in the beginning and 168.6MB in the end (delta: 21.1MB). Peak memory consumption was 178.3MB. Max. memory is 8.0GB. [2022-12-13 03:15:41,715 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 215.0MB. Free memory was 191.5MB in the beginning and 191.4MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:15:41,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.41ms. Allocated memory is still 215.0MB. Free memory was 189.7MB in the beginning and 166.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 03:15:41,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.95ms. Allocated memory is still 215.0MB. Free memory was 166.5MB in the beginning and 164.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:15:41,716 INFO L158 Benchmark]: Boogie Preprocessor took 19.57ms. Allocated memory is still 215.0MB. Free memory was 164.8MB in the beginning and 163.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 03:15:41,716 INFO L158 Benchmark]: RCFGBuilder took 345.85ms. Allocated memory is still 215.0MB. Free memory was 163.4MB in the beginning and 149.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 03:15:41,716 INFO L158 Benchmark]: TraceAbstraction took 5320.32ms. Allocated memory was 215.0MB in the beginning and 371.2MB in the end (delta: 156.2MB). Free memory was 147.6MB in the beginning and 168.6MB in the end (delta: -21.0MB). Peak memory consumption was 136.3MB. Max. memory is 8.0GB. [2022-12-13 03:15:41,717 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.11ms. Allocated memory is still 215.0MB. Free memory was 191.5MB in the beginning and 191.4MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.41ms. Allocated memory is still 215.0MB. Free memory was 189.7MB in the beginning and 166.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.95ms. Allocated memory is still 215.0MB. Free memory was 166.5MB in the beginning and 164.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.57ms. Allocated memory is still 215.0MB. Free memory was 164.8MB in the beginning and 163.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 345.85ms. Allocated memory is still 215.0MB. Free memory was 163.4MB in the beginning and 149.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5320.32ms. Allocated memory was 215.0MB in the beginning and 371.2MB in the end (delta: 156.2MB). Free memory was 147.6MB in the beginning and 168.6MB in the end (delta: -21.0MB). Peak memory consumption was 136.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 76 PlacesBefore, 35 PlacesAfterwards, 67 TransitionsBefore, 26 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1113, independent: 1062, independent conditional: 1062, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1113, independent: 1062, independent conditional: 0, independent unconditional: 1062, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1113, independent: 1062, independent conditional: 0, independent unconditional: 1062, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1113, independent: 1062, independent conditional: 0, independent unconditional: 1062, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 789, independent: 759, independent conditional: 0, independent unconditional: 759, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 789, independent: 743, independent conditional: 0, independent unconditional: 743, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1113, independent: 303, independent conditional: 0, independent unconditional: 303, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 789, unknown conditional: 0, unknown unconditional: 789] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1146, Positive conditional cache size: 0, Positive unconditional cache size: 1146, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, 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.1s, 37 PlacesBefore, 37 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.1s, 40 PlacesBefore, 40 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 336 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 46 PlacesBefore, 46 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 356 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 49 PlacesBefore, 49 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 372 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 51 PlacesBefore, 51 PlacesAfterwards, 136 TransitionsBefore, 136 TransitionsAfterwards, 272 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 54 PlacesBefore, 54 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 258 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 57 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 150 TransitionsAfterwards, 236 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 59 PlacesBefore, 59 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 80 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): 8, Positive cache size: 7, Positive conditional cache size: 0, Positive unconditional cache size: 7, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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.1s, 61 PlacesBefore, 60 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 7, independent: 7, independent conditional: 3, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 7, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 11, Positive conditional cache size: 1, Positive unconditional cache size: 10, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 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): 12, Positive cache size: 11, Positive conditional cache size: 1, Positive unconditional cache size: 10, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 104 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 244 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 644 IncrementalHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 21 mSDtfsCounter, 644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2562occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:15:41,740 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 0 Received shutdown request...