/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:43:39,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:43:39,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:43:39,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:43:39,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:43:39,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:43:39,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:43:39,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:43:39,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:43:39,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:43:39,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:43:39,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:43:39,416 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:43:39,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:43:39,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:43:39,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:43:39,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:43:39,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:43:39,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:43:39,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:43:39,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:43:39,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:43:39,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:43:39,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:43:39,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:43:39,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:43:39,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:43:39,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:43:39,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:43:39,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:43:39,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:43:39,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:43:39,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:43:39,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:43:39,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:43:39,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:43:39,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:43:39,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:43:39,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:43:39,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:43:39,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:43:39,437 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:43:39,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:43:39,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:43:39,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:43:39,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:43:39,481 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:43:39,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:43:39,481 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:43:39,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:43:39,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:43:39,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:43:39,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:43:39,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:43:39,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:43:39,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:43:39,483 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 11:43:39,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:43:39,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:43:39,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:43:39,774 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:43:39,774 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:43:39,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2022-12-13 11:43:40,703 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:43:40,882 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:43:40,882 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i [2022-12-13 11:43:40,909 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf11a0d/03ec17b9ff124fe9844bfa6d9c5673e9/FLAGe6e1df694 [2022-12-13 11:43:40,944 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10bf11a0d/03ec17b9ff124fe9844bfa6d9c5673e9 [2022-12-13 11:43:40,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:43:40,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:43:40,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:43:40,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:43:40,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:43:40,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:43:40" (1/1) ... [2022-12-13 11:43:40,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2318ee47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:40, skipping insertion in model container [2022-12-13 11:43:40,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:43:40" (1/1) ... [2022-12-13 11:43:40,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:43:40,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:43:41,077 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/mix001.oepc.i[988,1001] [2022-12-13 11:43:41,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:43:41,267 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:43:41,274 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/mix001.oepc.i[988,1001] [2022-12-13 11:43:41,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:43:41,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:43:41,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:43:41,356 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:43:41,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41 WrapperNode [2022-12-13 11:43:41,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:43:41,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:43:41,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:43:41,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:43:41,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,390 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 11:43:41,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:43:41,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:43:41,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:43:41,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:43:41,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:43:41,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:43:41,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:43:41,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:43:41,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (1/1) ... [2022-12-13 11:43:41,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:43:41,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:43:41,432 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 11:43:41,468 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 11:43:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:43:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:43:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:43:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:43:41,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:43:41,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:43:41,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:43:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:43:41,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:43:41,497 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 11:43:41,666 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:43:41,667 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:43:41,906 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:43:42,032 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:43:42,032 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:43:42,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:43:42 BoogieIcfgContainer [2022-12-13 11:43:42,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:43:42,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:43:42,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:43:42,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:43:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:43:40" (1/3) ... [2022-12-13 11:43:42,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a381949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:43:42, skipping insertion in model container [2022-12-13 11:43:42,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:43:41" (2/3) ... [2022-12-13 11:43:42,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a381949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:43:42, skipping insertion in model container [2022-12-13 11:43:42,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:43:42" (3/3) ... [2022-12-13 11:43:42,041 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.oepc.i [2022-12-13 11:43:42,054 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:43:42,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:43:42,055 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:43:42,108 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:43:42,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 11:43:42,191 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 11:43:42,191 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:42,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 11:43:42,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 11:43:42,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-13 11:43:42,199 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:42,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 11:43:42,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-13 11:43:42,250 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 11:43:42,250 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:42,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 11:43:42,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 11:43:42,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 2230 [2022-12-13 11:43:46,487 INFO L241 LiptonReduction]: Total number of compositions: 89 [2022-12-13 11:43:46,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:43:46,507 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;@509cdca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:43:46,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:43:46,511 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-13 11:43:46,511 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:46,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:46,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 11:43:46,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:46,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash 532569, now seen corresponding path program 1 times [2022-12-13 11:43:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:46,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968316708] [2022-12-13 11:43:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:46,788 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 11:43:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:46,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968316708] [2022-12-13 11:43:46,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968316708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:46,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:46,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:43:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318503051] [2022-12-13 11:43:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:46,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 68 [2022-12-13 11:43:46,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 11:43:46,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:46,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 68 [2022-12-13 11:43:46,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:48,184 INFO L130 PetriNetUnfolder]: 11245/17699 cut-off events. [2022-12-13 11:43:48,184 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 11:43:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33740 conditions, 17699 events. 11245/17699 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1031. Compared 137082 event pairs, 1220 based on Foata normal form. 0/11262 useless extension candidates. Maximal degree in co-relation 33729. Up to 13956 conditions per place. [2022-12-13 11:43:48,234 INFO L137 encePairwiseOnDemand]: 64/68 looper letters, 37 selfloop transitions, 2 changer transitions 59/111 dead transitions. [2022-12-13 11:43:48,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 431 flow [2022-12-13 11:43:48,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:48,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-12-13 11:43:48,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696078431372549 [2022-12-13 11:43:48,244 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 145 flow. Second operand 3 states and 142 transitions. [2022-12-13 11:43:48,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 431 flow [2022-12-13 11:43:48,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 426 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:43:48,248 INFO L231 Difference]: Finished difference. Result has 75 places, 36 transitions, 82 flow [2022-12-13 11:43:48,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=75, PETRI_TRANSITIONS=36} [2022-12-13 11:43:48,252 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2022-12-13 11:43:48,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:48,253 INFO L89 Accepts]: Start accepts. Operand has 75 places, 36 transitions, 82 flow [2022-12-13 11:43:48,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:48,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:48,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 36 transitions, 82 flow [2022-12-13 11:43:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2022-12-13 11:43:48,260 INFO L130 PetriNetUnfolder]: 0/36 cut-off events. [2022-12-13 11:43:48,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:48,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 93 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:43:48,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2022-12-13 11:43:48,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 752 [2022-12-13 11:43:48,417 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:48,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 11:43:48,419 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 82 flow [2022-12-13 11:43:48,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 11:43:48,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:48,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:48,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:43:48,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2075158031, now seen corresponding path program 1 times [2022-12-13 11:43:48,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:48,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834098589] [2022-12-13 11:43:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:48,648 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 11:43:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:48,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834098589] [2022-12-13 11:43:48,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834098589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:48,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:48,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:43:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463227692] [2022-12-13 11:43:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:48,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:48,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2022-12-13 11:43:48,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 11:43:48,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:48,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2022-12-13 11:43:48,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:48,950 INFO L130 PetriNetUnfolder]: 1991/3243 cut-off events. [2022-12-13 11:43:48,950 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-13 11:43:48,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6357 conditions, 3243 events. 1991/3243 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19719 event pairs, 571 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 6347. Up to 2159 conditions per place. [2022-12-13 11:43:48,970 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 36 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2022-12-13 11:43:48,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 198 flow [2022-12-13 11:43:48,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 11:43:48,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7129629629629629 [2022-12-13 11:43:48,984 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 82 flow. Second operand 3 states and 77 transitions. [2022-12-13 11:43:48,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 198 flow [2022-12-13 11:43:48,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:48,985 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 84 flow [2022-12-13 11:43:48,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 11:43:48,986 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:43:48,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:48,986 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 84 flow [2022-12-13 11:43:48,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:48,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:48,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 84 flow [2022-12-13 11:43:48,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 84 flow [2022-12-13 11:43:48,990 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 11:43:48,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:43:48,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:43:48,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 84 flow [2022-12-13 11:43:48,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 698 [2022-12-13 11:43:49,033 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:49,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 11:43:49,035 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 84 flow [2022-12-13 11:43:49,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 11:43:49,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:49,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:43:49,035 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1448972147, now seen corresponding path program 1 times [2022-12-13 11:43:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:49,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260061562] [2022-12-13 11:43:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:49,230 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 11:43:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:49,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260061562] [2022-12-13 11:43:49,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260061562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:49,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:49,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:43:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771139580] [2022-12-13 11:43:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:49,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:43:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:43:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:43:49,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:43:49,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 11:43:49,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:49,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:43:49,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:49,558 INFO L130 PetriNetUnfolder]: 2914/4463 cut-off events. [2022-12-13 11:43:49,558 INFO L131 PetriNetUnfolder]: For 376/376 co-relation queries the response was YES. [2022-12-13 11:43:49,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9314 conditions, 4463 events. 2914/4463 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23306 event pairs, 744 based on Foata normal form. 70/3967 useless extension candidates. Maximal degree in co-relation 9303. Up to 3291 conditions per place. [2022-12-13 11:43:49,581 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 41 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-12-13 11:43:49,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 207 flow [2022-12-13 11:43:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 11:43:49,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2022-12-13 11:43:49,585 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 84 flow. Second operand 3 states and 68 transitions. [2022-12-13 11:43:49,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 207 flow [2022-12-13 11:43:49,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:49,586 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 88 flow [2022-12-13 11:43:49,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 11:43:49,587 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:43:49,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:49,588 INFO L89 Accepts]: Start accepts. Operand has 46 places, 35 transitions, 88 flow [2022-12-13 11:43:49,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:49,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:49,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 88 flow [2022-12-13 11:43:49,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 88 flow [2022-12-13 11:43:49,592 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 11:43:49,592 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 11:43:49,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 35 events. 0/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:43:49,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 88 flow [2022-12-13 11:43:49,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-13 11:43:49,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:43:49,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 11:43:49,638 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 86 flow [2022-12-13 11:43:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 11:43:49,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:49,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:43:49,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1695574910, now seen corresponding path program 1 times [2022-12-13 11:43:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:49,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730141885] [2022-12-13 11:43:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:49,730 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 11:43:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:49,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730141885] [2022-12-13 11:43:49,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730141885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:49,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:49,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:43:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145544413] [2022-12-13 11:43:49,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:49,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:49,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:49,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 11:43:49,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:49,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:49,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 11:43:49,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:49,943 INFO L130 PetriNetUnfolder]: 1652/2576 cut-off events. [2022-12-13 11:43:49,944 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2022-12-13 11:43:49,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5644 conditions, 2576 events. 1652/2576 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12983 event pairs, 497 based on Foata normal form. 32/2201 useless extension candidates. Maximal degree in co-relation 5632. Up to 1750 conditions per place. [2022-12-13 11:43:49,954 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 11:43:49,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 182 flow [2022-12-13 11:43:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-13 11:43:49,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2022-12-13 11:43:49,955 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 86 flow. Second operand 3 states and 66 transitions. [2022-12-13 11:43:49,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 182 flow [2022-12-13 11:43:49,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:49,956 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 90 flow [2022-12-13 11:43:49,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2022-12-13 11:43:49,957 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:43:49,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:49,957 INFO L89 Accepts]: Start accepts. Operand has 46 places, 34 transitions, 90 flow [2022-12-13 11:43:49,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:49,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:49,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 90 flow [2022-12-13 11:43:49,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 90 flow [2022-12-13 11:43:49,961 INFO L130 PetriNetUnfolder]: 0/34 cut-off events. [2022-12-13 11:43:49,961 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 11:43:49,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 34 events. 0/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 98 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 11:43:49,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 90 flow [2022-12-13 11:43:49,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 11:43:50,007 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:43:50,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 11:43:50,008 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 88 flow [2022-12-13 11:43:50,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:50,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:50,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:50,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:43:50,008 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1023742404, now seen corresponding path program 1 times [2022-12-13 11:43:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:50,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153051422] [2022-12-13 11:43:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:50,125 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 11:43:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:50,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153051422] [2022-12-13 11:43:50,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153051422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:50,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:50,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:43:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505339764] [2022-12-13 11:43:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:50,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:43:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:43:50,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:43:50,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:43:50,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:50,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:50,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:43:50,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:50,362 INFO L130 PetriNetUnfolder]: 1957/3020 cut-off events. [2022-12-13 11:43:50,362 INFO L131 PetriNetUnfolder]: For 774/774 co-relation queries the response was YES. [2022-12-13 11:43:50,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 3020 events. 1957/3020 cut-off events. For 774/774 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15472 event pairs, 547 based on Foata normal form. 48/2230 useless extension candidates. Maximal degree in co-relation 6957. Up to 2803 conditions per place. [2022-12-13 11:43:50,374 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 37 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-13 11:43:50,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 233 flow [2022-12-13 11:43:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:43:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:43:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 11:43:50,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2022-12-13 11:43:50,375 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 88 flow. Second operand 3 states and 69 transitions. [2022-12-13 11:43:50,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 233 flow [2022-12-13 11:43:50,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 227 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:43:50,377 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 152 flow [2022-12-13 11:43:50,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 11:43:50,378 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -32 predicate places. [2022-12-13 11:43:50,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:50,378 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 152 flow [2022-12-13 11:43:50,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:50,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:50,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 152 flow [2022-12-13 11:43:50,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 152 flow [2022-12-13 11:43:50,404 INFO L130 PetriNetUnfolder]: 216/489 cut-off events. [2022-12-13 11:43:50,405 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-12-13 11:43:50,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 489 events. 216/489 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3211 event pairs, 108 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 1034. Up to 343 conditions per place. [2022-12-13 11:43:50,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 152 flow [2022-12-13 11:43:50,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 11:43:50,428 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:50,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 11:43:50,430 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 152 flow [2022-12-13 11:43:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:50,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:50,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:50,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:43:50,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 390473561, now seen corresponding path program 1 times [2022-12-13 11:43:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:50,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410329526] [2022-12-13 11:43:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:50,596 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 11:43:50,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:50,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410329526] [2022-12-13 11:43:50,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410329526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:50,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:50,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:43:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655448040] [2022-12-13 11:43:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:50,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:43:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:43:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:43:50,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:43:50,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 11:43:50,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:50,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:43:50,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:50,809 INFO L130 PetriNetUnfolder]: 1033/1808 cut-off events. [2022-12-13 11:43:50,809 INFO L131 PetriNetUnfolder]: For 438/438 co-relation queries the response was YES. [2022-12-13 11:43:50,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 1808 events. 1033/1808 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9844 event pairs, 178 based on Foata normal form. 120/1438 useless extension candidates. Maximal degree in co-relation 5175. Up to 1171 conditions per place. [2022-12-13 11:43:50,817 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 47 selfloop transitions, 19 changer transitions 0/73 dead transitions. [2022-12-13 11:43:50,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 376 flow [2022-12-13 11:43:50,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:43:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:43:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 11:43:50,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2022-12-13 11:43:50,818 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 152 flow. Second operand 4 states and 95 transitions. [2022-12-13 11:43:50,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 376 flow [2022-12-13 11:43:50,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:50,821 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 254 flow [2022-12-13 11:43:50,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-13 11:43:50,822 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-13 11:43:50,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:50,822 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 254 flow [2022-12-13 11:43:50,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:50,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:50,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 254 flow [2022-12-13 11:43:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 254 flow [2022-12-13 11:43:50,847 INFO L130 PetriNetUnfolder]: 162/408 cut-off events. [2022-12-13 11:43:50,847 INFO L131 PetriNetUnfolder]: For 177/213 co-relation queries the response was YES. [2022-12-13 11:43:50,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 408 events. 162/408 cut-off events. For 177/213 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2518 event pairs, 27 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 1187. Up to 280 conditions per place. [2022-12-13 11:43:50,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 254 flow [2022-12-13 11:43:50,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-13 11:43:50,852 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:50,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 11:43:50,853 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 254 flow [2022-12-13 11:43:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 11:43:50,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:50,853 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 11:43:50,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:43:50,854 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:50,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash -481387398, now seen corresponding path program 1 times [2022-12-13 11:43:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:50,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135900720] [2022-12-13 11:43:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:51,020 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 11:43:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:51,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135900720] [2022-12-13 11:43:51,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135900720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:51,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:51,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:43:51,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695603861] [2022-12-13 11:43:51,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:51,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:43:51,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:51,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:43:51,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:43:51,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:43:51,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 11:43:51,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:51,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:43:51,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:51,180 INFO L130 PetriNetUnfolder]: 610/1124 cut-off events. [2022-12-13 11:43:51,180 INFO L131 PetriNetUnfolder]: For 348/348 co-relation queries the response was YES. [2022-12-13 11:43:51,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 1124 events. 610/1124 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5754 event pairs, 97 based on Foata normal form. 99/895 useless extension candidates. Maximal degree in co-relation 3798. Up to 511 conditions per place. [2022-12-13 11:43:51,184 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 38 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2022-12-13 11:43:51,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 442 flow [2022-12-13 11:43:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:43:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:43:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-13 11:43:51,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2022-12-13 11:43:51,185 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 254 flow. Second operand 5 states and 102 transitions. [2022-12-13 11:43:51,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 442 flow [2022-12-13 11:43:51,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 386 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-13 11:43:51,188 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 280 flow [2022-12-13 11:43:51,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-13 11:43:51,189 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -29 predicate places. [2022-12-13 11:43:51,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:51,189 INFO L89 Accepts]: Start accepts. Operand has 49 places, 51 transitions, 280 flow [2022-12-13 11:43:51,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:51,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:51,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 51 transitions, 280 flow [2022-12-13 11:43:51,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 280 flow [2022-12-13 11:43:51,201 INFO L130 PetriNetUnfolder]: 81/246 cut-off events. [2022-12-13 11:43:51,201 INFO L131 PetriNetUnfolder]: For 66/96 co-relation queries the response was YES. [2022-12-13 11:43:51,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 246 events. 81/246 cut-off events. For 66/96 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1316 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 788. Up to 163 conditions per place. [2022-12-13 11:43:51,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 51 transitions, 280 flow [2022-12-13 11:43:51,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-13 11:43:51,595 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:43:51,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 407 [2022-12-13 11:43:51,596 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 276 flow [2022-12-13 11:43:51,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 11:43:51,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:51,596 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] [2022-12-13 11:43:51,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:43:51,596 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1634940514, now seen corresponding path program 1 times [2022-12-13 11:43:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:51,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667346580] [2022-12-13 11:43:51,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:51,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:52,612 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 11:43:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667346580] [2022-12-13 11:43:52,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667346580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:52,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:52,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:43:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254216464] [2022-12-13 11:43:52,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:52,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:43:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:52,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:43:52,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:43:52,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2022-12-13 11:43:52,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 276 flow. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 11:43:52,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:52,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2022-12-13 11:43:52,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:52,954 INFO L130 PetriNetUnfolder]: 939/1681 cut-off events. [2022-12-13 11:43:52,954 INFO L131 PetriNetUnfolder]: For 1909/2036 co-relation queries the response was YES. [2022-12-13 11:43:52,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 1681 events. 939/1681 cut-off events. For 1909/2036 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9808 event pairs, 32 based on Foata normal form. 100/1421 useless extension candidates. Maximal degree in co-relation 6050. Up to 810 conditions per place. [2022-12-13 11:43:52,961 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 107 selfloop transitions, 14 changer transitions 27/164 dead transitions. [2022-12-13 11:43:52,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 164 transitions, 1208 flow [2022-12-13 11:43:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:43:52,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 11:43:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions. [2022-12-13 11:43:52,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6483870967741936 [2022-12-13 11:43:52,963 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 276 flow. Second operand 10 states and 201 transitions. [2022-12-13 11:43:52,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 164 transitions, 1208 flow [2022-12-13 11:43:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 164 transitions, 990 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-12-13 11:43:52,980 INFO L231 Difference]: Finished difference. Result has 58 places, 62 transitions, 294 flow [2022-12-13 11:43:52,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=294, PETRI_PLACES=58, PETRI_TRANSITIONS=62} [2022-12-13 11:43:52,980 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2022-12-13 11:43:52,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:52,980 INFO L89 Accepts]: Start accepts. Operand has 58 places, 62 transitions, 294 flow [2022-12-13 11:43:52,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:52,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:52,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 62 transitions, 294 flow [2022-12-13 11:43:52,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 62 transitions, 294 flow [2022-12-13 11:43:53,006 INFO L130 PetriNetUnfolder]: 244/511 cut-off events. [2022-12-13 11:43:53,007 INFO L131 PetriNetUnfolder]: For 559/575 co-relation queries the response was YES. [2022-12-13 11:43:53,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 511 events. 244/511 cut-off events. For 559/575 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3027 event pairs, 2 based on Foata normal form. 2/212 useless extension candidates. Maximal degree in co-relation 1480. Up to 253 conditions per place. [2022-12-13 11:43:53,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 62 transitions, 294 flow [2022-12-13 11:43:53,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 852 [2022-12-13 11:43:53,021 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L804-->L811: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_175 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_176 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_167 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= v_~z$w_buff1_used~0_166 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_167)) (= v_~z$w_buff0_used~0_175 (ite .cse2 0 v_~z$w_buff0_used~0_176)) (= (ite .cse2 v_~z$w_buff0~0_92 (ite .cse1 v_~z$w_buff1~0_93 v_~z~0_113)) v_~z~0_112) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_166 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_21 256) 0)))) 0 v_~z$r_buff1_thd2~0_20) v_~z$r_buff1_thd2~0_19) (= v_~z$r_buff0_thd2~0_21 (ite .cse0 0 v_~z$r_buff0_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_176, ~z$w_buff0~0=v_~z$w_buff0~0_92, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_167, ~z$w_buff1~0=v_~z$w_buff1~0_93, ~z~0=v_~z~0_113, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_92, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_166, ~z$w_buff1~0=v_~z$w_buff1~0_93, ~z~0=v_~z~0_112, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] and [369] L762-->L778: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd1~0_58 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd1~0_67 256) 0))) (let ((.cse8 (not .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_164 256) 0)) (.cse2 (and .cse6 (= (mod v_~z$w_buff1_used~0_155 256) 0))) (.cse3 (and .cse6 .cse10))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse1 (= (mod v_~z$w_buff0_used~0_163 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_154 256) 0)) (.cse4 (or .cse11 .cse2 .cse3)) (.cse5 (and (not .cse11) .cse8))) (and (= v_~weak$$choice0~0_12 |v_P0Thread1of1ForFork1_#t~nondet3#1_1|) (= (ite .cse0 v_~z$w_buff1_used~0_155 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_155 0)) v_~z$w_buff1_used~0_154) (= (ite .cse0 v_~z$w_buff0_used~0_164 (ite .cse4 v_~z$w_buff0_used~0_164 (ite .cse5 0 v_~z$w_buff0_used~0_164))) v_~z$w_buff0_used~0_163) (= v_~z$mem_tmp~0_30 v_~z~0_105) (= v_~weak$$choice2~0_58 |v_P0Thread1of1ForFork1_#t~nondet4#1_1|) (= (ite .cse0 v_~z$r_buff0_thd1~0_67 (ite (or (and .cse6 .cse7) .cse1 .cse3) v_~z$r_buff0_thd1~0_67 (ite (and (not .cse1) .cse8) 0 v_~z$r_buff0_thd1~0_67))) v_~z$r_buff0_thd1~0_66) (= v_~z$w_buff1~0_88 v_~z$w_buff1~0_87) (= v_~z~0_104 (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p0_EAX~0_10)) (= v_~z$w_buff0~0_87 v_~z$w_buff0~0_86) (= v_~z$flush_delayed~0_36 0) (= (ite .cse0 v_~z$r_buff1_thd1~0_58 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd1~0_66 256) 0))) (or .cse1 (and .cse9 .cse7) (and .cse9 .cse10))) v_~z$r_buff1_thd1~0_58 0)) v_~z$r_buff1_thd1~0_57) (= (ite .cse4 v_~z~0_105 (ite .cse5 v_~z$w_buff0~0_87 v_~z$w_buff1~0_88)) v_~__unbuffered_p0_EAX~0_10))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_164, ~z$w_buff0~0=v_~z$w_buff0~0_87, P0Thread1of1ForFork1_#t~nondet4#1=|v_P0Thread1of1ForFork1_#t~nondet4#1_1|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_155, P0Thread1of1ForFork1_#t~nondet3#1=|v_P0Thread1of1ForFork1_#t~nondet3#1_1|, ~z$w_buff1~0=v_~z$w_buff1~0_88, ~z~0=v_~z~0_105, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_67} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_87, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_57, ~z~0=v_~z~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_58, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork1_#t~nondet4#1, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3#1, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] [2022-12-13 11:43:54,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L762: Formula: (and (= v_~z$r_buff0_thd0~0_41 v_~z$r_buff1_thd0~0_35) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_96 1) (= v_~z$r_buff0_thd2~0_51 v_~z$r_buff1_thd2~0_47) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$w_buff0~0_132 1) (= v_~z$w_buff0~0_133 v_~z$w_buff1~0_125) (= v_~z$r_buff0_thd1~0_97 v_~z$r_buff1_thd1~0_79) (= v_~z$w_buff0_used~0_234 v_~z$w_buff1_used~0_222) (= v_~z$w_buff0_used~0_233 1) (= v_~z$r_buff0_thd3~0_97 v_~z$r_buff1_thd3~0_91) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_222 256) 0)) (not (= (mod v_~z$w_buff0_used~0_233 256) 0)))) 1 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_41, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_234, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_97, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_233, ~z$w_buff0~0=v_~z$w_buff0~0_132, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_91, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_222, ~z$w_buff1~0=v_~z$w_buff1~0_125, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_41, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_35, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [379] L804-->L811: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_175 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~z$w_buff0_used~0_176 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_167 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= v_~z$w_buff1_used~0_166 (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_167)) (= v_~z$w_buff0_used~0_175 (ite .cse2 0 v_~z$w_buff0_used~0_176)) (= (ite .cse2 v_~z$w_buff0~0_92 (ite .cse1 v_~z$w_buff1~0_93 v_~z~0_113)) v_~z~0_112) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_166 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd2~0_21 256) 0)))) 0 v_~z$r_buff1_thd2~0_20) v_~z$r_buff1_thd2~0_19) (= v_~z$r_buff0_thd2~0_21 (ite .cse0 0 v_~z$r_buff0_thd2~0_22))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_176, ~z$w_buff0~0=v_~z$w_buff0~0_92, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_167, ~z$w_buff1~0=v_~z$w_buff1~0_93, ~z~0=v_~z~0_113, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_92, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_166, ~z$w_buff1~0=v_~z$w_buff1~0_93, ~z~0=v_~z~0_112, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 11:43:54,644 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L762: Formula: (and (= v_~z$r_buff0_thd0~0_41 v_~z$r_buff1_thd0~0_35) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_96 1) (= v_~z$r_buff0_thd2~0_51 v_~z$r_buff1_thd2~0_47) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$w_buff0~0_132 1) (= v_~z$w_buff0~0_133 v_~z$w_buff1~0_125) (= v_~z$r_buff0_thd1~0_97 v_~z$r_buff1_thd1~0_79) (= v_~z$w_buff0_used~0_234 v_~z$w_buff1_used~0_222) (= v_~z$w_buff0_used~0_233 1) (= v_~z$r_buff0_thd3~0_97 v_~z$r_buff1_thd3~0_91) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_222 256) 0)) (not (= (mod v_~z$w_buff0_used~0_233 256) 0)))) 1 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_41, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_234, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_97, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_233, ~z$w_buff0~0=v_~z$w_buff0~0_132, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_91, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_222, ~z$w_buff1~0=v_~z$w_buff1~0_125, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_41, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_35, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [529] L804-->L778: Formula: (let ((.cse21 (not (= (mod v_~z$r_buff0_thd2~0_143 256) 0)))) (let ((.cse19 (and .cse21 (not (= 0 (mod v_~z$w_buff0_used~0_615 256)))))) (let ((.cse17 (ite .cse19 0 v_~z$w_buff0_used~0_615))) (let ((.cse18 (= (mod .cse17 256) 0))) (let ((.cse4 (not (= (mod v_~z$r_buff1_thd2~0_135 256) 0))) (.cse5 (not .cse18))) (let ((.cse11 (and .cse21 .cse5)) (.cse20 (and (not (= (mod v_~z$w_buff1_used~0_579 256) 0)) .cse4))) (let ((.cse12 (ite (or .cse11 .cse20) 0 v_~z$w_buff1_used~0_579))) (let ((.cse3 (= (mod .cse12 256) 0)) (.cse9 (= (mod v_~z$r_buff1_thd1~0_281 256) 0)) (.cse15 (= (mod v_~z$r_buff0_thd1~0_347 256) 0))) (let ((.cse16 (not .cse15)) (.cse13 (and .cse15 .cse9)) (.cse14 (and .cse15 .cse3))) (let ((.cse0 (ite .cse19 v_~z$w_buff0~0_417 (ite .cse20 v_~z$w_buff1~0_390 v_~z~0_499))) (.cse10 (= (mod v_~z$w_buff1_used~0_577 256) 0)) (.cse7 (= (mod v_~z$w_buff0_used~0_613 256) 0)) (.cse6 (not (= (mod v_~weak$$choice2~0_170 256) 0))) (.cse1 (or .cse18 .cse13 .cse14)) (.cse2 (and .cse16 .cse5))) (and (= v_~z$flush_delayed~0_154 0) (= v_~z$mem_tmp~0_150 .cse0) (= (ite .cse1 .cse0 (ite .cse2 v_~z$w_buff0~0_417 v_~z$w_buff1~0_390)) v_~__unbuffered_p0_EAX~0_209) (= (ite (or (and (not .cse3) .cse4) (and (not (= (mod v_~z$r_buff0_thd2~0_142 256) 0)) .cse5)) 0 v_~z$r_buff1_thd2~0_135) v_~z$r_buff1_thd2~0_134) (= (ite .cse6 v_~z$r_buff1_thd1~0_281 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd1~0_346 256) 0))) (or .cse7 (and .cse8 .cse9) (and .cse10 .cse8))) v_~z$r_buff1_thd1~0_281 0)) v_~z$r_buff1_thd1~0_280) (= v_~z$w_buff0~0_417 v_~z$w_buff0~0_416) (= v_~weak$$choice0~0_126 |v_P0Thread1of1ForFork1_#t~nondet3#1_134|) (= (ite .cse6 v_~z$mem_tmp~0_150 v_~__unbuffered_p0_EAX~0_209) v_~z~0_497) (= (ite .cse11 0 v_~z$r_buff0_thd2~0_143) v_~z$r_buff0_thd2~0_142) (= |v_P0Thread1of1ForFork1_#t~nondet4#1_134| v_~weak$$choice2~0_170) (= v_~z$w_buff1~0_389 v_~z$w_buff1~0_390) (= v_~z$w_buff1_used~0_577 (ite .cse6 .cse12 (ite (or .cse7 .cse13 .cse14) .cse12 0))) (= (ite .cse6 v_~z$r_buff0_thd1~0_347 (ite (or .cse7 (and .cse15 .cse10) .cse13) v_~z$r_buff0_thd1~0_347 (ite (and .cse16 (not .cse7)) 0 v_~z$r_buff0_thd1~0_347))) v_~z$r_buff0_thd1~0_346) (= v_~z$w_buff0_used~0_613 (ite .cse6 .cse17 (ite .cse1 .cse17 (ite .cse2 0 .cse17))))))))))))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_615, ~z$w_buff0~0=v_~z$w_buff0~0_417, P0Thread1of1ForFork1_#t~nondet4#1=|v_P0Thread1of1ForFork1_#t~nondet4#1_134|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_281, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_135, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_579, P0Thread1of1ForFork1_#t~nondet3#1=|v_P0Thread1of1ForFork1_#t~nondet3#1_134|, ~z$w_buff1~0=v_~z$w_buff1~0_390, ~z~0=v_~z~0_499, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_347, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_143} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_150, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_613, ~z$w_buff0~0=v_~z$w_buff0~0_416, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_577, ~z$w_buff1~0=v_~z$w_buff1~0_389, ~z$flush_delayed~0=v_~z$flush_delayed~0_154, ~weak$$choice0~0=v_~weak$$choice0~0_126, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_209, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_280, ~z~0=v_~z~0_497, ~weak$$choice2~0=v_~weak$$choice2~0_170, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_346, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_142} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork1_#t~nondet4#1, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3#1, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~z$r_buff0_thd2~0] [2022-12-13 11:43:54,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L762: Formula: (and (= v_~z$r_buff0_thd0~0_41 v_~z$r_buff1_thd0~0_35) (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~z$r_buff0_thd1~0_96 1) (= v_~z$r_buff0_thd2~0_51 v_~z$r_buff1_thd2~0_47) (= |v_P0Thread1of1ForFork1_~arg#1.offset_7| |v_P0Thread1of1ForFork1_#in~arg#1.offset_7|) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork1_#in~arg#1.base_7| |v_P0Thread1of1ForFork1_~arg#1.base_7|) (= v_~z$w_buff0~0_132 1) (= v_~z$w_buff0~0_133 v_~z$w_buff1~0_125) (= v_~z$r_buff0_thd1~0_97 v_~z$r_buff1_thd1~0_79) (= v_~z$w_buff0_used~0_234 v_~z$w_buff1_used~0_222) (= v_~z$w_buff0_used~0_233 1) (= v_~z$r_buff0_thd3~0_97 v_~z$r_buff1_thd3~0_91) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_222 256) 0)) (not (= (mod v_~z$w_buff0_used~0_233 256) 0)))) 1 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_41, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_234, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_97, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} OutVars{P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_233, ~z$w_buff0~0=v_~z$w_buff0~0_132, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_91, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_222, ~z$w_buff1~0=v_~z$w_buff1~0_125, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_7|, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_7|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_41, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_35, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_97, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_51} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z$r_buff0_thd1~0] and [386] L824-->L840: Formula: (let ((.cse3 (= (mod v_~z$r_buff1_thd3~0_52 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_60 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 .cse3)) (.cse6 (and .cse7 (= (mod v_~z$w_buff1_used~0_147 256) 0))) (.cse12 (= (mod v_~z$w_buff0_used~0_156 256) 0))) (let ((.cse10 (or .cse5 .cse6 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~z$w_buff1_used~0_146 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_155 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_54 256) 0))) (.cse9 (ite .cse10 v_~z~0_94 (ite .cse11 v_~z$w_buff0~0_79 v_~z$w_buff1~0_80)))) (and (= v_~z$flush_delayed~0_28 0) (= v_~z$w_buff1~0_80 v_~z$w_buff1~0_79) (= |v_P2Thread1of1ForFork0_#t~nondet5_1| v_~weak$$choice0~0_10) (= (ite .cse0 v_~z$r_buff1_thd3~0_52 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~z$r_buff1_thd3~0_52 0)) v_~z$r_buff1_thd3~0_51) (= v_~z$mem_tmp~0_26 v_~z~0_94) (= v_~z$w_buff1_used~0_146 (ite .cse0 v_~z$w_buff1_used~0_147 (ite (or .cse5 .cse6 .cse4) v_~z$w_buff1_used~0_147 0))) (= v_~z$r_buff0_thd3~0_59 (ite .cse0 v_~z$r_buff0_thd3~0_60 (ite (or .cse5 .cse4 (and .cse7 .cse1)) v_~z$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse8) 0 v_~z$r_buff0_thd3~0_60)))) (= |v_P2Thread1of1ForFork0_#t~nondet6_1| v_~weak$$choice2~0_54) (= v_~__unbuffered_p2_EBX~0_14 .cse9) (= v_~z$w_buff0_used~0_155 (ite .cse0 v_~z$w_buff0_used~0_156 (ite .cse10 v_~z$w_buff0_used~0_156 (ite .cse11 0 v_~z$w_buff0_used~0_156)))) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_26 .cse9)) (= v_~z$w_buff0~0_79 v_~z$w_buff0~0_78)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_80, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_1|, ~z~0=v_~z~0_94, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_78, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_79, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_54} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet6, ~z$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0] [2022-12-13 11:43:55,199 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:43:55,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2220 [2022-12-13 11:43:55,200 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 305 flow [2022-12-13 11:43:55,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 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 11:43:55,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:55,200 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 11:43:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:43:55,200 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1737235743, now seen corresponding path program 1 times [2022-12-13 11:43:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238461547] [2022-12-13 11:43:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:55,339 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 11:43:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:55,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238461547] [2022-12-13 11:43:55,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238461547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:55,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:55,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:43:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014882577] [2022-12-13 11:43:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:55,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:43:55,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:55,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:43:55,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:43:55,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:43:55,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 11:43:55,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:55,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:43:55,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:55,589 INFO L130 PetriNetUnfolder]: 1518/2660 cut-off events. [2022-12-13 11:43:55,589 INFO L131 PetriNetUnfolder]: For 3800/3969 co-relation queries the response was YES. [2022-12-13 11:43:55,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8835 conditions, 2660 events. 1518/2660 cut-off events. For 3800/3969 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16408 event pairs, 134 based on Foata normal form. 186/2281 useless extension candidates. Maximal degree in co-relation 8816. Up to 1357 conditions per place. [2022-12-13 11:43:55,600 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 82 selfloop transitions, 10 changer transitions 14/120 dead transitions. [2022-12-13 11:43:55,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 120 transitions, 790 flow [2022-12-13 11:43:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:43:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:43:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 11:43:55,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 11:43:55,601 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 305 flow. Second operand 5 states and 105 transitions. [2022-12-13 11:43:55,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 120 transitions, 790 flow [2022-12-13 11:43:55,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 120 transitions, 788 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:55,637 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 356 flow [2022-12-13 11:43:55,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2022-12-13 11:43:55,638 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -15 predicate places. [2022-12-13 11:43:55,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:55,638 INFO L89 Accepts]: Start accepts. Operand has 63 places, 65 transitions, 356 flow [2022-12-13 11:43:55,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:55,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:55,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 65 transitions, 356 flow [2022-12-13 11:43:55,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 65 transitions, 356 flow [2022-12-13 11:43:55,701 INFO L130 PetriNetUnfolder]: 508/1081 cut-off events. [2022-12-13 11:43:55,701 INFO L131 PetriNetUnfolder]: For 1174/1284 co-relation queries the response was YES. [2022-12-13 11:43:55,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 1081 events. 508/1081 cut-off events. For 1174/1284 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 7583 event pairs, 6 based on Foata normal form. 12/448 useless extension candidates. Maximal degree in co-relation 3060. Up to 505 conditions per place. [2022-12-13 11:43:55,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 65 transitions, 356 flow [2022-12-13 11:43:55,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 11:43:56,032 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [533] $Ultimate##0-->L840: Formula: (let ((.cse5 (= (mod v_~z$r_buff0_thd3~0_243 256) 0)) (.cse9 (= (mod v_~z$w_buff0_used~0_639 256) 0))) (let ((.cse4 (and .cse5 .cse9))) (let ((.cse1 (or .cse4 .cse5)) (.cse2 (not .cse5))) (let ((.cse3 (ite .cse1 v_~z~0_516 (ite .cse2 v_~z$w_buff0~0_436 v_~z$w_buff1~0_403))) (.cse0 (not (= (mod v_~weak$$choice2~0_176 256) 0))) (.cse7 (= (mod v_~z$w_buff1_used~0_595 256) 0)) (.cse6 (= (mod v_~z$w_buff0_used~0_637 256) 0))) (and (not (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_60| 0)) (= v_~z$r_buff0_thd0~0_170 v_~z$r_buff1_thd0~0_163) (= v_~z$w_buff0_used~0_637 (ite .cse0 1 (ite .cse1 1 (ite .cse2 0 1)))) (= (ite .cse0 v_~z$mem_tmp~0_156 .cse3) v_~z~0_515) (= v_~z$r_buff0_thd1~0_367 v_~z$r_buff1_thd1~0_294) (= v_~z$r_buff0_thd1~0_366 1) (= v_~z$w_buff0~0_438 v_~z$w_buff1~0_403) (= |v_P0Thread1of1ForFork1_~arg#1.base_58| |v_P0Thread1of1ForFork1_#in~arg#1.base_58|) (= v_~z$w_buff1_used~0_595 (ite .cse0 v_~z$w_buff0_used~0_639 (ite (or .cse4 .cse5 .cse6) v_~z$w_buff0_used~0_639 0))) (= v_~__unbuffered_p2_EBX~0_196 .cse3) (= v_~z$flush_delayed~0_160 0) (= v_~weak$$choice2~0_176 |v_P2Thread1of1ForFork0_#t~nondet6_74|) (= |v_P0Thread1of1ForFork1_~arg#1.offset_58| |v_P0Thread1of1ForFork1_#in~arg#1.offset_58|) (= (ite .cse0 v_~z$r_buff0_thd3~0_243 (ite (or .cse5 (and .cse7 .cse5) .cse6) v_~z$r_buff0_thd3~0_243 (ite (and .cse2 (not .cse6)) 0 v_~z$r_buff0_thd3~0_243))) v_~z$r_buff0_thd3~0_242) (= v_~z$w_buff0~0_436 1) (= v_~z~0_516 v_~z$mem_tmp~0_156) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_60| |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|) (= v_~weak$$choice0~0_132 |v_P2Thread1of1ForFork0_#t~nondet5_74|) (= (ite .cse0 v_~z$r_buff0_thd3~0_243 (ite (let ((.cse8 (= (mod v_~z$r_buff0_thd3~0_242 256) 0))) (or (and .cse8 .cse5) (and .cse7 .cse8) .cse6)) v_~z$r_buff0_thd3~0_243 0)) v_~z$r_buff1_thd3~0_238) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60| (ite .cse9 1 0)) (= v_~z$r_buff0_thd2~0_156 v_~z$r_buff1_thd2~0_148)))))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_58|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_639, ~z$w_buff0~0=v_~z$w_buff0~0_438, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_243, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_74|, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_58|, ~z~0=v_~z~0_516, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_74|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_367, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_156} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_148, ~z$w_buff1~0=v_~z$w_buff1~0_403, P0Thread1of1ForFork1_#in~arg#1.offset=|v_P0Thread1of1ForFork1_#in~arg#1.offset_58|, P0Thread1of1ForFork1_~arg#1.offset=|v_P0Thread1of1ForFork1_~arg#1.offset_58|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_60|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_163, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork1___VERIFIER_assert_~expression#1_60|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_156, ~z$mem_tmp~0=v_~z$mem_tmp~0_156, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_196, P0Thread1of1ForFork1_#in~arg#1.base=|v_P0Thread1of1ForFork1_#in~arg#1.base_58|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_637, ~z$w_buff0~0=v_~z$w_buff0~0_436, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_238, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_595, ~z$flush_delayed~0=v_~z$flush_delayed~0_160, P0Thread1of1ForFork1_~arg#1.base=|v_P0Thread1of1ForFork1_~arg#1.base_58|, ~weak$$choice0~0=v_~weak$$choice0~0_132, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_294, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_242, ~z~0=v_~z~0_515, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_366} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet6, ~z$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet5, P0Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork1_~arg#1.base, ~weak$$choice0~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~z~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~weak$$choice2~0, ~z$r_buff0_thd1~0] and [369] L762-->L778: Formula: (let ((.cse10 (= (mod v_~z$r_buff1_thd1~0_58 256) 0)) (.cse6 (= (mod v_~z$r_buff0_thd1~0_67 256) 0))) (let ((.cse8 (not .cse6)) (.cse11 (= (mod v_~z$w_buff0_used~0_164 256) 0)) (.cse2 (and .cse6 (= (mod v_~z$w_buff1_used~0_155 256) 0))) (.cse3 (and .cse6 .cse10))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_58 256) 0))) (.cse1 (= (mod v_~z$w_buff0_used~0_163 256) 0)) (.cse7 (= (mod v_~z$w_buff1_used~0_154 256) 0)) (.cse4 (or .cse11 .cse2 .cse3)) (.cse5 (and (not .cse11) .cse8))) (and (= v_~weak$$choice0~0_12 |v_P0Thread1of1ForFork1_#t~nondet3#1_1|) (= (ite .cse0 v_~z$w_buff1_used~0_155 (ite (or .cse1 .cse2 .cse3) v_~z$w_buff1_used~0_155 0)) v_~z$w_buff1_used~0_154) (= (ite .cse0 v_~z$w_buff0_used~0_164 (ite .cse4 v_~z$w_buff0_used~0_164 (ite .cse5 0 v_~z$w_buff0_used~0_164))) v_~z$w_buff0_used~0_163) (= v_~z$mem_tmp~0_30 v_~z~0_105) (= v_~weak$$choice2~0_58 |v_P0Thread1of1ForFork1_#t~nondet4#1_1|) (= (ite .cse0 v_~z$r_buff0_thd1~0_67 (ite (or (and .cse6 .cse7) .cse1 .cse3) v_~z$r_buff0_thd1~0_67 (ite (and (not .cse1) .cse8) 0 v_~z$r_buff0_thd1~0_67))) v_~z$r_buff0_thd1~0_66) (= v_~z$w_buff1~0_88 v_~z$w_buff1~0_87) (= v_~z~0_104 (ite .cse0 v_~z$mem_tmp~0_30 v_~__unbuffered_p0_EAX~0_10)) (= v_~z$w_buff0~0_87 v_~z$w_buff0~0_86) (= v_~z$flush_delayed~0_36 0) (= (ite .cse0 v_~z$r_buff1_thd1~0_58 (ite (let ((.cse9 (= (mod v_~z$r_buff0_thd1~0_66 256) 0))) (or .cse1 (and .cse9 .cse7) (and .cse9 .cse10))) v_~z$r_buff1_thd1~0_58 0)) v_~z$r_buff1_thd1~0_57) (= (ite .cse4 v_~z~0_105 (ite .cse5 v_~z$w_buff0~0_87 v_~z$w_buff1~0_88)) v_~__unbuffered_p0_EAX~0_10))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_164, ~z$w_buff0~0=v_~z$w_buff0~0_87, P0Thread1of1ForFork1_#t~nondet4#1=|v_P0Thread1of1ForFork1_#t~nondet4#1_1|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_58, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_155, P0Thread1of1ForFork1_#t~nondet3#1=|v_P0Thread1of1ForFork1_#t~nondet3#1_1|, ~z$w_buff1~0=v_~z$w_buff1~0_88, ~z~0=v_~z~0_105, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_67} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_30, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_163, ~z$w_buff0~0=v_~z$w_buff0~0_86, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_87, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_57, ~z~0=v_~z~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_58, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_66} AuxVars[] AssignedVars[~z$mem_tmp~0, ~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork1_#t~nondet4#1, ~z$w_buff1_used~0, ~z$w_buff1~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3#1, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] [2022-12-13 11:43:56,416 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] L824-->L840: Formula: (let ((.cse3 (= (mod v_~z$r_buff1_thd3~0_52 256) 0)) (.cse7 (= (mod v_~z$r_buff0_thd3~0_60 256) 0))) (let ((.cse8 (not .cse7)) (.cse5 (and .cse7 .cse3)) (.cse6 (and .cse7 (= (mod v_~z$w_buff1_used~0_147 256) 0))) (.cse12 (= (mod v_~z$w_buff0_used~0_156 256) 0))) (let ((.cse10 (or .cse5 .cse6 .cse12)) (.cse11 (and .cse8 (not .cse12)))) (let ((.cse1 (= (mod v_~z$w_buff1_used~0_146 256) 0)) (.cse4 (= (mod v_~z$w_buff0_used~0_155 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_54 256) 0))) (.cse9 (ite .cse10 v_~z~0_94 (ite .cse11 v_~z$w_buff0~0_79 v_~z$w_buff1~0_80)))) (and (= v_~z$flush_delayed~0_28 0) (= v_~z$w_buff1~0_80 v_~z$w_buff1~0_79) (= |v_P2Thread1of1ForFork0_#t~nondet5_1| v_~weak$$choice0~0_10) (= (ite .cse0 v_~z$r_buff1_thd3~0_52 (ite (let ((.cse2 (= (mod v_~z$r_buff0_thd3~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~z$r_buff1_thd3~0_52 0)) v_~z$r_buff1_thd3~0_51) (= v_~z$mem_tmp~0_26 v_~z~0_94) (= v_~z$w_buff1_used~0_146 (ite .cse0 v_~z$w_buff1_used~0_147 (ite (or .cse5 .cse6 .cse4) v_~z$w_buff1_used~0_147 0))) (= v_~z$r_buff0_thd3~0_59 (ite .cse0 v_~z$r_buff0_thd3~0_60 (ite (or .cse5 .cse4 (and .cse7 .cse1)) v_~z$r_buff0_thd3~0_60 (ite (and (not .cse4) .cse8) 0 v_~z$r_buff0_thd3~0_60)))) (= |v_P2Thread1of1ForFork0_#t~nondet6_1| v_~weak$$choice2~0_54) (= v_~__unbuffered_p2_EBX~0_14 .cse9) (= v_~z$w_buff0_used~0_155 (ite .cse0 v_~z$w_buff0_used~0_156 (ite .cse10 v_~z$w_buff0_used~0_156 (ite .cse11 0 v_~z$w_buff0_used~0_156)))) (= v_~z~0_92 (ite .cse0 v_~z$mem_tmp~0_26 .cse9)) (= v_~z$w_buff0~0_79 v_~z$w_buff0~0_78)))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_156, ~z$w_buff0~0=v_~z$w_buff0~0_79, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_52, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_147, ~z$w_buff1~0=v_~z$w_buff1~0_80, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~nondet6=|v_P2Thread1of1ForFork0_#t~nondet6_1|, ~z~0=v_~z~0_94, P2Thread1of1ForFork0_#t~nondet5=|v_P2Thread1of1ForFork0_#t~nondet5_1|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_155, ~z$w_buff0~0=v_~z$w_buff0~0_78, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_51, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_146, ~z$w_buff1~0=v_~z$w_buff1~0_79, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_10, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z~0=v_~z~0_92, ~weak$$choice2~0=v_~weak$$choice2~0_54} AuxVars[] AssignedVars[~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0_#t~nondet6, ~z$flush_delayed~0, P2Thread1of1ForFork0_#t~nondet5, ~weak$$choice0~0, ~z$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0] and [370] L778-->L781: Formula: (= v_~__unbuffered_p0_EBX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EBX~0] [2022-12-13 11:43:56,552 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:43:56,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 915 [2022-12-13 11:43:56,553 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 356 flow [2022-12-13 11:43:56,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 11:43:56,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:56,553 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 11:43:56,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:43:56,553 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:56,553 INFO L85 PathProgramCache]: Analyzing trace with hash 602746245, now seen corresponding path program 2 times [2022-12-13 11:43:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:56,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102512975] [2022-12-13 11:43:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:43:56,707 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 11:43:56,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:43:56,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102512975] [2022-12-13 11:43:56,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102512975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:43:56,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:43:56,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:43:56,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133859954] [2022-12-13 11:43:56,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:43:56,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:43:56,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:43:56,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:43:56,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:43:56,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2022-12-13 11:43:56,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:56,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:43:56,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2022-12-13 11:43:56,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:43:56,991 INFO L130 PetriNetUnfolder]: 1943/3489 cut-off events. [2022-12-13 11:43:56,991 INFO L131 PetriNetUnfolder]: For 5559/5724 co-relation queries the response was YES. [2022-12-13 11:43:56,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12205 conditions, 3489 events. 1943/3489 cut-off events. For 5559/5724 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 23943 event pairs, 397 based on Foata normal form. 184/2836 useless extension candidates. Maximal degree in co-relation 12182. Up to 1238 conditions per place. [2022-12-13 11:43:57,005 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 54 selfloop transitions, 2 changer transitions 39/111 dead transitions. [2022-12-13 11:43:57,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 819 flow [2022-12-13 11:43:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:43:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:43:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 11:43:57,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 11:43:57,006 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 356 flow. Second operand 4 states and 85 transitions. [2022-12-13 11:43:57,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 819 flow [2022-12-13 11:43:57,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 803 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 11:43:57,069 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 329 flow [2022-12-13 11:43:57,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-12-13 11:43:57,070 INFO L295 CegarLoopForPetriNet]: 78 programPoint places, -15 predicate places. [2022-12-13 11:43:57,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:43:57,070 INFO L89 Accepts]: Start accepts. Operand has 63 places, 59 transitions, 329 flow [2022-12-13 11:43:57,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:43:57,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:43:57,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 59 transitions, 329 flow [2022-12-13 11:43:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 59 transitions, 329 flow [2022-12-13 11:43:57,112 INFO L130 PetriNetUnfolder]: 457/965 cut-off events. [2022-12-13 11:43:57,112 INFO L131 PetriNetUnfolder]: For 1726/1805 co-relation queries the response was YES. [2022-12-13 11:43:57,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 965 events. 457/965 cut-off events. For 1726/1805 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 6499 event pairs, 1 based on Foata normal form. 18/403 useless extension candidates. Maximal degree in co-relation 2788. Up to 451 conditions per place. [2022-12-13 11:43:57,118 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 59 transitions, 329 flow [2022-12-13 11:43:57,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-13 11:43:57,139 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:43:57,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 11:43:57,140 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 329 flow [2022-12-13 11:43:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:43:57,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:43:57,140 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 11:43:57,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:43:57,140 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:43:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:43:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1755513883, now seen corresponding path program 3 times [2022-12-13 11:43:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:43:57,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481902152] [2022-12-13 11:43:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:43:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:43:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:43:57,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:43:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:43:57,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:43:57,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:43:57,251 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:43:57,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:43:57,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:43:57,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:43:57,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:43:57,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:43:57,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:43:57,253 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:43:57,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:43:57,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:43:57,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:43:57 BasicIcfg [2022-12-13 11:43:57,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:43:57,330 INFO L158 Benchmark]: Toolchain (without parser) took 16382.22ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 961.5MB). Free memory was 192.9MB in the beginning and 455.9MB in the end (delta: -263.1MB). Peak memory consumption was 699.8MB. Max. memory is 8.0GB. [2022-12-13 11:43:57,330 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 218.1MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:43:57,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.95ms. Allocated memory is still 218.1MB. Free memory was 192.9MB in the beginning and 164.3MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 11:43:57,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.49ms. Allocated memory is still 218.1MB. Free memory was 164.3MB in the beginning and 161.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:43:57,330 INFO L158 Benchmark]: Boogie Preprocessor took 20.37ms. Allocated memory is still 218.1MB. Free memory was 161.7MB in the beginning and 159.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:43:57,331 INFO L158 Benchmark]: RCFGBuilder took 624.64ms. Allocated memory is still 218.1MB. Free memory was 159.6MB in the beginning and 118.2MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-13 11:43:57,331 INFO L158 Benchmark]: TraceAbstraction took 15291.73ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 961.5MB). Free memory was 117.1MB in the beginning and 455.9MB in the end (delta: -338.8MB). Peak memory consumption was 624.3MB. Max. memory is 8.0GB. [2022-12-13 11:43:57,332 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 218.1MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 408.95ms. Allocated memory is still 218.1MB. Free memory was 192.9MB in the beginning and 164.3MB in the end (delta: 28.6MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.49ms. Allocated memory is still 218.1MB. Free memory was 164.3MB in the beginning and 161.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.37ms. Allocated memory is still 218.1MB. Free memory was 161.7MB in the beginning and 159.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 624.64ms. Allocated memory is still 218.1MB. Free memory was 159.6MB in the beginning and 118.2MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 15291.73ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 961.5MB). Free memory was 117.1MB in the beginning and 455.9MB in the end (delta: -338.8MB). Peak memory consumption was 624.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 120 PlacesBefore, 78 PlacesAfterwards, 112 TransitionsBefore, 68 TransitionsAfterwards, 2230 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4074, independent: 3869, independent conditional: 3869, independent unconditional: 0, dependent: 205, dependent conditional: 205, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4074, independent: 3869, independent conditional: 0, independent unconditional: 3869, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4074, independent: 3869, independent conditional: 0, independent unconditional: 3869, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4074, independent: 3869, independent conditional: 0, independent unconditional: 3869, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2128, independent: 2059, independent conditional: 0, independent unconditional: 2059, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2128, independent: 2038, independent conditional: 0, independent unconditional: 2038, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 285, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4074, independent: 1810, independent conditional: 0, independent unconditional: 1810, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 2128, unknown conditional: 0, unknown unconditional: 2128] , Statistics on independence cache: Total cache size (in pairs): 4013, Positive cache size: 3944, Positive conditional cache size: 0, Positive unconditional cache size: 3944, Negative cache size: 69, Negative conditional cache size: 0, Negative unconditional cache size: 69, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 45 PlacesBefore, 45 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 752 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 459, independent: 417, independent conditional: 417, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 459, independent: 417, independent conditional: 32, independent unconditional: 385, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 459, independent: 417, independent conditional: 32, independent unconditional: 385, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 459, independent: 417, independent conditional: 32, independent unconditional: 385, dependent: 42, dependent conditional: 7, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 364, independent: 332, independent conditional: 27, independent unconditional: 305, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 364, independent: 311, independent conditional: 0, independent unconditional: 311, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 133, dependent conditional: 27, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 459, independent: 85, independent conditional: 5, independent unconditional: 80, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 364, unknown conditional: 32, unknown unconditional: 332] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 332, Positive conditional cache size: 27, Positive unconditional cache size: 305, Negative cache size: 32, Negative conditional cache size: 5, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 698 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 382, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 382, independent: 344, independent conditional: 31, independent unconditional: 313, dependent: 38, dependent conditional: 1, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 382, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 382, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 382, independent: 308, independent conditional: 0, independent unconditional: 308, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 368, Positive conditional cache size: 27, Positive unconditional cache size: 341, Negative cache size: 44, Negative conditional cache size: 5, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 623, independent: 552, independent conditional: 552, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 623, independent: 552, independent conditional: 38, independent unconditional: 514, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 623, independent: 552, independent conditional: 0, independent unconditional: 552, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 623, independent: 552, independent conditional: 0, independent unconditional: 552, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 48, independent: 42, independent conditional: 0, independent unconditional: 42, 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: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 623, independent: 510, independent conditional: 0, independent unconditional: 510, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 431, Positive conditional cache size: 29, Positive unconditional cache size: 402, Negative cache size: 50, Negative conditional cache size: 5, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 516, independent: 451, independent conditional: 451, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 516, independent: 451, independent conditional: 29, independent unconditional: 422, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 516, independent: 451, independent conditional: 0, independent unconditional: 451, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 516, independent: 451, independent conditional: 0, independent unconditional: 451, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 516, independent: 439, independent conditional: 0, independent unconditional: 439, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 468, Positive conditional cache size: 31, Positive unconditional cache size: 437, Negative cache size: 55, Negative conditional cache size: 5, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, independent: 141, independent conditional: 0, independent unconditional: 141, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 468, Positive conditional cache size: 31, Positive unconditional cache size: 437, Negative cache size: 57, Negative conditional cache size: 5, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 185, independent conditional: 185, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 224, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 525, Positive cache size: 468, Positive conditional cache size: 31, Positive unconditional cache size: 437, Negative cache size: 57, Negative conditional cache size: 5, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 49 PlacesBefore, 47 PlacesAfterwards, 51 TransitionsBefore, 49 TransitionsAfterwards, 662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 594, independent: 512, independent conditional: 512, independent unconditional: 0, dependent: 82, dependent conditional: 82, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 594, independent: 512, independent conditional: 104, independent unconditional: 408, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 594, independent: 512, independent conditional: 104, independent unconditional: 408, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 594, independent: 512, independent conditional: 104, independent unconditional: 408, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 15, independent conditional: 15, independent unconditional: 0, 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: 16, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 594, independent: 497, independent conditional: 89, independent unconditional: 408, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 16, unknown conditional: 15, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 494, Positive conditional cache size: 46, Positive unconditional cache size: 448, Negative cache size: 58, Negative conditional cache size: 5, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 57 PlacesBefore, 57 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 852 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 350, independent conditional: 350, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 405, independent: 350, independent conditional: 158, independent unconditional: 192, dependent: 55, dependent conditional: 20, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 405, independent: 350, independent conditional: 147, independent unconditional: 203, dependent: 55, dependent conditional: 20, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 405, independent: 350, independent conditional: 147, independent unconditional: 203, dependent: 55, dependent conditional: 20, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 405, independent: 344, independent conditional: 141, independent unconditional: 203, dependent: 53, dependent conditional: 18, dependent unconditional: 35, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 558, Positive conditional cache size: 52, Positive unconditional cache size: 506, Negative cache size: 60, Negative conditional cache size: 7, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 61 PlacesBefore, 59 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 91, independent conditional: 73, independent unconditional: 18, dependent: 25, dependent conditional: 22, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 91, independent conditional: 70, independent unconditional: 21, dependent: 25, dependent conditional: 22, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 91, independent conditional: 70, independent unconditional: 21, dependent: 25, dependent conditional: 22, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 8, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 32, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 81, independent conditional: 62, independent unconditional: 19, dependent: 23, dependent conditional: 20, dependent unconditional: 3, unknown: 12, unknown conditional: 10, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 608, Positive conditional cache size: 60, Positive unconditional cache size: 548, Negative cache size: 62, Negative conditional cache size: 9, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 724 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 608, Positive conditional cache size: 60, Positive unconditional cache size: 548, Negative cache size: 64, Negative conditional cache size: 9, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: 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_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t14; [L865] FCALL, FORK 0 pthread_create(&t14, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t14, ((void *)0), P0, ((void *)0))=-1, t14={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L19] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t15; [L867] FCALL, FORK 0 pthread_create(&t15, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t15, ((void *)0), P1, ((void *)0))=0, t14={5:0}, t15={6:0}, weak$$choice0=2, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t16; [L797] 2 x = 1 [L800] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L869] FCALL, FORK 0 pthread_create(&t16, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t16, ((void *)0), P2, ((void *)0))=1, t14={5:0}, t15={6:0}, t16={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 3 y = 1 [L823] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 865]: 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: 867]: 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: 869]: 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 7 procedures, 145 locations, 6 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: 15.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 280 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 280 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 938 IncrementalHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 9 mSDtfsCounter, 938 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=9, 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.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 1024 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 11:43:57,360 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...