/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:44:29,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:44:29,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:44:30,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:44:30,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:44:30,039 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:44:30,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:44:30,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:44:30,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:44:30,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:44:30,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:44:30,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:44:30,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:44:30,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:44:30,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:44:30,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:44:30,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:44:30,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:44:30,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:44:30,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:44:30,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:44:30,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:44:30,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:44:30,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:44:30,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:44:30,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:44:30,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:44:30,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:44:30,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:44:30,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:44:30,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:44:30,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:44:30,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:44:30,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:44:30,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:44:30,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:44:30,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:44:30,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:44:30,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:44:30,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:44:30,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:44:30,091 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 00:44:30,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:44:30,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:44:30,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:44:30,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:44:30,111 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:44:30,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:44:30,111 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:44:30,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:44:30,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:44:30,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:44:30,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:44:30,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:44:30,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:44:30,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:44:30,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:44:30,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:44:30,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:44:30,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:44:30,114 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:44:30,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:44:30,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:44:30,115 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 [2022-12-13 00:44:30,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:44:30,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:44:30,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:44:30,408 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:44:30,408 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:44:30,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-13 00:44:31,412 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:44:31,629 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:44:31,630 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-13 00:44:31,650 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9713bbc3/ce91a50376a1436ebfb7a80612e3fd95/FLAGa1463c5a5 [2022-12-13 00:44:31,663 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9713bbc3/ce91a50376a1436ebfb7a80612e3fd95 [2022-12-13 00:44:31,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:44:31,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:44:31,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:44:31,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:44:31,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:44:31,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:44:31" (1/1) ... [2022-12-13 00:44:31,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c61f94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:31, skipping insertion in model container [2022-12-13 00:44:31,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:44:31" (1/1) ... [2022-12-13 00:44:31,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:44:31,717 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:44:31,854 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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-12-13 00:44:31,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:31,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:31,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:31,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:31,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:31,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:31,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:31,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:31,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:31,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:31,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:31,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:31,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,001 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:44:32,045 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:44:32,053 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/mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i[979,992] [2022-12-13 00:44:32,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:44:32,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:44:32,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:44:32,114 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:44:32,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32 WrapperNode [2022-12-13 00:44:32,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:44:32,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:44:32,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:44:32,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:44:32,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,161 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 00:44:32,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:44:32,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:44:32,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:44:32,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:44:32,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:44:32,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:44:32,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:44:32,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:44:32,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (1/1) ... [2022-12-13 00:44:32,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:44:32,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:44:32,236 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 00:44:32,253 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 00:44:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:44:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:44:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:44:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:44:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:44:32,264 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:44:32,264 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:44:32,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:44:32,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:44:32,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:44:32,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:44:32,265 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 00:44:32,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 00:44:32,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:44:32,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:44:32,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:44:32,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:44:32,266 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 00:44:32,424 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:44:32,426 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:44:32,717 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:44:32,838 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:44:32,839 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:44:32,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:44:32 BoogieIcfgContainer [2022-12-13 00:44:32,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:44:32,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:44:32,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:44:32,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:44:32,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:44:31" (1/3) ... [2022-12-13 00:44:32,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f33f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:44:32, skipping insertion in model container [2022-12-13 00:44:32,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:44:32" (2/3) ... [2022-12-13 00:44:32,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f33f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:44:32, skipping insertion in model container [2022-12-13 00:44:32,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:44:32" (3/3) ... [2022-12-13 00:44:32,848 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_power.oepc_power.opt_pso.oepc_rmo.oepc.i [2022-12-13 00:44:32,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:44:32,861 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:44:32,861 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:44:32,912 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:44:32,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 00:44:33,028 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 00:44:33,029 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:44:33,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 00:44:33,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-13 00:44:33,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-13 00:44:33,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:33,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 00:44:33,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-13 00:44:33,099 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-13 00:44:33,100 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:44:33,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 00:44:33,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-13 00:44:33,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-13 00:44:38,421 INFO L241 LiptonReduction]: Total number of compositions: 99 [2022-12-13 00:44:38,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:44:38,436 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;@65b5b970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:44:38,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 00:44:38,438 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:44:38,438 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:44:38,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:38,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:44:38,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:44:38,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 570563, now seen corresponding path program 1 times [2022-12-13 00:44:38,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:38,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035665800] [2022-12-13 00:44:38,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:38,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:38,747 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 00:44:38,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:38,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035665800] [2022-12-13 00:44:38,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035665800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:38,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:38,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:44:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211506216] [2022-12-13 00:44:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:38,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:44:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:38,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:44:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:44:38,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 81 [2022-12-13 00:44:38,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 00:44:38,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:38,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 81 [2022-12-13 00:44:38,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:45,974 INFO L130 PetriNetUnfolder]: 66790/94860 cut-off events. [2022-12-13 00:44:45,974 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-13 00:44:46,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183149 conditions, 94860 events. 66790/94860 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 4493. Compared 706168 event pairs, 26656 based on Foata normal form. 0/60945 useless extension candidates. Maximal degree in co-relation 183137. Up to 73765 conditions per place. [2022-12-13 00:44:46,277 INFO L137 encePairwiseOnDemand]: 77/81 looper letters, 48 selfloop transitions, 2 changer transitions 71/136 dead transitions. [2022-12-13 00:44:46,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 136 transitions, 533 flow [2022-12-13 00:44:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:44:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:44:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-12-13 00:44:46,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-12-13 00:44:46,289 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 174 flow. Second operand 3 states and 171 transitions. [2022-12-13 00:44:46,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 136 transitions, 533 flow [2022-12-13 00:44:46,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 136 transitions, 526 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 00:44:46,296 INFO L231 Difference]: Finished difference. Result has 90 places, 43 transitions, 98 flow [2022-12-13 00:44:46,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=90, PETRI_TRANSITIONS=43} [2022-12-13 00:44:46,301 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -4 predicate places. [2022-12-13 00:44:46,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:46,302 INFO L89 Accepts]: Start accepts. Operand has 90 places, 43 transitions, 98 flow [2022-12-13 00:44:46,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:46,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:46,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 43 transitions, 98 flow [2022-12-13 00:44:46,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2022-12-13 00:44:46,321 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 00:44:46,321 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:44:46,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 120 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:44:46,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2022-12-13 00:44:46,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 1106 [2022-12-13 00:44:46,476 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:44:46,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 177 [2022-12-13 00:44:46,478 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 98 flow [2022-12-13 00:44:46,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 00:44:46,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:46,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:46,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:44:46,481 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:44:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:46,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1136361942, now seen corresponding path program 1 times [2022-12-13 00:44:46,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:46,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8154709] [2022-12-13 00:44:46,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:46,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:46,693 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 00:44:46,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8154709] [2022-12-13 00:44:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8154709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:46,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:46,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:44:46,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819936872] [2022-12-13 00:44:46,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:44:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:44:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:44:46,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2022-12-13 00:44:46,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 00:44:46,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:46,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2022-12-13 00:44:46,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:48,187 INFO L130 PetriNetUnfolder]: 14421/21021 cut-off events. [2022-12-13 00:44:48,187 INFO L131 PetriNetUnfolder]: For 781/781 co-relation queries the response was YES. [2022-12-13 00:44:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41415 conditions, 21021 events. 14421/21021 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 137277 event pairs, 3177 based on Foata normal form. 0/16705 useless extension candidates. Maximal degree in co-relation 41405. Up to 18483 conditions per place. [2022-12-13 00:44:48,286 INFO L137 encePairwiseOnDemand]: 39/43 looper letters, 46 selfloop transitions, 3 changer transitions 2/64 dead transitions. [2022-12-13 00:44:48,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 250 flow [2022-12-13 00:44:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:44:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:44:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-12-13 00:44:48,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2022-12-13 00:44:48,290 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 98 flow. Second operand 3 states and 91 transitions. [2022-12-13 00:44:48,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 250 flow [2022-12-13 00:44:48,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:44:48,292 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 111 flow [2022-12-13 00:44:48,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 00:44:48,293 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -39 predicate places. [2022-12-13 00:44:48,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:48,294 INFO L89 Accepts]: Start accepts. Operand has 55 places, 44 transitions, 111 flow [2022-12-13 00:44:48,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:48,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:48,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 111 flow [2022-12-13 00:44:48,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 111 flow [2022-12-13 00:44:48,302 INFO L130 PetriNetUnfolder]: 3/58 cut-off events. [2022-12-13 00:44:48,302 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:44:48,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 58 events. 3/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 190 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2022-12-13 00:44:48,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 44 transitions, 111 flow [2022-12-13 00:44:48,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 1136 [2022-12-13 00:44:48,367 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:44:48,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 00:44:48,368 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 111 flow [2022-12-13 00:44:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 00:44:48,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:48,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:48,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:44:48,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:44:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash -867483398, now seen corresponding path program 1 times [2022-12-13 00:44:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:48,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571461220] [2022-12-13 00:44:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:48,675 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 00:44:48,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571461220] [2022-12-13 00:44:48,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571461220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:48,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:48,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:44:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968802887] [2022-12-13 00:44:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:48,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:44:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:48,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:44:48,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:44:48,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:44:48,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 00:44:48,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:48,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:44:48,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:50,370 INFO L130 PetriNetUnfolder]: 19651/26824 cut-off events. [2022-12-13 00:44:50,370 INFO L131 PetriNetUnfolder]: For 1942/1942 co-relation queries the response was YES. [2022-12-13 00:44:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56981 conditions, 26824 events. 19651/26824 cut-off events. For 1942/1942 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 152412 event pairs, 5910 based on Foata normal form. 132/18722 useless extension candidates. Maximal degree in co-relation 56970. Up to 25975 conditions per place. [2022-12-13 00:44:50,587 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 48 selfloop transitions, 13 changer transitions 0/72 dead transitions. [2022-12-13 00:44:50,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 300 flow [2022-12-13 00:44:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:44:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:44:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-12-13 00:44:50,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 00:44:50,589 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 111 flow. Second operand 3 states and 90 transitions. [2022-12-13 00:44:50,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 300 flow [2022-12-13 00:44:50,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:44:50,593 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 197 flow [2022-12-13 00:44:50,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2022-12-13 00:44:50,595 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -38 predicate places. [2022-12-13 00:44:50,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:50,595 INFO L89 Accepts]: Start accepts. Operand has 56 places, 56 transitions, 197 flow [2022-12-13 00:44:50,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:50,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:50,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 197 flow [2022-12-13 00:44:50,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 197 flow [2022-12-13 00:44:50,753 INFO L130 PetriNetUnfolder]: 1981/3418 cut-off events. [2022-12-13 00:44:50,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:44:50,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6418 conditions, 3418 events. 1981/3418 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 26295 event pairs, 1296 based on Foata normal form. 0/1838 useless extension candidates. Maximal degree in co-relation 6408. Up to 2470 conditions per place. [2022-12-13 00:44:50,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 197 flow [2022-12-13 00:44:50,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 1430 [2022-12-13 00:44:50,803 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:44:50,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-13 00:44:50,804 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 197 flow [2022-12-13 00:44:50,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 00:44:50,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:50,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:50,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:44:50,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:44:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash -20726492, now seen corresponding path program 1 times [2022-12-13 00:44:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:50,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821513409] [2022-12-13 00:44:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:50,941 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 00:44:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:50,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821513409] [2022-12-13 00:44:50,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821513409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:50,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:50,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:44:50,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817313601] [2022-12-13 00:44:50,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:50,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:44:50,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:50,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:44:50,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:44:50,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2022-12-13 00:44:50,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 00:44:50,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:50,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2022-12-13 00:44:50,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:54,583 INFO L130 PetriNetUnfolder]: 38488/54245 cut-off events. [2022-12-13 00:44:54,583 INFO L131 PetriNetUnfolder]: For 10746/12260 co-relation queries the response was YES. [2022-12-13 00:44:54,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137902 conditions, 54245 events. 38488/54245 cut-off events. For 10746/12260 co-relation queries the response was YES. Maximal size of possible extension queue 2272. Compared 359560 event pairs, 14968 based on Foata normal form. 1688/45117 useless extension candidates. Maximal degree in co-relation 137889. Up to 31101 conditions per place. [2022-12-13 00:44:54,891 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 68 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2022-12-13 00:44:54,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 91 transitions, 471 flow [2022-12-13 00:44:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:44:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:44:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-12-13 00:44:54,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2022-12-13 00:44:54,892 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 197 flow. Second operand 3 states and 91 transitions. [2022-12-13 00:44:54,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 91 transitions, 471 flow [2022-12-13 00:44:54,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:44:54,896 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 248 flow [2022-12-13 00:44:54,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2022-12-13 00:44:54,896 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -35 predicate places. [2022-12-13 00:44:54,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:54,897 INFO L89 Accepts]: Start accepts. Operand has 59 places, 62 transitions, 248 flow [2022-12-13 00:44:54,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:54,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:54,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 62 transitions, 248 flow [2022-12-13 00:44:54,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 62 transitions, 248 flow [2022-12-13 00:44:55,372 INFO L130 PetriNetUnfolder]: 5684/9023 cut-off events. [2022-12-13 00:44:55,373 INFO L131 PetriNetUnfolder]: For 307/518 co-relation queries the response was YES. [2022-12-13 00:44:55,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18088 conditions, 9023 events. 5684/9023 cut-off events. For 307/518 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 70793 event pairs, 3026 based on Foata normal form. 0/3865 useless extension candidates. Maximal degree in co-relation 18075. Up to 8050 conditions per place. [2022-12-13 00:44:55,441 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 62 transitions, 248 flow [2022-12-13 00:44:55,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 1690 [2022-12-13 00:44:55,515 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:44:55,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 620 [2022-12-13 00:44:55,516 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 248 flow [2022-12-13 00:44:55,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 00:44:55,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:55,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:55,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:44:55,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:44:55,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash -29895098, now seen corresponding path program 1 times [2022-12-13 00:44:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:55,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503471434] [2022-12-13 00:44:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:55,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:55,634 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 00:44:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503471434] [2022-12-13 00:44:55,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503471434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:55,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:55,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:44:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746794398] [2022-12-13 00:44:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:55,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:44:55,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:55,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:44:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:44:55,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:44:55,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 00:44:55,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:55,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:44:55,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:44:58,157 INFO L130 PetriNetUnfolder]: 24770/36221 cut-off events. [2022-12-13 00:44:58,158 INFO L131 PetriNetUnfolder]: For 12184/12520 co-relation queries the response was YES. [2022-12-13 00:44:58,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100603 conditions, 36221 events. 24770/36221 cut-off events. For 12184/12520 co-relation queries the response was YES. Maximal size of possible extension queue 1710. Compared 246206 event pairs, 3950 based on Foata normal form. 1131/25851 useless extension candidates. Maximal degree in co-relation 100587. Up to 30241 conditions per place. [2022-12-13 00:44:58,373 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 69 selfloop transitions, 25 changer transitions 0/108 dead transitions. [2022-12-13 00:44:58,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 108 transitions, 602 flow [2022-12-13 00:44:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:44:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:44:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2022-12-13 00:44:58,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7440476190476191 [2022-12-13 00:44:58,374 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 248 flow. Second operand 4 states and 125 transitions. [2022-12-13 00:44:58,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 108 transitions, 602 flow [2022-12-13 00:44:58,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:44:58,391 INFO L231 Difference]: Finished difference. Result has 61 places, 74 transitions, 380 flow [2022-12-13 00:44:58,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=380, PETRI_PLACES=61, PETRI_TRANSITIONS=74} [2022-12-13 00:44:58,392 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -33 predicate places. [2022-12-13 00:44:58,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:44:58,392 INFO L89 Accepts]: Start accepts. Operand has 61 places, 74 transitions, 380 flow [2022-12-13 00:44:58,393 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:44:58,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:44:58,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 74 transitions, 380 flow [2022-12-13 00:44:58,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 74 transitions, 380 flow [2022-12-13 00:44:58,885 INFO L130 PetriNetUnfolder]: 4490/8486 cut-off events. [2022-12-13 00:44:58,885 INFO L131 PetriNetUnfolder]: For 1027/2385 co-relation queries the response was YES. [2022-12-13 00:44:58,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23548 conditions, 8486 events. 4490/8486 cut-off events. For 1027/2385 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 79739 event pairs, 1450 based on Foata normal form. 30/4699 useless extension candidates. Maximal degree in co-relation 23534. Up to 6280 conditions per place. [2022-12-13 00:44:58,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 74 transitions, 380 flow [2022-12-13 00:44:58,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 2128 [2022-12-13 00:44:59,030 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:44:59,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 649 [2022-12-13 00:44:59,042 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 74 transitions, 380 flow [2022-12-13 00:44:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 00:44:59,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:44:59,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:44:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:44:59,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:44:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:44:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash -836273309, now seen corresponding path program 1 times [2022-12-13 00:44:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:44:59,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213263352] [2022-12-13 00:44:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:44:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:44:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:44:59,442 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 00:44:59,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:44:59,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213263352] [2022-12-13 00:44:59,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213263352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:44:59,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:44:59,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:44:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725059422] [2022-12-13 00:44:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:44:59,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:44:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:44:59,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:44:59,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:44:59,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:44:59,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 74 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 00:44:59,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:44:59,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:44:59,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:00,802 INFO L130 PetriNetUnfolder]: 13538/20921 cut-off events. [2022-12-13 00:45:00,802 INFO L131 PetriNetUnfolder]: For 7344/7489 co-relation queries the response was YES. [2022-12-13 00:45:00,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71646 conditions, 20921 events. 13538/20921 cut-off events. For 7344/7489 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 144678 event pairs, 1097 based on Foata normal form. 1467/15459 useless extension candidates. Maximal degree in co-relation 71629. Up to 10864 conditions per place. [2022-12-13 00:45:00,955 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 82 selfloop transitions, 37 changer transitions 0/133 dead transitions. [2022-12-13 00:45:00,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 133 transitions, 840 flow [2022-12-13 00:45:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2022-12-13 00:45:00,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2022-12-13 00:45:00,957 INFO L175 Difference]: Start difference. First operand has 61 places, 74 transitions, 380 flow. Second operand 5 states and 158 transitions. [2022-12-13 00:45:00,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 133 transitions, 840 flow [2022-12-13 00:45:00,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 133 transitions, 790 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 00:45:00,976 INFO L231 Difference]: Finished difference. Result has 64 places, 86 transitions, 526 flow [2022-12-13 00:45:00,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=526, PETRI_PLACES=64, PETRI_TRANSITIONS=86} [2022-12-13 00:45:00,976 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -30 predicate places. [2022-12-13 00:45:00,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:00,977 INFO L89 Accepts]: Start accepts. Operand has 64 places, 86 transitions, 526 flow [2022-12-13 00:45:00,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:00,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:00,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 86 transitions, 526 flow [2022-12-13 00:45:00,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 86 transitions, 526 flow [2022-12-13 00:45:01,245 INFO L130 PetriNetUnfolder]: 2510/5219 cut-off events. [2022-12-13 00:45:01,245 INFO L131 PetriNetUnfolder]: For 2200/3447 co-relation queries the response was YES. [2022-12-13 00:45:01,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18758 conditions, 5219 events. 2510/5219 cut-off events. For 2200/3447 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 48407 event pairs, 253 based on Foata normal form. 24/2794 useless extension candidates. Maximal degree in co-relation 18743. Up to 3925 conditions per place. [2022-12-13 00:45:01,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 86 transitions, 526 flow [2022-12-13 00:45:01,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 2144 [2022-12-13 00:45:01,316 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:01,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 340 [2022-12-13 00:45:01,316 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 86 transitions, 526 flow [2022-12-13 00:45:01,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 00:45:01,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:01,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:01,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:45:01,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:45:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:01,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1867293567, now seen corresponding path program 1 times [2022-12-13 00:45:01,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:01,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503275597] [2022-12-13 00:45:01,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:01,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:01,454 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 00:45:01,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:01,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503275597] [2022-12-13 00:45:01,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503275597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:01,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:01,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:45:01,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60438390] [2022-12-13 00:45:01,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:01,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:45:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:45:01,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:45:01,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:45:01,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 86 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 00:45:01,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:01,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:45:01,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:02,623 INFO L130 PetriNetUnfolder]: 10622/15872 cut-off events. [2022-12-13 00:45:02,623 INFO L131 PetriNetUnfolder]: For 7401/7519 co-relation queries the response was YES. [2022-12-13 00:45:02,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59263 conditions, 15872 events. 10622/15872 cut-off events. For 7401/7519 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 100565 event pairs, 638 based on Foata normal form. 873/10977 useless extension candidates. Maximal degree in co-relation 59245. Up to 6994 conditions per place. [2022-12-13 00:45:02,761 INFO L137 encePairwiseOnDemand]: 28/42 looper letters, 69 selfloop transitions, 49 changer transitions 1/133 dead transitions. [2022-12-13 00:45:02,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 133 transitions, 914 flow [2022-12-13 00:45:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:45:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:45:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 168 transitions. [2022-12-13 00:45:02,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:45:02,764 INFO L175 Difference]: Start difference. First operand has 64 places, 86 transitions, 526 flow. Second operand 6 states and 168 transitions. [2022-12-13 00:45:02,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 133 transitions, 914 flow [2022-12-13 00:45:03,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 133 transitions, 814 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-13 00:45:03,638 INFO L231 Difference]: Finished difference. Result has 67 places, 86 transitions, 550 flow [2022-12-13 00:45:03,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=67, PETRI_TRANSITIONS=86} [2022-12-13 00:45:03,638 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -27 predicate places. [2022-12-13 00:45:03,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:03,638 INFO L89 Accepts]: Start accepts. Operand has 67 places, 86 transitions, 550 flow [2022-12-13 00:45:03,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:03,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:03,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 86 transitions, 550 flow [2022-12-13 00:45:03,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 86 transitions, 550 flow [2022-12-13 00:45:03,790 INFO L130 PetriNetUnfolder]: 1673/3167 cut-off events. [2022-12-13 00:45:03,790 INFO L131 PetriNetUnfolder]: For 2104/2793 co-relation queries the response was YES. [2022-12-13 00:45:03,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12018 conditions, 3167 events. 1673/3167 cut-off events. For 2104/2793 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 24845 event pairs, 10 based on Foata normal form. 1/1286 useless extension candidates. Maximal degree in co-relation 12002. Up to 2026 conditions per place. [2022-12-13 00:45:03,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 86 transitions, 550 flow [2022-12-13 00:45:03,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-13 00:45:04,201 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:45:04,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 563 [2022-12-13 00:45:04,202 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 84 transitions, 546 flow [2022-12-13 00:45:04,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 00:45:04,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:04,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:04,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:45:04,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:45:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:04,202 INFO L85 PathProgramCache]: Analyzing trace with hash 666405452, now seen corresponding path program 1 times [2022-12-13 00:45:04,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:04,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331898180] [2022-12-13 00:45:04,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:04,462 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 00:45:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:04,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331898180] [2022-12-13 00:45:04,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331898180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:04,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:04,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:04,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811713424] [2022-12-13 00:45:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:04,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2022-12-13 00:45:04,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 84 transitions, 546 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 00:45:04,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:04,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2022-12-13 00:45:04,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:05,940 INFO L130 PetriNetUnfolder]: 13624/20298 cut-off events. [2022-12-13 00:45:05,940 INFO L131 PetriNetUnfolder]: For 26852/28822 co-relation queries the response was YES. [2022-12-13 00:45:06,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74653 conditions, 20298 events. 13624/20298 cut-off events. For 26852/28822 co-relation queries the response was YES. Maximal size of possible extension queue 1105. Compared 132564 event pairs, 883 based on Foata normal form. 887/16923 useless extension candidates. Maximal degree in co-relation 74634. Up to 6870 conditions per place. [2022-12-13 00:45:06,059 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 139 selfloop transitions, 20 changer transitions 8/190 dead transitions. [2022-12-13 00:45:06,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 190 transitions, 1564 flow [2022-12-13 00:45:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:45:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:45:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-12-13 00:45:06,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.695 [2022-12-13 00:45:06,060 INFO L175 Difference]: Start difference. First operand has 65 places, 84 transitions, 546 flow. Second operand 5 states and 139 transitions. [2022-12-13 00:45:06,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 190 transitions, 1564 flow [2022-12-13 00:45:07,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 190 transitions, 1262 flow, removed 60 selfloop flow, removed 4 redundant places. [2022-12-13 00:45:07,607 INFO L231 Difference]: Finished difference. Result has 68 places, 98 transitions, 560 flow [2022-12-13 00:45:07,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=68, PETRI_TRANSITIONS=98} [2022-12-13 00:45:07,607 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -26 predicate places. [2022-12-13 00:45:07,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:07,607 INFO L89 Accepts]: Start accepts. Operand has 68 places, 98 transitions, 560 flow [2022-12-13 00:45:07,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:07,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:07,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 98 transitions, 560 flow [2022-12-13 00:45:07,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 98 transitions, 560 flow [2022-12-13 00:45:07,766 INFO L130 PetriNetUnfolder]: 2654/4484 cut-off events. [2022-12-13 00:45:07,766 INFO L131 PetriNetUnfolder]: For 2593/2750 co-relation queries the response was YES. [2022-12-13 00:45:07,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12783 conditions, 4484 events. 2654/4484 cut-off events. For 2593/2750 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 33984 event pairs, 6 based on Foata normal form. 15/1506 useless extension candidates. Maximal degree in co-relation 12764. Up to 2026 conditions per place. [2022-12-13 00:45:07,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 98 transitions, 560 flow [2022-12-13 00:45:07,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 2570 [2022-12-13 00:45:07,823 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:07,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 216 [2022-12-13 00:45:07,824 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 98 transitions, 560 flow [2022-12-13 00:45:07,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 00:45:07,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:07,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:07,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:45:07,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:45:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1277833537, now seen corresponding path program 1 times [2022-12-13 00:45:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:07,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686906729] [2022-12-13 00:45:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:07,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:07,976 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 00:45:07,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:07,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686906729] [2022-12-13 00:45:07,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686906729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:07,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:07,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:45:07,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63108761] [2022-12-13 00:45:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:07,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:45:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:45:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:45:07,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2022-12-13 00:45:07,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 98 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 00:45:07,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:07,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2022-12-13 00:45:07,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:10,178 INFO L130 PetriNetUnfolder]: 19551/29331 cut-off events. [2022-12-13 00:45:10,178 INFO L131 PetriNetUnfolder]: For 36246/38152 co-relation queries the response was YES. [2022-12-13 00:45:10,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98491 conditions, 29331 events. 19551/29331 cut-off events. For 36246/38152 co-relation queries the response was YES. Maximal size of possible extension queue 1754. Compared 209501 event pairs, 2455 based on Foata normal form. 1137/23720 useless extension candidates. Maximal degree in co-relation 98469. Up to 12630 conditions per place. [2022-12-13 00:45:10,299 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 119 selfloop transitions, 5 changer transitions 21/179 dead transitions. [2022-12-13 00:45:10,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 179 transitions, 1297 flow [2022-12-13 00:45:10,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:45:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:45:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2022-12-13 00:45:10,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.70625 [2022-12-13 00:45:10,301 INFO L175 Difference]: Start difference. First operand has 68 places, 98 transitions, 560 flow. Second operand 4 states and 113 transitions. [2022-12-13 00:45:10,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 179 transitions, 1297 flow [2022-12-13 00:45:14,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 179 transitions, 1297 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:45:14,633 INFO L231 Difference]: Finished difference. Result has 73 places, 100 transitions, 598 flow [2022-12-13 00:45:14,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=598, PETRI_PLACES=73, PETRI_TRANSITIONS=100} [2022-12-13 00:45:14,634 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -21 predicate places. [2022-12-13 00:45:14,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:14,634 INFO L89 Accepts]: Start accepts. Operand has 73 places, 100 transitions, 598 flow [2022-12-13 00:45:14,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:14,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:14,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 100 transitions, 598 flow [2022-12-13 00:45:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 100 transitions, 598 flow [2022-12-13 00:45:14,960 INFO L130 PetriNetUnfolder]: 4343/7044 cut-off events. [2022-12-13 00:45:14,960 INFO L131 PetriNetUnfolder]: For 4055/4808 co-relation queries the response was YES. [2022-12-13 00:45:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 7044 events. 4343/7044 cut-off events. For 4055/4808 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 54781 event pairs, 8 based on Foata normal form. 17/2214 useless extension candidates. Maximal degree in co-relation 19590. Up to 3160 conditions per place. [2022-12-13 00:45:15,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 100 transitions, 598 flow [2022-12-13 00:45:15,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 2622 [2022-12-13 00:45:15,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:45:15,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-13 00:45:15,042 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 100 transitions, 598 flow [2022-12-13 00:45:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 00:45:15,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:15,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:15,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:45:15,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:45:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1216970029, now seen corresponding path program 2 times [2022-12-13 00:45:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:15,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246036469] [2022-12-13 00:45:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:15,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:16,181 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 00:45:16,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:16,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246036469] [2022-12-13 00:45:16,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246036469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:16,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:16,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:45:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192200229] [2022-12-13 00:45:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:16,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:45:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:45:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:45:16,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2022-12-13 00:45:16,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 100 transitions, 598 flow. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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 00:45:16,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:16,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2022-12-13 00:45:16,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:20,168 INFO L130 PetriNetUnfolder]: 34558/51876 cut-off events. [2022-12-13 00:45:20,169 INFO L131 PetriNetUnfolder]: For 57602/59829 co-relation queries the response was YES. [2022-12-13 00:45:20,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174063 conditions, 51876 events. 34558/51876 cut-off events. For 57602/59829 co-relation queries the response was YES. Maximal size of possible extension queue 3291. Compared 405300 event pairs, 3734 based on Foata normal form. 956/39331 useless extension candidates. Maximal degree in co-relation 174038. Up to 21321 conditions per place. [2022-12-13 00:45:20,439 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 111 selfloop transitions, 12 changer transitions 71/229 dead transitions. [2022-12-13 00:45:20,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 229 transitions, 1660 flow [2022-12-13 00:45:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:45:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:45:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 173 transitions. [2022-12-13 00:45:20,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333 [2022-12-13 00:45:20,441 INFO L175 Difference]: Start difference. First operand has 73 places, 100 transitions, 598 flow. Second operand 6 states and 173 transitions. [2022-12-13 00:45:20,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 229 transitions, 1660 flow [2022-12-13 00:45:52,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 229 transitions, 1655 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:45:52,070 INFO L231 Difference]: Finished difference. Result has 81 places, 104 transitions, 636 flow [2022-12-13 00:45:52,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=81, PETRI_TRANSITIONS=104} [2022-12-13 00:45:52,071 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -13 predicate places. [2022-12-13 00:45:52,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:45:52,071 INFO L89 Accepts]: Start accepts. Operand has 81 places, 104 transitions, 636 flow [2022-12-13 00:45:52,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:45:52,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:45:52,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 104 transitions, 636 flow [2022-12-13 00:45:52,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 104 transitions, 636 flow [2022-12-13 00:45:52,704 INFO L130 PetriNetUnfolder]: 8185/13688 cut-off events. [2022-12-13 00:45:52,704 INFO L131 PetriNetUnfolder]: For 7310/7963 co-relation queries the response was YES. [2022-12-13 00:45:52,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39396 conditions, 13688 events. 8185/13688 cut-off events. For 7310/7963 co-relation queries the response was YES. Maximal size of possible extension queue 1780. Compared 115975 event pairs, 92 based on Foata normal form. 38/4409 useless extension candidates. Maximal degree in co-relation 39369. Up to 5995 conditions per place. [2022-12-13 00:45:52,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 104 transitions, 636 flow [2022-12-13 00:45:52,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 2558 [2022-12-13 00:45:52,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:45:52,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 897 [2022-12-13 00:45:52,968 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 103 transitions, 640 flow [2022-12-13 00:45:52,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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 00:45:52,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:45:52,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:45:52,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:45:52,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:45:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:45:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2025717643, now seen corresponding path program 1 times [2022-12-13 00:45:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:45:52,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608243399] [2022-12-13 00:45:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:45:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:45:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:45:53,474 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 00:45:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:45:53,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608243399] [2022-12-13 00:45:53,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608243399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:45:53,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:45:53,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:45:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636781634] [2022-12-13 00:45:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:45:53,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:45:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:45:53,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:45:53,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:45:53,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2022-12-13 00:45:53,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 103 transitions, 640 flow. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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 00:45:53,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:45:53,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2022-12-13 00:45:53,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:45:56,941 INFO L130 PetriNetUnfolder]: 28912/44160 cut-off events. [2022-12-13 00:45:56,941 INFO L131 PetriNetUnfolder]: For 73932/76822 co-relation queries the response was YES. [2022-12-13 00:45:57,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164059 conditions, 44160 events. 28912/44160 cut-off events. For 73932/76822 co-relation queries the response was YES. Maximal size of possible extension queue 3253. Compared 348865 event pairs, 2992 based on Foata normal form. 1338/33581 useless extension candidates. Maximal degree in co-relation 164029. Up to 19504 conditions per place. [2022-12-13 00:45:57,222 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 139 selfloop transitions, 19 changer transitions 70/259 dead transitions. [2022-12-13 00:45:57,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 259 transitions, 2048 flow [2022-12-13 00:45:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:45:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:45:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2022-12-13 00:45:57,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6530612244897959 [2022-12-13 00:45:57,225 INFO L175 Difference]: Start difference. First operand has 79 places, 103 transitions, 640 flow. Second operand 7 states and 192 transitions. [2022-12-13 00:45:57,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 259 transitions, 2048 flow [2022-12-13 00:46:14,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 259 transitions, 2037 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:14,723 INFO L231 Difference]: Finished difference. Result has 87 places, 112 transitions, 791 flow [2022-12-13 00:46:14,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=791, PETRI_PLACES=87, PETRI_TRANSITIONS=112} [2022-12-13 00:46:14,724 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -7 predicate places. [2022-12-13 00:46:14,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:14,724 INFO L89 Accepts]: Start accepts. Operand has 87 places, 112 transitions, 791 flow [2022-12-13 00:46:14,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:14,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:14,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 112 transitions, 791 flow [2022-12-13 00:46:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 112 transitions, 791 flow [2022-12-13 00:46:15,529 INFO L130 PetriNetUnfolder]: 9985/16914 cut-off events. [2022-12-13 00:46:15,529 INFO L131 PetriNetUnfolder]: For 10536/14482 co-relation queries the response was YES. [2022-12-13 00:46:15,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49487 conditions, 16914 events. 9985/16914 cut-off events. For 10536/14482 co-relation queries the response was YES. Maximal size of possible extension queue 2619. Compared 151698 event pairs, 60 based on Foata normal form. 76/5335 useless extension candidates. Maximal degree in co-relation 49456. Up to 7426 conditions per place. [2022-12-13 00:46:15,740 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 112 transitions, 791 flow [2022-12-13 00:46:15,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 2854 [2022-12-13 00:46:15,748 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:15,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1025 [2022-12-13 00:46:15,749 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 791 flow [2022-12-13 00:46:15,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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 00:46:15,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:15,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:15,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:46:15,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1078893965, now seen corresponding path program 2 times [2022-12-13 00:46:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:15,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888930532] [2022-12-13 00:46:15,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:15,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:46:16,589 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 00:46:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:46:16,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888930532] [2022-12-13 00:46:16,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888930532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:46:16,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:46:16,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 00:46:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925368826] [2022-12-13 00:46:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:46:16,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 00:46:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:46:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 00:46:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 00:46:16,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2022-12-13 00:46:16,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 791 flow. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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 00:46:16,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:46:16,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2022-12-13 00:46:16,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:46:20,253 INFO L130 PetriNetUnfolder]: 27219/41971 cut-off events. [2022-12-13 00:46:20,253 INFO L131 PetriNetUnfolder]: For 98870/101189 co-relation queries the response was YES. [2022-12-13 00:46:20,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166666 conditions, 41971 events. 27219/41971 cut-off events. For 98870/101189 co-relation queries the response was YES. Maximal size of possible extension queue 3015. Compared 335662 event pairs, 1906 based on Foata normal form. 1226/31609 useless extension candidates. Maximal degree in co-relation 166632. Up to 14880 conditions per place. [2022-12-13 00:46:20,573 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 157 selfloop transitions, 17 changer transitions 65/270 dead transitions. [2022-12-13 00:46:20,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 270 transitions, 2249 flow [2022-12-13 00:46:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:46:20,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:46:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2022-12-13 00:46:20,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 00:46:20,576 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 791 flow. Second operand 7 states and 189 transitions. [2022-12-13 00:46:20,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 270 transitions, 2249 flow [2022-12-13 00:46:37,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 270 transitions, 2216 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 00:46:37,652 INFO L231 Difference]: Finished difference. Result has 92 places, 118 transitions, 904 flow [2022-12-13 00:46:37,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=904, PETRI_PLACES=92, PETRI_TRANSITIONS=118} [2022-12-13 00:46:37,653 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2022-12-13 00:46:37,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:46:37,653 INFO L89 Accepts]: Start accepts. Operand has 92 places, 118 transitions, 904 flow [2022-12-13 00:46:37,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:46:37,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:46:37,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 118 transitions, 904 flow [2022-12-13 00:46:37,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 118 transitions, 904 flow [2022-12-13 00:46:38,652 INFO L130 PetriNetUnfolder]: 13620/22074 cut-off events. [2022-12-13 00:46:38,652 INFO L131 PetriNetUnfolder]: For 16628/18267 co-relation queries the response was YES. [2022-12-13 00:46:38,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64020 conditions, 22074 events. 13620/22074 cut-off events. For 16628/18267 co-relation queries the response was YES. Maximal size of possible extension queue 3255. Compared 194592 event pairs, 256 based on Foata normal form. 129/6973 useless extension candidates. Maximal degree in co-relation 63987. Up to 9883 conditions per place. [2022-12-13 00:46:38,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 118 transitions, 904 flow [2022-12-13 00:46:38,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 3062 [2022-12-13 00:46:38,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:46:38,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1316 [2022-12-13 00:46:38,969 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 118 transitions, 904 flow [2022-12-13 00:46:38,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 8 states have internal predecessors, (122), 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 00:46:38,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:46:38,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:38,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:46:38,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 00:46:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:46:38,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1309030737, now seen corresponding path program 3 times [2022-12-13 00:46:38,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:46:38,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774709515] [2022-12-13 00:46:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:46:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:46:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:39,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:46:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:46:39,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:46:39,114 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:46:39,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 00:46:39,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 00:46:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 00:46:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 00:46:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 00:46:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 00:46:39,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 00:46:39,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:46:39,117 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:46:39,120 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:46:39,121 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:46:39,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:46:39 BasicIcfg [2022-12-13 00:46:39,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:46:39,189 INFO L158 Benchmark]: Toolchain (without parser) took 127523.58ms. Allocated memory was 190.8MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 149.3MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-13 00:46:39,189 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:46:39,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.67ms. Allocated memory is still 190.8MB. Free memory was 149.3MB in the beginning and 121.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 00:46:39,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.11ms. Allocated memory is still 190.8MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:39,190 INFO L158 Benchmark]: Boogie Preprocessor took 29.11ms. Allocated memory is still 190.8MB. Free memory was 118.9MB in the beginning and 116.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:46:39,190 INFO L158 Benchmark]: RCFGBuilder took 650.21ms. Allocated memory is still 190.8MB. Free memory was 116.8MB in the beginning and 79.6MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-13 00:46:39,190 INFO L158 Benchmark]: TraceAbstraction took 126345.09ms. Allocated memory was 190.8MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 78.0MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2022-12-13 00:46:39,191 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.10ms. Allocated memory is still 190.8MB. Free memory is still 168.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.67ms. Allocated memory is still 190.8MB. Free memory was 149.3MB in the beginning and 121.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.11ms. Allocated memory is still 190.8MB. Free memory was 121.0MB in the beginning and 118.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.11ms. Allocated memory is still 190.8MB. Free memory was 118.9MB in the beginning and 116.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 650.21ms. Allocated memory is still 190.8MB. Free memory was 116.8MB in the beginning and 79.6MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 126345.09ms. Allocated memory was 190.8MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 78.0MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 136 PlacesBefore, 94 PlacesAfterwards, 125 TransitionsBefore, 81 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6502, independent: 6220, independent conditional: 6220, independent unconditional: 0, dependent: 282, dependent conditional: 282, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6502, independent: 6220, independent conditional: 0, independent unconditional: 6220, dependent: 282, dependent conditional: 0, dependent unconditional: 282, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6502, independent: 6220, independent conditional: 0, independent unconditional: 6220, dependent: 282, dependent conditional: 0, dependent unconditional: 282, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6502, independent: 6220, independent conditional: 0, independent unconditional: 6220, dependent: 282, dependent conditional: 0, dependent unconditional: 282, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2747, independent: 2671, independent conditional: 0, independent unconditional: 2671, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2747, independent: 2642, independent conditional: 0, independent unconditional: 2642, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 311, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6502, independent: 3549, independent conditional: 0, independent unconditional: 3549, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 2747, unknown conditional: 0, unknown unconditional: 2747] , Statistics on independence cache: Total cache size (in pairs): 5418, Positive cache size: 5342, Positive conditional cache size: 0, Positive unconditional cache size: 5342, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, 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.2s, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 1106 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 402, independent: 356, independent conditional: 356, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 402, independent: 356, independent conditional: 21, independent unconditional: 335, dependent: 46, dependent conditional: 18, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 356, independent conditional: 21, independent unconditional: 335, dependent: 46, dependent conditional: 18, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 356, independent conditional: 21, independent unconditional: 335, dependent: 46, dependent conditional: 18, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 367, independent: 333, independent conditional: 20, independent unconditional: 313, dependent: 34, dependent conditional: 10, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 367, independent: 251, independent conditional: 0, independent unconditional: 251, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 34, dependent conditional: 10, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 145, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 88, dependent conditional: 41, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 402, independent: 23, independent conditional: 1, independent unconditional: 22, dependent: 12, dependent conditional: 8, dependent unconditional: 4, unknown: 367, unknown conditional: 30, unknown unconditional: 337] , Statistics on independence cache: Total cache size (in pairs): 367, Positive cache size: 333, Positive conditional cache size: 20, Positive unconditional cache size: 313, Negative cache size: 34, Negative conditional cache size: 10, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 54 PlacesBefore, 54 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 1136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 458, independent: 417, independent conditional: 417, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 458, independent: 417, independent conditional: 24, independent unconditional: 393, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 458, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 458, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 102, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 458, independent: 329, independent conditional: 0, independent unconditional: 329, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 102, unknown conditional: 0, unknown unconditional: 102] , Statistics on independence cache: Total cache size (in pairs): 469, Positive cache size: 421, Positive conditional cache size: 20, Positive unconditional cache size: 401, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 250, independent: 211, independent conditional: 34, independent unconditional: 177, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 211, independent conditional: 24, independent unconditional: 187, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 211, independent conditional: 24, independent unconditional: 187, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 250, independent: 205, independent conditional: 21, independent unconditional: 184, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 427, Positive conditional cache size: 23, Positive unconditional cache size: 404, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 59 PlacesBefore, 59 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 239, independent: 203, independent conditional: 203, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 239, independent: 203, independent conditional: 62, independent unconditional: 141, dependent: 36, dependent conditional: 4, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 239, independent: 203, independent conditional: 18, independent unconditional: 185, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 239, independent: 203, independent conditional: 18, independent unconditional: 185, dependent: 36, dependent conditional: 0, dependent unconditional: 36, 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: 239, independent: 203, independent conditional: 18, independent unconditional: 185, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 427, Positive conditional cache size: 23, Positive unconditional cache size: 404, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 2128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 218, independent conditional: 218, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 218, independent conditional: 29, independent unconditional: 189, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 218, independent conditional: 18, independent unconditional: 200, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 218, independent conditional: 18, independent unconditional: 200, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 266, independent: 216, independent conditional: 18, independent unconditional: 198, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 477, Positive cache size: 429, Positive conditional cache size: 23, Positive unconditional cache size: 406, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 317, independent: 256, independent conditional: 256, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 317, independent: 256, independent conditional: 42, independent unconditional: 214, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 317, independent: 256, independent conditional: 31, independent unconditional: 225, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 317, independent: 256, independent conditional: 31, independent unconditional: 225, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 317, independent: 253, independent conditional: 30, independent unconditional: 223, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 432, Positive conditional cache size: 24, Positive unconditional cache size: 408, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 65 PlacesAfterwards, 86 TransitionsBefore, 84 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 818, independent: 698, independent conditional: 698, independent unconditional: 0, dependent: 120, dependent conditional: 120, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 818, independent: 698, independent conditional: 276, independent unconditional: 422, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 818, independent: 698, independent conditional: 254, independent unconditional: 444, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 818, independent: 698, independent conditional: 254, independent unconditional: 444, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 818, independent: 690, independent conditional: 246, independent unconditional: 444, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 441, Positive conditional cache size: 32, Positive unconditional cache size: 409, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 2570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 392, independent: 322, independent conditional: 322, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 392, independent: 322, independent conditional: 96, independent unconditional: 226, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 392, independent: 322, independent conditional: 12, independent unconditional: 310, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 392, independent: 322, independent conditional: 12, independent unconditional: 310, dependent: 70, dependent conditional: 0, dependent unconditional: 70, 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: 392, independent: 322, independent conditional: 12, independent unconditional: 310, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 441, Positive conditional cache size: 32, Positive unconditional cache size: 409, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, independent: 276, independent conditional: 276, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344, independent: 276, independent conditional: 52, independent unconditional: 224, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, independent: 276, independent conditional: 26, independent unconditional: 250, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, independent: 276, independent conditional: 26, independent unconditional: 250, dependent: 68, dependent conditional: 0, dependent unconditional: 68, 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: 344, independent: 276, independent conditional: 26, independent unconditional: 250, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 489, Positive cache size: 441, Positive conditional cache size: 32, Positive unconditional cache size: 409, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 79 PlacesAfterwards, 104 TransitionsBefore, 103 TransitionsAfterwards, 2558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 244, independent conditional: 244, 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: 244, independent: 244, independent conditional: 184, independent unconditional: 60, 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: 244, independent: 244, independent conditional: 140, independent unconditional: 104, 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: 244, independent: 244, independent conditional: 140, independent unconditional: 104, 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: 11, independent: 11, independent conditional: 3, independent unconditional: 8, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 244, independent: 233, independent conditional: 137, independent unconditional: 96, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 3, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 548, Positive conditional cache size: 39, Positive unconditional cache size: 509, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 2854 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): 596, Positive cache size: 548, Positive conditional cache size: 39, Positive unconditional cache size: 509, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, 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, 92 PlacesBefore, 92 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 3062 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): 596, Positive cache size: 548, Positive conditional cache size: 39, Positive unconditional cache size: 509, Negative cache size: 48, Negative conditional cache size: 10, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L861] 0 pthread_t t1353; [L862] FCALL, FORK 0 pthread_create(&t1353, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1353, ((void *)0), P0, ((void *)0))=-2, t1353={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1354; [L864] FCALL, FORK 0 pthread_create(&t1354, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1354, ((void *)0), P1, ((void *)0))=-1, t1353={5:0}, t1354={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1355; [L866] FCALL, FORK 0 pthread_create(&t1355, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1355, ((void *)0), P2, ((void *)0))=0, t1353={5:0}, t1354={6:0}, t1355={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1356; [L868] FCALL, FORK 0 pthread_create(&t1356, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1356, ((void *)0), P3, ((void *)0))=1, t1353={5:0}, t1354={6:0}, t1355={7:0}, t1356={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 a$flush_delayed = weak$$choice2 [L826] 4 a$mem_tmp = a [L827] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L828] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L829] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L830] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L831] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L833] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = a [L835] 4 a = a$flush_delayed ? a$mem_tmp : a [L836] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L881] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 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: 126.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 109.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 583 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1968 IncrementalHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 13 mSDtfsCounter, 1968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=12, InterpolantAutomatonStates: 56, 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.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 2165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:46:39,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...