/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix050.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:28:03,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:28:03,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:28:03,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:28:03,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:28:03,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:28:03,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:28:03,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:28:03,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:28:03,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:28:03,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:28:03,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:28:03,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:28:03,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:28:03,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:28:03,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:28:03,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:28:03,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:28:03,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:28:03,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:28:03,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:28:03,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:28:03,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:28:03,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:28:03,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:28:03,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:28:03,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:28:03,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:28:03,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:28:03,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:28:03,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:28:03,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:28:03,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:28:03,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:28:03,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:28:03,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:28:03,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:28:03,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:28:03,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:28:03,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:28:03,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:28:03,357 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:28:03,382 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:28:03,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:28:03,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:28:03,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:28:03,384 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:28:03,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:28:03,384 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:28:03,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:28:03,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:28:03,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:28:03,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:28:03,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:28:03,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:28:03,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:28:03,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:28:03,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:28:03,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:28:03,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:28:03,387 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:28:03,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:28:03,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:28:03,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:28:03,387 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 09:28:03,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:28:03,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:28:03,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:28:03,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:28:03,667 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:28:03,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050.i [2022-12-13 09:28:04,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:28:04,911 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:28:04,911 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050.i [2022-12-13 09:28:04,924 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0b0d445/a72288f8b63c4fc0b64cba176839b827/FLAG98221a882 [2022-12-13 09:28:04,934 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d0b0d445/a72288f8b63c4fc0b64cba176839b827 [2022-12-13 09:28:04,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:28:04,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:28:04,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:28:04,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:28:04,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:28:04,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:28:04" (1/1) ... [2022-12-13 09:28:04,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a90844b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:04, skipping insertion in model container [2022-12-13 09:28:04,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:28:04" (1/1) ... [2022-12-13 09:28:04,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:28:04,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:28:05,074 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/mix050.i[940,953] [2022-12-13 09:28:05,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,165 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:28:05,200 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:28:05,208 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/mix050.i[940,953] [2022-12-13 09:28:05,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:28:05,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:28:05,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:28:05,284 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:28:05,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05 WrapperNode [2022-12-13 09:28:05,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:28:05,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:28:05,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:28:05,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:28:05,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,334 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 09:28:05,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:28:05,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:28:05,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:28:05,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:28:05,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:28:05,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:28:05,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:28:05,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:28:05,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (1/1) ... [2022-12-13 09:28:05,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:28:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:28:05,429 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 09:28:05,484 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 09:28:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:28:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:28:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:28:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:28:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:28:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:28:05,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:28:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:28:05,500 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:28:05,500 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:28:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:28:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 09:28:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 09:28:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:28:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:28:05,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:28:05,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:28:05,502 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 09:28:05,664 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:28:05,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:28:05,949 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:28:06,063 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:28:06,064 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:28:06,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:28:06 BoogieIcfgContainer [2022-12-13 09:28:06,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:28:06,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:28:06,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:28:06,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:28:06,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:28:04" (1/3) ... [2022-12-13 09:28:06,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3e3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:28:06, skipping insertion in model container [2022-12-13 09:28:06,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:28:05" (2/3) ... [2022-12-13 09:28:06,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3e3143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:28:06, skipping insertion in model container [2022-12-13 09:28:06,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:28:06" (3/3) ... [2022-12-13 09:28:06,073 INFO L112 eAbstractionObserver]: Analyzing ICFG mix050.i [2022-12-13 09:28:06,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:28:06,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:28:06,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:28:06,172 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:28:06,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 09:28:06,263 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 09:28:06,264 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:28:06,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 09:28:06,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-13 09:28:06,276 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-13 09:28:06,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:06,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 09:28:06,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-13 09:28:06,324 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-13 09:28:06,324 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:28:06,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-13 09:28:06,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-13 09:28:06,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 3058 [2022-12-13 09:28:10,573 INFO L241 LiptonReduction]: Total number of compositions: 97 [2022-12-13 09:28:10,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:28:10,592 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;@42e8f767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:28:10,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 09:28:10,599 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 09:28:10,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:28:10,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:10,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 09:28:10,601 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 09:28:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash 569586, now seen corresponding path program 1 times [2022-12-13 09:28:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:10,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926138593] [2022-12-13 09:28:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:10,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:10,895 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 09:28:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926138593] [2022-12-13 09:28:10,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926138593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:10,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:10,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:28:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681388912] [2022-12-13 09:28:10,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:10,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:28:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:28:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:28:10,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 82 [2022-12-13 09:28:10,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 09:28:10,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:10,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 82 [2022-12-13 09:28:10,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:17,146 INFO L130 PetriNetUnfolder]: 64365/91269 cut-off events. [2022-12-13 09:28:17,146 INFO L131 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-12-13 09:28:17,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176383 conditions, 91269 events. 64365/91269 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 4099. Compared 668438 event pairs, 25697 based on Foata normal form. 0/59429 useless extension candidates. Maximal degree in co-relation 176371. Up to 71105 conditions per place. [2022-12-13 09:28:17,476 INFO L137 encePairwiseOnDemand]: 77/82 looper letters, 48 selfloop transitions, 2 changer transitions 70/135 dead transitions. [2022-12-13 09:28:17,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 135 transitions, 527 flow [2022-12-13 09:28:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:28:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-13 09:28:17,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2022-12-13 09:28:17,489 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 176 flow. Second operand 3 states and 174 transitions. [2022-12-13 09:28:17,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 135 transitions, 527 flow [2022-12-13 09:28:17,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 135 transitions, 520 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 09:28:17,496 INFO L231 Difference]: Finished difference. Result has 90 places, 43 transitions, 98 flow [2022-12-13 09:28:17,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, 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 09:28:17,500 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -4 predicate places. [2022-12-13 09:28:17,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:17,500 INFO L89 Accepts]: Start accepts. Operand has 90 places, 43 transitions, 98 flow [2022-12-13 09:28:17,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:17,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:17,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 43 transitions, 98 flow [2022-12-13 09:28:17,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2022-12-13 09:28:17,529 INFO L130 PetriNetUnfolder]: 0/43 cut-off events. [2022-12-13 09:28:17,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:28:17,530 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 128 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 09:28:17,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2022-12-13 09:28:17,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 1106 [2022-12-13 09:28:17,711 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:28:17,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 213 [2022-12-13 09:28:17,713 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 98 flow [2022-12-13 09:28:17,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 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 09:28:17,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:17,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:28:17,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:28:17,714 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 09:28:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1460311357, now seen corresponding path program 1 times [2022-12-13 09:28:17,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:17,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836747798] [2022-12-13 09:28:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:17,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:17,974 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 09:28:17,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:17,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836747798] [2022-12-13 09:28:17,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836747798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:17,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:17,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:28:17,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279311849] [2022-12-13 09:28:17,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:17,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:28:17,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:28:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:28:17,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:28:17,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 09:28:17,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:17,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:28:17,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:20,030 INFO L130 PetriNetUnfolder]: 17897/24756 cut-off events. [2022-12-13 09:28:20,030 INFO L131 PetriNetUnfolder]: For 985/985 co-relation queries the response was YES. [2022-12-13 09:28:20,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50402 conditions, 24756 events. 17897/24756 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 144788 event pairs, 5429 based on Foata normal form. 108/17389 useless extension candidates. Maximal degree in co-relation 50392. Up to 23626 conditions per place. [2022-12-13 09:28:20,159 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 46 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2022-12-13 09:28:20,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 278 flow [2022-12-13 09:28:20,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:28:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:28:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-12-13 09:28:20,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2022-12-13 09:28:20,161 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 98 flow. Second operand 3 states and 93 transitions. [2022-12-13 09:28:20,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 278 flow [2022-12-13 09:28:20,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:28:20,163 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 183 flow [2022-12-13 09:28:20,163 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=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2022-12-13 09:28:20,163 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -39 predicate places. [2022-12-13 09:28:20,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:20,164 INFO L89 Accepts]: Start accepts. Operand has 55 places, 55 transitions, 183 flow [2022-12-13 09:28:20,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:20,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:20,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 183 flow [2022-12-13 09:28:20,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 183 flow [2022-12-13 09:28:20,262 INFO L130 PetriNetUnfolder]: 1269/2544 cut-off events. [2022-12-13 09:28:20,263 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:28:20,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 2544 events. 1269/2544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 20568 event pairs, 783 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 4339. Up to 1780 conditions per place. [2022-12-13 09:28:20,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 183 flow [2022-12-13 09:28:20,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 1376 [2022-12-13 09:28:20,363 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:28:20,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-13 09:28:20,364 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 183 flow [2022-12-13 09:28:20,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 09:28:20,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:20,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:28:20,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:28:20,366 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 09:28:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1433209033, now seen corresponding path program 1 times [2022-12-13 09:28:20,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:20,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83452340] [2022-12-13 09:28:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:20,550 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 09:28:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:20,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83452340] [2022-12-13 09:28:20,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83452340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:20,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:20,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:28:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659317085] [2022-12-13 09:28:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:20,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:28:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:28:20,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:28:20,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:28:20,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 09:28:20,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:20,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:28:20,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:21,893 INFO L130 PetriNetUnfolder]: 11984/17682 cut-off events. [2022-12-13 09:28:21,893 INFO L131 PetriNetUnfolder]: For 879/879 co-relation queries the response was YES. [2022-12-13 09:28:21,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44596 conditions, 17682 events. 11984/17682 cut-off events. For 879/879 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 113263 event pairs, 1946 based on Foata normal form. 405/12880 useless extension candidates. Maximal degree in co-relation 44585. Up to 14608 conditions per place. [2022-12-13 09:28:22,014 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 59 selfloop transitions, 25 changer transitions 0/95 dead transitions. [2022-12-13 09:28:22,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 465 flow [2022-12-13 09:28:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:28:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:28:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-12-13 09:28:22,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.75 [2022-12-13 09:28:22,016 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 183 flow. Second operand 4 states and 129 transitions. [2022-12-13 09:28:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 465 flow [2022-12-13 09:28:22,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 95 transitions, 452 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:28:22,019 INFO L231 Difference]: Finished difference. Result has 58 places, 67 transitions, 318 flow [2022-12-13 09:28:22,020 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=58, PETRI_TRANSITIONS=67} [2022-12-13 09:28:22,020 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -36 predicate places. [2022-12-13 09:28:22,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:22,020 INFO L89 Accepts]: Start accepts. Operand has 58 places, 67 transitions, 318 flow [2022-12-13 09:28:22,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:22,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:22,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 67 transitions, 318 flow [2022-12-13 09:28:22,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 67 transitions, 318 flow [2022-12-13 09:28:22,153 INFO L130 PetriNetUnfolder]: 1161/2415 cut-off events. [2022-12-13 09:28:22,153 INFO L131 PetriNetUnfolder]: For 30/159 co-relation queries the response was YES. [2022-12-13 09:28:22,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5855 conditions, 2415 events. 1161/2415 cut-off events. For 30/159 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 19429 event pairs, 351 based on Foata normal form. 4/1211 useless extension candidates. Maximal degree in co-relation 5845. Up to 1660 conditions per place. [2022-12-13 09:28:22,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 67 transitions, 318 flow [2022-12-13 09:28:22,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 1742 [2022-12-13 09:28:22,268 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:28:22,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-13 09:28:22,276 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 67 transitions, 318 flow [2022-12-13 09:28:22,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 09:28:22,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:22,276 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 09:28:22,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:28:22,277 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 09:28:22,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1714140269, now seen corresponding path program 1 times [2022-12-13 09:28:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:22,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662148023] [2022-12-13 09:28:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:22,579 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 09:28:22,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662148023] [2022-12-13 09:28:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662148023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:22,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:22,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:28:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309147823] [2022-12-13 09:28:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:22,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:28:22,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:28:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:28:22,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:28:22,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 67 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 09:28:22,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:22,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:28:22,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:23,458 INFO L130 PetriNetUnfolder]: 6476/10257 cut-off events. [2022-12-13 09:28:23,458 INFO L131 PetriNetUnfolder]: For 1707/1707 co-relation queries the response was YES. [2022-12-13 09:28:23,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32169 conditions, 10257 events. 6476/10257 cut-off events. For 1707/1707 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 67108 event pairs, 569 based on Foata normal form. 567/7723 useless extension candidates. Maximal degree in co-relation 32156. Up to 5047 conditions per place. [2022-12-13 09:28:23,513 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 70 selfloop transitions, 37 changer transitions 0/118 dead transitions. [2022-12-13 09:28:23,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 694 flow [2022-12-13 09:28:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:28:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:28:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2022-12-13 09:28:23,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7581395348837209 [2022-12-13 09:28:23,514 INFO L175 Difference]: Start difference. First operand has 58 places, 67 transitions, 318 flow. Second operand 5 states and 163 transitions. [2022-12-13 09:28:23,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 694 flow [2022-12-13 09:28:23,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 118 transitions, 644 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 09:28:23,523 INFO L231 Difference]: Finished difference. Result has 61 places, 79 transitions, 464 flow [2022-12-13 09:28:23,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=464, PETRI_PLACES=61, PETRI_TRANSITIONS=79} [2022-12-13 09:28:23,523 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -33 predicate places. [2022-12-13 09:28:23,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:23,523 INFO L89 Accepts]: Start accepts. Operand has 61 places, 79 transitions, 464 flow [2022-12-13 09:28:23,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:23,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:23,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 79 transitions, 464 flow [2022-12-13 09:28:23,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 79 transitions, 464 flow [2022-12-13 09:28:23,657 INFO L130 PetriNetUnfolder]: 837/1875 cut-off events. [2022-12-13 09:28:23,658 INFO L131 PetriNetUnfolder]: For 196/325 co-relation queries the response was YES. [2022-12-13 09:28:23,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 1875 events. 837/1875 cut-off events. For 196/325 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 14830 event pairs, 81 based on Foata normal form. 4/941 useless extension candidates. Maximal degree in co-relation 5938. Up to 1270 conditions per place. [2022-12-13 09:28:23,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 79 transitions, 464 flow [2022-12-13 09:28:23,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 1766 [2022-12-13 09:28:23,687 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:28:23,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 09:28:23,688 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 79 transitions, 464 flow [2022-12-13 09:28:23,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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 09:28:23,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:23,688 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 09:28:23,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:28:23,689 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 09:28:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:23,689 INFO L85 PathProgramCache]: Analyzing trace with hash 269975651, now seen corresponding path program 1 times [2022-12-13 09:28:23,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:23,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598910844] [2022-12-13 09:28:23,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:23,926 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 09:28:23,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:23,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598910844] [2022-12-13 09:28:23,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598910844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:23,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:23,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:28:23,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786223902] [2022-12-13 09:28:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:23,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:28:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:23,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:28:23,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:28:23,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43 [2022-12-13 09:28:23,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 79 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 09:28:23,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:23,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43 [2022-12-13 09:28:23,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:24,562 INFO L130 PetriNetUnfolder]: 4775/7233 cut-off events. [2022-12-13 09:28:24,562 INFO L131 PetriNetUnfolder]: For 1962/1962 co-relation queries the response was YES. [2022-12-13 09:28:24,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25696 conditions, 7233 events. 4775/7233 cut-off events. For 1962/1962 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 41282 event pairs, 326 based on Foata normal form. 351/5131 useless extension candidates. Maximal degree in co-relation 25682. Up to 3115 conditions per place. [2022-12-13 09:28:24,595 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 58 selfloop transitions, 49 changer transitions 1/118 dead transitions. [2022-12-13 09:28:24,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 768 flow [2022-12-13 09:28:24,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:28:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2022-12-13 09:28:24,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2022-12-13 09:28:24,596 INFO L175 Difference]: Start difference. First operand has 61 places, 79 transitions, 464 flow. Second operand 6 states and 174 transitions. [2022-12-13 09:28:24,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 768 flow [2022-12-13 09:28:24,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 670 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-13 09:28:24,747 INFO L231 Difference]: Finished difference. Result has 64 places, 78 transitions, 488 flow [2022-12-13 09:28:24,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=64, PETRI_TRANSITIONS=78} [2022-12-13 09:28:24,747 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -30 predicate places. [2022-12-13 09:28:24,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:24,748 INFO L89 Accepts]: Start accepts. Operand has 64 places, 78 transitions, 488 flow [2022-12-13 09:28:24,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:24,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:24,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 78 transitions, 488 flow [2022-12-13 09:28:24,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 78 transitions, 488 flow [2022-12-13 09:28:24,791 INFO L130 PetriNetUnfolder]: 513/1038 cut-off events. [2022-12-13 09:28:24,791 INFO L131 PetriNetUnfolder]: For 519/630 co-relation queries the response was YES. [2022-12-13 09:28:24,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 1038 events. 513/1038 cut-off events. For 519/630 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 6394 event pairs, 0 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 3994. Up to 730 conditions per place. [2022-12-13 09:28:24,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 78 transitions, 488 flow [2022-12-13 09:28:24,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 1566 [2022-12-13 09:28:25,219 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:28:25,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 472 [2022-12-13 09:28:25,220 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 484 flow [2022-12-13 09:28:25,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 09:28:25,220 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:25,220 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 09:28:25,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:28:25,220 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 09:28:25,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:25,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1329210303, now seen corresponding path program 1 times [2022-12-13 09:28:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:25,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619427352] [2022-12-13 09:28:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:25,983 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 09:28:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619427352] [2022-12-13 09:28:25,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619427352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:25,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:25,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 09:28:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360865804] [2022-12-13 09:28:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:25,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 09:28:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 09:28:25,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 09:28:25,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2022-12-13 09:28:25,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 484 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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 09:28:25,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:25,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2022-12-13 09:28:25,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:26,678 INFO L130 PetriNetUnfolder]: 5335/8252 cut-off events. [2022-12-13 09:28:26,678 INFO L131 PetriNetUnfolder]: For 11059/11985 co-relation queries the response was YES. [2022-12-13 09:28:26,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30140 conditions, 8252 events. 5335/8252 cut-off events. For 11059/11985 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 52986 event pairs, 282 based on Foata normal form. 406/6733 useless extension candidates. Maximal degree in co-relation 30125. Up to 3262 conditions per place. [2022-12-13 09:28:26,720 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 116 selfloop transitions, 5 changer transitions 28/175 dead transitions. [2022-12-13 09:28:26,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 175 transitions, 1404 flow [2022-12-13 09:28:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:28:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:28:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-12-13 09:28:26,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.675 [2022-12-13 09:28:26,722 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 484 flow. Second operand 6 states and 162 transitions. [2022-12-13 09:28:26,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 175 transitions, 1404 flow [2022-12-13 09:28:27,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 175 transitions, 1102 flow, removed 60 selfloop flow, removed 4 redundant places. [2022-12-13 09:28:27,131 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 355 flow [2022-12-13 09:28:27,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2022-12-13 09:28:27,132 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -31 predicate places. [2022-12-13 09:28:27,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:27,132 INFO L89 Accepts]: Start accepts. Operand has 63 places, 77 transitions, 355 flow [2022-12-13 09:28:27,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:27,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:27,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 77 transitions, 355 flow [2022-12-13 09:28:27,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 77 transitions, 355 flow [2022-12-13 09:28:27,194 INFO L130 PetriNetUnfolder]: 1017/1623 cut-off events. [2022-12-13 09:28:27,194 INFO L131 PetriNetUnfolder]: For 1115/1145 co-relation queries the response was YES. [2022-12-13 09:28:27,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 1623 events. 1017/1623 cut-off events. For 1115/1145 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 9349 event pairs, 0 based on Foata normal form. 2/549 useless extension candidates. Maximal degree in co-relation 4495. Up to 730 conditions per place. [2022-12-13 09:28:27,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 77 transitions, 355 flow [2022-12-13 09:28:27,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 1606 [2022-12-13 09:28:27,235 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:28:27,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-13 09:28:27,236 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 355 flow [2022-12-13 09:28:27,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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 09:28:27,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:27,237 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 09:28:27,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:28:27,237 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 09:28:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash -867090551, now seen corresponding path program 1 times [2022-12-13 09:28:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:27,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669108809] [2022-12-13 09:28:27,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:27,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:27,419 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 09:28:27,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:27,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669108809] [2022-12-13 09:28:27,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669108809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:27,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:27,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:28:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37044692] [2022-12-13 09:28:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:27,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:28:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:28:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:28:27,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2022-12-13 09:28:27,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 09:28:27,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:27,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2022-12-13 09:28:27,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:28,729 INFO L130 PetriNetUnfolder]: 12014/17772 cut-off events. [2022-12-13 09:28:28,729 INFO L131 PetriNetUnfolder]: For 14063/14994 co-relation queries the response was YES. [2022-12-13 09:28:28,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55241 conditions, 17772 events. 12014/17772 cut-off events. For 14063/14994 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 116087 event pairs, 605 based on Foata normal form. 655/14561 useless extension candidates. Maximal degree in co-relation 55225. Up to 9577 conditions per place. [2022-12-13 09:28:28,835 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 116 selfloop transitions, 6 changer transitions 10/155 dead transitions. [2022-12-13 09:28:28,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 155 transitions, 985 flow [2022-12-13 09:28:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:28:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:28:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-12-13 09:28:28,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7125 [2022-12-13 09:28:28,837 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 355 flow. Second operand 4 states and 114 transitions. [2022-12-13 09:28:28,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 155 transitions, 985 flow [2022-12-13 09:28:30,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 155 transitions, 975 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:28:30,648 INFO L231 Difference]: Finished difference. Result has 65 places, 81 transitions, 392 flow [2022-12-13 09:28:30,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=65, PETRI_TRANSITIONS=81} [2022-12-13 09:28:30,648 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -29 predicate places. [2022-12-13 09:28:30,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:30,648 INFO L89 Accepts]: Start accepts. Operand has 65 places, 81 transitions, 392 flow [2022-12-13 09:28:30,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:30,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:30,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 81 transitions, 392 flow [2022-12-13 09:28:30,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 81 transitions, 392 flow [2022-12-13 09:28:30,844 INFO L130 PetriNetUnfolder]: 2142/3502 cut-off events. [2022-12-13 09:28:30,845 INFO L131 PetriNetUnfolder]: For 2174/2274 co-relation queries the response was YES. [2022-12-13 09:28:30,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9780 conditions, 3502 events. 2142/3502 cut-off events. For 2174/2274 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 24936 event pairs, 14 based on Foata normal form. 8/1158 useless extension candidates. Maximal degree in co-relation 9766. Up to 1621 conditions per place. [2022-12-13 09:28:30,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 81 transitions, 392 flow [2022-12-13 09:28:30,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 1826 [2022-12-13 09:28:30,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [378] L763-->L766: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] and [399] L823-->L839: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_58 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse9 (not .cse8)) (.cse4 (and .cse8 .cse11)) (.cse5 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_154 256) 0))) (let ((.cse1 (or .cse4 .cse5 .cse12)) (.cse2 (and .cse9 (not .cse12)))) (let ((.cse6 (ite .cse1 v_~a~0_97 (ite .cse2 v_~a$w_buff0~0_69 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_26 256) 0))) (.cse7 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse3 (= (mod v_~a$w_buff0_used~0_153 256) 0))) (and (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= (ite .cse0 v_~a$w_buff0_used~0_154 (ite .cse1 v_~a$w_buff0_used~0_154 (ite .cse2 0 v_~a$w_buff0_used~0_154))) v_~a$w_buff0_used~0_153) (= v_~weak$$choice2~0_26 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= (ite .cse0 v_~a$w_buff1_used~0_133 (ite (or .cse3 .cse4 .cse5) v_~a$w_buff1_used~0_133 0)) v_~a$w_buff1_used~0_132) (= v_~a~0_96 (ite .cse0 v_~a$mem_tmp~0_18 .cse6)) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a~0_97 v_~a$mem_tmp~0_18) (= v_~a$flush_delayed~0_25 0) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse7 .cse8) .cse3 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_60)))) (= .cse6 v_~__unbuffered_p3_EAX~0_10) (= (ite .cse0 v_~a$r_buff1_thd4~0_58 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse10 .cse11) (and .cse10 .cse7) .cse3)) v_~a$r_buff1_thd4~0_58 0)) v_~a$r_buff1_thd4~0_57) (= v_~a$w_buff0~0_69 v_~a$w_buff0~0_68)))))) InVars {~a~0=v_~a~0_97, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_69, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_58, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_154, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_57, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_153, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_96, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_68, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4] [2022-12-13 09:28:31,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:28:31,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 408 [2022-12-13 09:28:31,056 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 81 transitions, 394 flow [2022-12-13 09:28:31,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 09:28:31,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:31,057 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 09:28:31,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:28:31,057 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 09:28:31,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1199175919, now seen corresponding path program 2 times [2022-12-13 09:28:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:31,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678333982] [2022-12-13 09:28:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:31,217 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 09:28:31,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:31,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678333982] [2022-12-13 09:28:31,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678333982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:31,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:31,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:28:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392380268] [2022-12-13 09:28:31,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:31,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:28:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:31,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:28:31,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:28:31,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2022-12-13 09:28:31,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 81 transitions, 394 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 09:28:31,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:31,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2022-12-13 09:28:31,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:32,933 INFO L130 PetriNetUnfolder]: 16639/25286 cut-off events. [2022-12-13 09:28:32,933 INFO L131 PetriNetUnfolder]: For 23601/24806 co-relation queries the response was YES. [2022-12-13 09:28:32,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81647 conditions, 25286 events. 16639/25286 cut-off events. For 23601/24806 co-relation queries the response was YES. Maximal size of possible extension queue 1505. Compared 181685 event pairs, 1368 based on Foata normal form. 738/20058 useless extension candidates. Maximal degree in co-relation 81630. Up to 9730 conditions per place. [2022-12-13 09:28:33,021 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 109 selfloop transitions, 3 changer transitions 16/155 dead transitions. [2022-12-13 09:28:33,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 155 transitions, 1037 flow [2022-12-13 09:28:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:28:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:28:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2022-12-13 09:28:33,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2022-12-13 09:28:33,022 INFO L175 Difference]: Start difference. First operand has 65 places, 81 transitions, 394 flow. Second operand 4 states and 116 transitions. [2022-12-13 09:28:33,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 155 transitions, 1037 flow [2022-12-13 09:28:36,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 155 transitions, 1035 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:28:36,394 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 420 flow [2022-12-13 09:28:36,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=420, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2022-12-13 09:28:36,395 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -25 predicate places. [2022-12-13 09:28:36,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:36,395 INFO L89 Accepts]: Start accepts. Operand has 69 places, 83 transitions, 420 flow [2022-12-13 09:28:36,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:36,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:36,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 83 transitions, 420 flow [2022-12-13 09:28:36,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 83 transitions, 420 flow [2022-12-13 09:28:36,627 INFO L130 PetriNetUnfolder]: 3919/6226 cut-off events. [2022-12-13 09:28:36,628 INFO L131 PetriNetUnfolder]: For 3378/3786 co-relation queries the response was YES. [2022-12-13 09:28:36,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17079 conditions, 6226 events. 3919/6226 cut-off events. For 3378/3786 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 46601 event pairs, 20 based on Foata normal form. 7/1928 useless extension candidates. Maximal degree in co-relation 17063. Up to 2836 conditions per place. [2022-12-13 09:28:36,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 83 transitions, 420 flow [2022-12-13 09:28:36,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-13 09:28:36,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:28:36,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 313 [2022-12-13 09:28:36,708 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 420 flow [2022-12-13 09:28:36,709 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 09:28:36,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:36,709 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 09:28:36,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:28:36,709 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 09:28:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -758994869, now seen corresponding path program 1 times [2022-12-13 09:28:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:36,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860032246] [2022-12-13 09:28:36,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:36,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:36,868 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 09:28:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:36,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860032246] [2022-12-13 09:28:36,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860032246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:36,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:36,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:28:36,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553438798] [2022-12-13 09:28:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:36,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:28:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:28:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:28:36,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2022-12-13 09:28:36,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 420 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 09:28:36,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:36,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2022-12-13 09:28:36,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:39,595 INFO L130 PetriNetUnfolder]: 26152/39126 cut-off events. [2022-12-13 09:28:39,595 INFO L131 PetriNetUnfolder]: For 35791/37580 co-relation queries the response was YES. [2022-12-13 09:28:39,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128166 conditions, 39126 events. 26152/39126 cut-off events. For 35791/37580 co-relation queries the response was YES. Maximal size of possible extension queue 2624. Compared 291249 event pairs, 3989 based on Foata normal form. 932/30042 useless extension candidates. Maximal degree in co-relation 128147. Up to 14088 conditions per place. [2022-12-13 09:28:39,795 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 67 selfloop transitions, 1 changer transitions 55/150 dead transitions. [2022-12-13 09:28:39,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 150 transitions, 1016 flow [2022-12-13 09:28:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:28:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:28:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-12-13 09:28:39,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2022-12-13 09:28:39,796 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 420 flow. Second operand 4 states and 110 transitions. [2022-12-13 09:28:39,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 150 transitions, 1016 flow [2022-12-13 09:28:49,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 150 transitions, 1014 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:28:49,892 INFO L231 Difference]: Finished difference. Result has 73 places, 80 transitions, 401 flow [2022-12-13 09:28:49,892 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2022-12-13 09:28:49,892 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -21 predicate places. [2022-12-13 09:28:49,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:49,892 INFO L89 Accepts]: Start accepts. Operand has 73 places, 80 transitions, 401 flow [2022-12-13 09:28:49,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:49,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:49,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 80 transitions, 401 flow [2022-12-13 09:28:49,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 80 transitions, 401 flow [2022-12-13 09:28:50,000 INFO L130 PetriNetUnfolder]: 1629/2764 cut-off events. [2022-12-13 09:28:50,000 INFO L131 PetriNetUnfolder]: For 3288/3392 co-relation queries the response was YES. [2022-12-13 09:28:50,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 2764 events. 1629/2764 cut-off events. For 3288/3392 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 19031 event pairs, 2 based on Foata normal form. 8/912 useless extension candidates. Maximal degree in co-relation 8059. Up to 1297 conditions per place. [2022-12-13 09:28:50,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 80 transitions, 401 flow [2022-12-13 09:28:50,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 1626 [2022-12-13 09:28:50,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L823: Formula: (and (= v_~z~0_11 1) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_11, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] and [563] L763-->L839: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_316 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_312 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 (= (mod v_~a$w_buff1_used~0_561 256) 0))) (.cse3 (and .cse10 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_630 256) 0))) (let ((.cse5 (or .cse1 .cse3 .cse12)) (.cse6 (and .cse11 (not .cse12)))) (let ((.cse4 (ite .cse5 v_~a~0_487 (ite .cse6 v_~a$w_buff0~0_389 v_~a$w_buff1~0_322))) (.cse0 (not (= (mod v_~weak$$choice2~0_98 256) 0))) (.cse9 (= (mod v_~a$w_buff1_used~0_560 256) 0)) (.cse2 (= (mod v_~a$w_buff0_used~0_629 256) 0))) (and (= (ite .cse0 v_~a$w_buff1_used~0_561 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_561 0)) v_~a$w_buff1_used~0_560) (= v_~a~0_486 (ite .cse0 v_~a$mem_tmp~0_98 .cse4)) (= v_~__unbuffered_p3_EAX~0_128 .cse4) (= v_~weak$$choice2~0_98 |v_P3Thread1of1ForFork0_#t~nondet4_118|) (= v_~a$flush_delayed~0_99 0) (= v_~a$w_buff0_used~0_629 (ite .cse0 v_~a$w_buff0_used~0_630 (ite .cse5 v_~a$w_buff0_used~0_630 (ite .cse6 0 v_~a$w_buff0_used~0_630)))) (= v_~a$w_buff0~0_389 v_~a$w_buff0~0_388) (= (ite .cse0 v_~a$r_buff1_thd4~0_316 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_311 256) 0))) (or (and .cse7 .cse8) (and .cse9 .cse7) .cse2)) v_~a$r_buff1_thd4~0_316 0)) v_~a$r_buff1_thd4~0_315) (= v_~x~0_49 v_~__unbuffered_p0_EAX~0_90) (= v_~weak$$choice0~0_79 |v_P3Thread1of1ForFork0_#t~nondet3_118|) (= (ite .cse0 v_~a$r_buff0_thd4~0_312 (ite (or (and .cse10 .cse9) .cse2 .cse3) v_~a$r_buff0_thd4~0_312 (ite (and .cse11 (not .cse2)) 0 v_~a$r_buff0_thd4~0_312))) v_~a$r_buff0_thd4~0_311) (= v_~a~0_487 v_~a$mem_tmp~0_98) (= v_~a$w_buff1~0_322 v_~a$w_buff1~0_321)))))) InVars {~a~0=v_~a~0_487, ~a$w_buff1~0=v_~a$w_buff1~0_322, ~a$w_buff0~0=v_~a$w_buff0~0_389, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_316, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_630, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_561, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_312, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_118|, ~x~0=v_~x~0_49, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_118|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_315, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_629, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_311, ~a~0=v_~a~0_486, ~a$mem_tmp~0=v_~a$mem_tmp~0_98, ~weak$$choice0~0=v_~weak$$choice0~0_79, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_90, ~a$w_buff1~0=v_~a$w_buff1~0_321, ~a$flush_delayed~0=v_~a$flush_delayed~0_99, ~a$w_buff0~0=v_~a$w_buff0~0_388, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_128, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_560, ~weak$$choice2~0=v_~weak$$choice2~0_98, ~x~0=v_~x~0_49} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~__unbuffered_p3_EAX~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4] [2022-12-13 09:28:50,636 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:28:50,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 745 [2022-12-13 09:28:50,637 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 78 transitions, 402 flow [2022-12-13 09:28:50,638 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 09:28:50,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:50,638 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] [2022-12-13 09:28:50,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:28:50,638 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 09:28:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 743053356, now seen corresponding path program 1 times [2022-12-13 09:28:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:50,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452283363] [2022-12-13 09:28:50,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:28:50,826 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 09:28:50,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:28:50,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452283363] [2022-12-13 09:28:50,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452283363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:28:50,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:28:50,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:28:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68854313] [2022-12-13 09:28:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:28:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:28:50,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:28:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:28:50,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:28:50,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2022-12-13 09:28:50,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 78 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 09:28:50,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:28:50,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2022-12-13 09:28:50,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:28:51,795 INFO L130 PetriNetUnfolder]: 8445/13084 cut-off events. [2022-12-13 09:28:51,795 INFO L131 PetriNetUnfolder]: For 17626/18128 co-relation queries the response was YES. [2022-12-13 09:28:51,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44167 conditions, 13084 events. 8445/13084 cut-off events. For 17626/18128 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 88166 event pairs, 1205 based on Foata normal form. 378/10256 useless extension candidates. Maximal degree in co-relation 44146. Up to 5207 conditions per place. [2022-12-13 09:28:51,885 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 4 changer transitions 58/147 dead transitions. [2022-12-13 09:28:51,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 1001 flow [2022-12-13 09:28:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:28:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:28:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 09:28:51,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.675 [2022-12-13 09:28:51,886 INFO L175 Difference]: Start difference. First operand has 68 places, 78 transitions, 402 flow. Second operand 4 states and 108 transitions. [2022-12-13 09:28:51,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 1001 flow [2022-12-13 09:28:53,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 994 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 09:28:53,171 INFO L231 Difference]: Finished difference. Result has 69 places, 77 transitions, 399 flow [2022-12-13 09:28:53,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=69, PETRI_TRANSITIONS=77} [2022-12-13 09:28:53,172 INFO L295 CegarLoopForPetriNet]: 94 programPoint places, -25 predicate places. [2022-12-13 09:28:53,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:28:53,172 INFO L89 Accepts]: Start accepts. Operand has 69 places, 77 transitions, 399 flow [2022-12-13 09:28:53,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:28:53,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:28:53,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 77 transitions, 399 flow [2022-12-13 09:28:53,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 77 transitions, 399 flow [2022-12-13 09:28:53,288 INFO L130 PetriNetUnfolder]: 1616/2723 cut-off events. [2022-12-13 09:28:53,289 INFO L131 PetriNetUnfolder]: For 2611/2680 co-relation queries the response was YES. [2022-12-13 09:28:53,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7911 conditions, 2723 events. 1616/2723 cut-off events. For 2611/2680 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 18929 event pairs, 2 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 7894. Up to 1297 conditions per place. [2022-12-13 09:28:53,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 77 transitions, 399 flow [2022-12-13 09:28:53,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 1426 [2022-12-13 09:28:53,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:28:53,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 211 [2022-12-13 09:28:53,384 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 77 transitions, 403 flow [2022-12-13 09:28:53,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 09:28:53,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:28:53,384 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] [2022-12-13 09:28:53,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:28:53,384 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 09:28:53,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:28:53,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1443701720, now seen corresponding path program 1 times [2022-12-13 09:28:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:28:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672307711] [2022-12-13 09:28:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:28:53,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:28:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:28:53,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:28:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:28:53,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:28:53,568 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:28:53,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 09:28:53,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 09:28:53,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 09:28:53,579 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 09:28:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 09:28:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 09:28:53,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 09:28:53,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:28:53,582 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:28:53,587 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:28:53,588 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:28:53,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:28:53 BasicIcfg [2022-12-13 09:28:53,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:28:53,697 INFO L158 Benchmark]: Toolchain (without parser) took 48760.25ms. Allocated memory was 187.7MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 162.5MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-13 09:28:53,697 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:28:53,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.74ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 134.7MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 09:28:53,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.43ms. Allocated memory is still 187.7MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:28:53,698 INFO L158 Benchmark]: Boogie Preprocessor took 48.96ms. Allocated memory is still 187.7MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:28:53,698 INFO L158 Benchmark]: RCFGBuilder took 681.92ms. Allocated memory is still 187.7MB. Free memory was 130.0MB in the beginning and 92.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-13 09:28:53,698 INFO L158 Benchmark]: TraceAbstraction took 47627.46ms. Allocated memory was 187.7MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 91.2MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-13 09:28:53,699 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.09ms. Allocated memory is still 187.7MB. Free memory is still 164.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 347.74ms. Allocated memory is still 187.7MB. Free memory was 162.5MB in the beginning and 134.7MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.43ms. Allocated memory is still 187.7MB. Free memory was 134.7MB in the beginning and 132.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.96ms. Allocated memory is still 187.7MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 681.92ms. Allocated memory is still 187.7MB. Free memory was 130.0MB in the beginning and 92.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 47627.46ms. Allocated memory was 187.7MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 91.2MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 137 PlacesBefore, 94 PlacesAfterwards, 126 TransitionsBefore, 82 TransitionsAfterwards, 3058 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 51 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5131, independent: 4950, independent conditional: 4950, independent unconditional: 0, dependent: 181, dependent conditional: 181, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3045, independent: 2983, independent conditional: 0, independent unconditional: 2983, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3045, independent: 2983, independent conditional: 0, independent unconditional: 2983, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3045, independent: 2903, independent conditional: 0, independent unconditional: 2903, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 261, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5131, independent: 1967, independent conditional: 1967, independent unconditional: 0, dependent: 119, dependent conditional: 119, dependent unconditional: 0, unknown: 3045, unknown conditional: 3045, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3047, Positive cache size: 2985, Positive conditional cache size: 2985, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: CachedIndependenceRelation.Independence Queries: [ total: 440, independent: 394, independent conditional: 394, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 403, independent: 371, independent conditional: 19, independent unconditional: 352, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 403, independent: 371, independent conditional: 19, independent unconditional: 352, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 403, independent: 290, independent conditional: 0, independent unconditional: 290, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 32, dependent conditional: 4, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 170, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 113, dependent conditional: 21, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 440, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 403, unknown conditional: 403, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 371, Positive conditional cache size: 371, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, independent: 83, independent conditional: 21, independent unconditional: 62, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94, independent: 83, independent conditional: 21, independent unconditional: 62, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 133, independent conditional: 133, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 94, unknown conditional: 94, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 497, Positive cache size: 454, Positive conditional cache size: 454, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 58 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1742 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 269, independent: 213, independent conditional: 213, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 269, independent: 193, independent conditional: 193, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 474, Positive conditional cache size: 474, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 447, independent: 379, independent conditional: 379, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 38, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, independent: 52, independent conditional: 38, independent unconditional: 14, 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: 52, independent: 52, independent conditional: 0, independent unconditional: 52, 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: 447, independent: 327, independent conditional: 327, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 575, Positive cache size: 526, Positive conditional cache size: 526, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 63 PlacesBefore, 61 PlacesAfterwards, 78 TransitionsBefore, 76 TransitionsAfterwards, 1566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 736, independent: 608, independent conditional: 608, independent unconditional: 0, dependent: 128, dependent conditional: 128, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 736, independent: 587, independent conditional: 587, independent unconditional: 0, dependent: 128, dependent conditional: 128, dependent unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 547, Positive conditional cache size: 547, Positive unconditional cache size: 0, Negative cache size: 49, Negative conditional cache size: 49, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 63 PlacesBefore, 63 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 172, independent conditional: 172, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 60, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 118, independent conditional: 118, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 60, unknown conditional: 60, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 601, Positive conditional cache size: 601, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 65 PlacesBefore, 65 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1826 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 421, independent: 330, independent conditional: 330, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 77, independent conditional: 57, independent unconditional: 20, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 80, independent: 77, independent conditional: 57, independent unconditional: 20, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 80, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 421, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 88, dependent conditional: 88, dependent unconditional: 0, unknown: 80, unknown conditional: 80, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 678, Positive conditional cache size: 678, Positive unconditional cache size: 0, Negative cache size: 58, Negative conditional cache size: 58, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 303, independent: 255, independent conditional: 255, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 26, independent conditional: 17, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 26, independent conditional: 17, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 303, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 763, Positive cache size: 704, Positive conditional cache size: 704, Positive unconditional cache size: 0, Negative cache size: 59, Negative conditional cache size: 59, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 70 PlacesBefore, 68 PlacesAfterwards, 80 TransitionsBefore, 78 TransitionsAfterwards, 1626 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 813, independent: 700, independent conditional: 700, independent unconditional: 0, dependent: 113, dependent conditional: 113, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 101, independent conditional: 62, independent unconditional: 39, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 102, independent: 101, independent conditional: 62, independent unconditional: 39, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 102, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 813, independent: 599, independent conditional: 599, independent unconditional: 0, dependent: 112, dependent conditional: 112, dependent unconditional: 0, unknown: 102, unknown conditional: 102, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 865, Positive cache size: 805, Positive conditional cache size: 805, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 69 PlacesBefore, 69 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 567, independent: 459, independent conditional: 459, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 27, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, independent: 50, independent conditional: 27, independent unconditional: 23, 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: 50, independent: 50, independent conditional: 0, independent unconditional: 50, 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: 567, independent: 409, independent conditional: 409, independent unconditional: 0, dependent: 108, dependent conditional: 108, dependent unconditional: 0, unknown: 50, unknown conditional: 50, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 915, Positive cache size: 855, Positive conditional cache size: 855, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L863] 0 pthread_t t1321; [L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t1321, ((void *)0), P0, ((void *)0))=-2, t1321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1322; [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1322, ((void *)0), P1, ((void *)0))=-1, t1321={5:0}, t1322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L867] 0 pthread_t t1323; [L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1323, ((void *)0), P2, ((void *)0))=0, t1321={5:0}, t1322={6:0}, t1323={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1324; [L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1324, ((void *)0), P3, ((void *)0))=1, t1321={5:0}, t1322={6:0}, t1323={7:0}, t1324={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, z=0] [L788] 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) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 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 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 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_p0_EAX=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=1, y=0, z=0] [L802] 3 y = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=0] [L808] 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) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 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 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 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_p0_EAX=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=1, z=0] [L822] 4 z = 1 [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 a$flush_delayed = weak$$choice2 [L828] 4 a$mem_tmp = a [L829] 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) [L830] 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)) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 4 __unbuffered_p3_EAX = a [L837] 4 a = a$flush_delayed ? a$mem_tmp : a [L838] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=1] [L768] 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) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 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 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 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_p0_EAX=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=1, y=1, z=1] [L841] 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) [L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L843] 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 [L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L845] 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_p0_EAX=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=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, y=1, z=1] [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, y=1, z=1] [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L874] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L874] RET 0 assume_abort_if_not(main$tmp_guard0) [L876] 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) [L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L878] 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 [L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L880] 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 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L885] 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_p0_EAX=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, 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: 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. - 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: 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: 870]: 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, 166 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: 47.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 413 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1305 IncrementalHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 11 mSDtfsCounter, 1305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=5, InterpolantAutomatonStates: 43, 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.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 09:28:53,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...