/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/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:28:05,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:28:05,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:28:05,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:28:05,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:28:05,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:28:05,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:28:05,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:28:05,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:28:05,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:28:05,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:28:05,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:28:05,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:28:05,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:28:05,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:28:05,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:28:05,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:28:05,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:28:05,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:28:05,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:28:05,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:28:05,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:28:05,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:28:05,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:28:05,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:28:05,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:28:05,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:28:05,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:28:05,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:28:05,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:28:05,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:28:05,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:28:05,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:28:05,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:28:05,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:28:05,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:28:05,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:28:05,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:28:05,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:28:05,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:28:05,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:28:05,274 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-06 06:28:05,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:28:05,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:28:05,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:28:05,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:28:05,305 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:28:05,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:28:05,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:28:05,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:28:05,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:28:05,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:28:05,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:28:05,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:28:05,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:28:05,307 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:28:05,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:28:05,307 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:28:05,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:28:05,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:28:05,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:28:05,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:28:05,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:28:05,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:28:05,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:28:05,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:28:05,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:28:05,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:28:05,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:28:05,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:28:05,309 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-06 06:28:05,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:28:05,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:28:05,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:28:05,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:28:05,667 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:28:05,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2022-12-06 06:28:06,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:28:07,034 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:28:07,035 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2022-12-06 06:28:07,050 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036584c1d/5bfcc31a9f3c4c11ad88fd9c24ee107f/FLAGdc98b4909 [2022-12-06 06:28:07,062 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/036584c1d/5bfcc31a9f3c4c11ad88fd9c24ee107f [2022-12-06 06:28:07,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:28:07,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:28:07,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:28:07,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:28:07,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:28:07,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcfdedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07, skipping insertion in model container [2022-12-06 06:28:07,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:28:07,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:28:07,238 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/mix044_tso.oepc.i[949,962] [2022-12-06 06:28:07,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:28:07,501 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:28:07,511 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/mix044_tso.oepc.i[949,962] [2022-12-06 06:28:07,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:28:07,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:28:07,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:28:07,630 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:28:07,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07 WrapperNode [2022-12-06 06:28:07,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:28:07,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:28:07,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:28:07,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:28:07,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,696 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-06 06:28:07,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:28:07,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:28:07,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:28:07,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:28:07,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:28:07,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:28:07,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:28:07,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:28:07,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (1/1) ... [2022-12-06 06:28:07,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:28:07,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:28:07,801 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-06 06:28:07,828 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-06 06:28:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:28:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:28:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:28:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:28:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:28:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:28:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:28:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:28:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:28:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:28:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:28:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:28:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:28:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:28:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:28:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:28:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:28:07,848 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:28:08,002 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:28:08,003 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:28:08,334 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:28:08,501 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:28:08,501 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:28:08,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:28:08 BoogieIcfgContainer [2022-12-06 06:28:08,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:28:08,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:28:08,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:28:08,511 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:28:08,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:28:07" (1/3) ... [2022-12-06 06:28:08,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3a134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:28:08, skipping insertion in model container [2022-12-06 06:28:08,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:28:07" (2/3) ... [2022-12-06 06:28:08,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3a134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:28:08, skipping insertion in model container [2022-12-06 06:28:08,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:28:08" (3/3) ... [2022-12-06 06:28:08,515 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-12-06 06:28:08,532 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:28:08,532 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:28:08,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:28:08,598 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:28:08,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 06:28:08,715 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 06:28:08,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:08,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:28:08,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 06:28:08,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-06 06:28:08,735 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:08,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 06:28:08,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-06 06:28:08,857 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 06:28:08,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:08,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 06:28:08,865 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 06:28:08,865 INFO L188 LiptonReduction]: Number of co-enabled transitions 3256 [2022-12-06 06:28:15,397 INFO L203 LiptonReduction]: Total number of compositions: 98 [2022-12-06 06:28:15,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:28:15,416 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;@db716ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:28:15,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:28:15,419 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-06 06:28:15,419 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:15,420 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:15,420 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:28:15,420 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash 529998227, now seen corresponding path program 1 times [2022-12-06 06:28:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:15,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287115232] [2022-12-06 06:28:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:15,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:15,873 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-06 06:28:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287115232] [2022-12-06 06:28:15,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287115232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:15,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:15,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:28:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672195978] [2022-12-06 06:28:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:15,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:15,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:15,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:15,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:15,900 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 06:28:15,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:28:15,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:15,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 06:28:15,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:17,072 INFO L130 PetriNetUnfolder]: 6047/8809 cut-off events. [2022-12-06 06:28:17,073 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 06:28:17,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17201 conditions, 8809 events. 6047/8809 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 52687 event pairs, 1112 based on Foata normal form. 0/8064 useless extension candidates. Maximal degree in co-relation 17189. Up to 6556 conditions per place. [2022-12-06 06:28:17,128 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 39 selfloop transitions, 2 changer transitions 8/53 dead transitions. [2022-12-06 06:28:17,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 222 flow [2022-12-06 06:28:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 06:28:17,138 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2022-12-06 06:28:17,140 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 66 transitions. [2022-12-06 06:28:17,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 222 flow [2022-12-06 06:28:17,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:28:17,146 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 68 flow [2022-12-06 06:28:17,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2022-12-06 06:28:17,152 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 06:28:17,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:17,153 INFO L89 Accepts]: Start accepts. Operand has 43 places, 28 transitions, 68 flow [2022-12-06 06:28:17,155 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:17,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:17,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 68 flow [2022-12-06 06:28:17,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:28:17,171 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:28:17,172 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:17,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:28:17,172 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:28:17,172 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:28:17,269 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:28:17,272 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 06:28:17,272 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 06:28:17,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-06 06:28:17,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:17,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:17,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:28:17,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:17,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2049311037, now seen corresponding path program 1 times [2022-12-06 06:28:17,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:17,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198870872] [2022-12-06 06:28:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:17,582 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-06 06:28:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:17,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198870872] [2022-12-06 06:28:17,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198870872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:17,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:17,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:28:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929206253] [2022-12-06 06:28:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:17,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:17,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:28:17,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 06:28:17,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:17,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:28:17,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:18,083 INFO L130 PetriNetUnfolder]: 2951/4291 cut-off events. [2022-12-06 06:28:18,084 INFO L131 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2022-12-06 06:28:18,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 4291 events. 2951/4291 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 22265 event pairs, 839 based on Foata normal form. 64/4337 useless extension candidates. Maximal degree in co-relation 8815. Up to 3009 conditions per place. [2022-12-06 06:28:18,112 INFO L137 encePairwiseOnDemand]: 24/27 looper letters, 32 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2022-12-06 06:28:18,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 158 flow [2022-12-06 06:28:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:28:18,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-06 06:28:18,113 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:28:18,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 158 flow [2022-12-06 06:28:18,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:28:18,115 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 70 flow [2022-12-06 06:28:18,115 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-06 06:28:18,116 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2022-12-06 06:28:18,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:18,116 INFO L89 Accepts]: Start accepts. Operand has 39 places, 27 transitions, 70 flow [2022-12-06 06:28:18,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:18,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:18,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 70 flow [2022-12-06 06:28:18,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 70 flow [2022-12-06 06:28:18,122 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 06:28:18,122 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:28:18,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:28:18,123 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 70 flow [2022-12-06 06:28:18,123 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 06:28:18,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:18,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:28:18,141 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2022-12-06 06:28:18,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 06:28:18,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:18,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:18,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:28:18,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash 895868875, now seen corresponding path program 1 times [2022-12-06 06:28:18,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:18,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999828440] [2022-12-06 06:28:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:18,592 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-06 06:28:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999828440] [2022-12-06 06:28:18,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999828440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:18,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:28:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716254375] [2022-12-06 06:28:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:18,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:28:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:28:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:28:18,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:18,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 06:28:18,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:18,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:18,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:19,148 INFO L130 PetriNetUnfolder]: 3677/5162 cut-off events. [2022-12-06 06:28:19,148 INFO L131 PetriNetUnfolder]: For 458/458 co-relation queries the response was YES. [2022-12-06 06:28:19,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11139 conditions, 5162 events. 3677/5162 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24554 event pairs, 1853 based on Foata normal form. 24/5173 useless extension candidates. Maximal degree in co-relation 11128. Up to 4759 conditions per place. [2022-12-06 06:28:19,179 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 38 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-06 06:28:19,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 195 flow [2022-12-06 06:28:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 06:28:19,182 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 06:28:19,182 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 51 transitions. [2022-12-06 06:28:19,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 195 flow [2022-12-06 06:28:19,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:28:19,185 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 85 flow [2022-12-06 06:28:19,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2022-12-06 06:28:19,186 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2022-12-06 06:28:19,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:19,186 INFO L89 Accepts]: Start accepts. Operand has 40 places, 29 transitions, 85 flow [2022-12-06 06:28:19,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:19,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:19,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 85 flow [2022-12-06 06:28:19,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 85 flow [2022-12-06 06:28:19,194 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 06:28:19,195 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:28:19,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2022-12-06 06:28:19,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 85 flow [2022-12-06 06:28:19,196 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 06:28:19,219 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:19,221 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 06:28:19,221 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 85 flow [2022-12-06 06:28:19,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 06:28:19,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:19,221 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:19,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:28:19,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2010118717, now seen corresponding path program 1 times [2022-12-06 06:28:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:19,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101279399] [2022-12-06 06:28:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:19,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:19,618 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-06 06:28:19,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:19,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101279399] [2022-12-06 06:28:19,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101279399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:19,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:19,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:28:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077797122] [2022-12-06 06:28:19,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:19,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:19,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:19,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:19,621 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:19,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-06 06:28:19,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:19,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:19,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:20,131 INFO L130 PetriNetUnfolder]: 3701/5192 cut-off events. [2022-12-06 06:28:20,132 INFO L131 PetriNetUnfolder]: For 1117/1117 co-relation queries the response was YES. [2022-12-06 06:28:20,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11958 conditions, 5192 events. 3701/5192 cut-off events. For 1117/1117 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 24617 event pairs, 1595 based on Foata normal form. 4/5190 useless extension candidates. Maximal degree in co-relation 11946. Up to 4913 conditions per place. [2022-12-06 06:28:20,190 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 44 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-12-06 06:28:20,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 269 flow [2022-12-06 06:28:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:28:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:28:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:28:20,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2022-12-06 06:28:20,192 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 85 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:28:20,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 269 flow [2022-12-06 06:28:20,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:28:20,194 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 153 flow [2022-12-06 06:28:20,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-06 06:28:20,195 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2022-12-06 06:28:20,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:20,195 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 153 flow [2022-12-06 06:28:20,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:20,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:20,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 153 flow [2022-12-06 06:28:20,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 153 flow [2022-12-06 06:28:20,212 INFO L130 PetriNetUnfolder]: 37/143 cut-off events. [2022-12-06 06:28:20,212 INFO L131 PetriNetUnfolder]: For 33/36 co-relation queries the response was YES. [2022-12-06 06:28:20,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 143 events. 37/143 cut-off events. For 33/36 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 681 event pairs, 11 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 284. Up to 51 conditions per place. [2022-12-06 06:28:20,214 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 153 flow [2022-12-06 06:28:20,214 INFO L188 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-06 06:28:20,250 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:20,251 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 06:28:20,251 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 153 flow [2022-12-06 06:28:20,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-06 06:28:20,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:20,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:20,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:28:20,252 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:20,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2010141967, now seen corresponding path program 2 times [2022-12-06 06:28:20,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:20,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550425594] [2022-12-06 06:28:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:20,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:20,920 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-06 06:28:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550425594] [2022-12-06 06:28:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550425594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:20,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:20,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:28:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127965024] [2022-12-06 06:28:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:20,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:20,929 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:20,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-06 06:28:20,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:20,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:20,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:21,685 INFO L130 PetriNetUnfolder]: 4209/5954 cut-off events. [2022-12-06 06:28:21,685 INFO L131 PetriNetUnfolder]: For 3654/3687 co-relation queries the response was YES. [2022-12-06 06:28:21,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15726 conditions, 5954 events. 4209/5954 cut-off events. For 3654/3687 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 29511 event pairs, 1390 based on Foata normal form. 72/6016 useless extension candidates. Maximal degree in co-relation 15711. Up to 4785 conditions per place. [2022-12-06 06:28:21,739 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 64 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2022-12-06 06:28:21,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 85 transitions, 458 flow [2022-12-06 06:28:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:28:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:28:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 06:28:21,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:28:21,741 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 153 flow. Second operand 5 states and 90 transitions. [2022-12-06 06:28:21,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 85 transitions, 458 flow [2022-12-06 06:28:21,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 85 transitions, 456 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 06:28:21,747 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 262 flow [2022-12-06 06:28:21,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2022-12-06 06:28:21,748 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 3 predicate places. [2022-12-06 06:28:21,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:21,748 INFO L89 Accepts]: Start accepts. Operand has 50 places, 47 transitions, 262 flow [2022-12-06 06:28:21,749 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:21,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:21,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 262 flow [2022-12-06 06:28:21,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 262 flow [2022-12-06 06:28:21,809 INFO L130 PetriNetUnfolder]: 167/349 cut-off events. [2022-12-06 06:28:21,809 INFO L131 PetriNetUnfolder]: For 604/732 co-relation queries the response was YES. [2022-12-06 06:28:21,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 349 events. 167/349 cut-off events. For 604/732 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1730 event pairs, 56 based on Foata normal form. 6/327 useless extension candidates. Maximal degree in co-relation 1141. Up to 175 conditions per place. [2022-12-06 06:28:21,815 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 262 flow [2022-12-06 06:28:21,815 INFO L188 LiptonReduction]: Number of co-enabled transitions 694 [2022-12-06 06:28:21,827 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:21,828 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 06:28:21,828 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 262 flow [2022-12-06 06:28:21,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-06 06:28:21,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:21,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:21,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:28:21,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -471528150, now seen corresponding path program 1 times [2022-12-06 06:28:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:21,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462116283] [2022-12-06 06:28:21,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:21,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:22,315 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-06 06:28:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:22,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462116283] [2022-12-06 06:28:22,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462116283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:22,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:22,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:28:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088568925] [2022-12-06 06:28:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:22,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:22,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:22,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:22,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:22,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-06 06:28:22,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:22,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:22,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:23,136 INFO L130 PetriNetUnfolder]: 4465/6294 cut-off events. [2022-12-06 06:28:23,136 INFO L131 PetriNetUnfolder]: For 9297/9372 co-relation queries the response was YES. [2022-12-06 06:28:23,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20584 conditions, 6294 events. 4465/6294 cut-off events. For 9297/9372 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 31285 event pairs, 1226 based on Foata normal form. 66/6344 useless extension candidates. Maximal degree in co-relation 20565. Up to 4808 conditions per place. [2022-12-06 06:28:23,181 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 76 selfloop transitions, 20 changer transitions 0/99 dead transitions. [2022-12-06 06:28:23,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 99 transitions, 673 flow [2022-12-06 06:28:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:28:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:28:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-06 06:28:23,183 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-06 06:28:23,183 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 262 flow. Second operand 5 states and 87 transitions. [2022-12-06 06:28:23,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 99 transitions, 673 flow [2022-12-06 06:28:23,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 648 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 06:28:23,196 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 406 flow [2022-12-06 06:28:23,196 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-06 06:28:23,196 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2022-12-06 06:28:23,197 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:23,197 INFO L89 Accepts]: Start accepts. Operand has 55 places, 60 transitions, 406 flow [2022-12-06 06:28:23,198 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:23,198 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:23,198 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 60 transitions, 406 flow [2022-12-06 06:28:23,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 406 flow [2022-12-06 06:28:23,255 INFO L130 PetriNetUnfolder]: 238/458 cut-off events. [2022-12-06 06:28:23,255 INFO L131 PetriNetUnfolder]: For 919/1084 co-relation queries the response was YES. [2022-12-06 06:28:23,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 458 events. 238/458 cut-off events. For 919/1084 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2274 event pairs, 41 based on Foata normal form. 8/447 useless extension candidates. Maximal degree in co-relation 1741. Up to 234 conditions per place. [2022-12-06 06:28:23,263 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 406 flow [2022-12-06 06:28:23,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-06 06:28:23,270 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:23,271 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 06:28:23,271 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 60 transitions, 406 flow [2022-12-06 06:28:23,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-06 06:28:23,271 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:23,271 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:23,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:28:23,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1211159446, now seen corresponding path program 2 times [2022-12-06 06:28:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:23,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946297663] [2022-12-06 06:28:23,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:23,663 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-06 06:28:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946297663] [2022-12-06 06:28:23,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946297663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:23,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:23,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:28:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826537445] [2022-12-06 06:28:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:23,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:23,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-06 06:28:23,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:23,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:23,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:24,340 INFO L130 PetriNetUnfolder]: 4362/6158 cut-off events. [2022-12-06 06:28:24,340 INFO L131 PetriNetUnfolder]: For 12771/12941 co-relation queries the response was YES. [2022-12-06 06:28:24,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22459 conditions, 6158 events. 4362/6158 cut-off events. For 12771/12941 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 30580 event pairs, 1493 based on Foata normal form. 125/6261 useless extension candidates. Maximal degree in co-relation 22437. Up to 4774 conditions per place. [2022-12-06 06:28:24,404 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 71 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2022-12-06 06:28:24,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 687 flow [2022-12-06 06:28:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:28:24,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:28:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 06:28:24,406 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-06 06:28:24,406 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 406 flow. Second operand 4 states and 69 transitions. [2022-12-06 06:28:24,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 687 flow [2022-12-06 06:28:24,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 665 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-06 06:28:24,432 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 430 flow [2022-12-06 06:28:24,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-06 06:28:24,433 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2022-12-06 06:28:24,433 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:24,433 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 430 flow [2022-12-06 06:28:24,434 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:24,434 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:24,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 430 flow [2022-12-06 06:28:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 430 flow [2022-12-06 06:28:24,500 INFO L130 PetriNetUnfolder]: 218/417 cut-off events. [2022-12-06 06:28:24,501 INFO L131 PetriNetUnfolder]: For 1086/1228 co-relation queries the response was YES. [2022-12-06 06:28:24,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 417 events. 218/417 cut-off events. For 1086/1228 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2009 event pairs, 64 based on Foata normal form. 8/405 useless extension candidates. Maximal degree in co-relation 1663. Up to 187 conditions per place. [2022-12-06 06:28:24,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 430 flow [2022-12-06 06:28:24,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 830 [2022-12-06 06:28:24,514 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:24,517 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 06:28:24,517 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 430 flow [2022-12-06 06:28:24,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-06 06:28:24,517 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:24,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:24,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:28:24,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -475017634, now seen corresponding path program 1 times [2022-12-06 06:28:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:24,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166566180] [2022-12-06 06:28:24,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:25,034 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-06 06:28:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:25,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166566180] [2022-12-06 06:28:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166566180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:25,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:25,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:28:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636131181] [2022-12-06 06:28:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:25,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:28:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:28:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:28:25,037 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:25,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 430 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:25,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:25,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:25,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:25,798 INFO L130 PetriNetUnfolder]: 4492/6368 cut-off events. [2022-12-06 06:28:25,798 INFO L131 PetriNetUnfolder]: For 14922/15077 co-relation queries the response was YES. [2022-12-06 06:28:25,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23587 conditions, 6368 events. 4492/6368 cut-off events. For 14922/15077 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32019 event pairs, 1386 based on Foata normal form. 103/6449 useless extension candidates. Maximal degree in co-relation 23563. Up to 4796 conditions per place. [2022-12-06 06:28:25,844 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 81 selfloop transitions, 19 changer transitions 0/103 dead transitions. [2022-12-06 06:28:25,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 800 flow [2022-12-06 06:28:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:28:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:28:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 06:28:25,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6370370370370371 [2022-12-06 06:28:25,847 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 430 flow. Second operand 5 states and 86 transitions. [2022-12-06 06:28:25,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 800 flow [2022-12-06 06:28:25,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 770 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:28:25,864 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 483 flow [2022-12-06 06:28:25,864 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2022-12-06 06:28:25,867 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2022-12-06 06:28:25,867 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:25,867 INFO L89 Accepts]: Start accepts. Operand has 60 places, 64 transitions, 483 flow [2022-12-06 06:28:25,868 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:25,868 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:25,869 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 64 transitions, 483 flow [2022-12-06 06:28:25,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 64 transitions, 483 flow [2022-12-06 06:28:25,927 INFO L130 PetriNetUnfolder]: 251/463 cut-off events. [2022-12-06 06:28:25,927 INFO L131 PetriNetUnfolder]: For 1450/1633 co-relation queries the response was YES. [2022-12-06 06:28:25,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 463 events. 251/463 cut-off events. For 1450/1633 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2222 event pairs, 61 based on Foata normal form. 8/459 useless extension candidates. Maximal degree in co-relation 2000. Up to 212 conditions per place. [2022-12-06 06:28:25,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 64 transitions, 483 flow [2022-12-06 06:28:25,935 INFO L188 LiptonReduction]: Number of co-enabled transitions 896 [2022-12-06 06:28:25,944 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:25,946 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 06:28:25,947 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 483 flow [2022-12-06 06:28:25,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:25,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:25,947 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:25,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:28:25,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -475040884, now seen corresponding path program 2 times [2022-12-06 06:28:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:25,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713079670] [2022-12-06 06:28:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:26,344 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-06 06:28:26,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:26,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713079670] [2022-12-06 06:28:26,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713079670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:26,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:26,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:28:26,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083399644] [2022-12-06 06:28:26,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:26,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:28:26,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:28:26,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:28:26,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:28:26,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:26,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:26,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:28:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:27,057 INFO L130 PetriNetUnfolder]: 4900/7042 cut-off events. [2022-12-06 06:28:27,057 INFO L131 PetriNetUnfolder]: For 21375/21530 co-relation queries the response was YES. [2022-12-06 06:28:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27348 conditions, 7042 events. 4900/7042 cut-off events. For 21375/21530 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 37382 event pairs, 1158 based on Foata normal form. 127/7147 useless extension candidates. Maximal degree in co-relation 27323. Up to 4252 conditions per place. [2022-12-06 06:28:27,111 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 71 selfloop transitions, 35 changer transitions 0/109 dead transitions. [2022-12-06 06:28:27,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 109 transitions, 883 flow [2022-12-06 06:28:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:28:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:28:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 06:28:27,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2022-12-06 06:28:27,113 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 483 flow. Second operand 5 states and 89 transitions. [2022-12-06 06:28:27,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 109 transitions, 883 flow [2022-12-06 06:28:27,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 834 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 06:28:27,139 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 598 flow [2022-12-06 06:28:27,140 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=598, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2022-12-06 06:28:27,140 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2022-12-06 06:28:27,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:27,140 INFO L89 Accepts]: Start accepts. Operand has 62 places, 71 transitions, 598 flow [2022-12-06 06:28:27,141 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:27,141 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:27,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 71 transitions, 598 flow [2022-12-06 06:28:27,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 71 transitions, 598 flow [2022-12-06 06:28:27,208 INFO L130 PetriNetUnfolder]: 272/514 cut-off events. [2022-12-06 06:28:27,208 INFO L131 PetriNetUnfolder]: For 2190/2573 co-relation queries the response was YES. [2022-12-06 06:28:27,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2509 conditions, 514 events. 272/514 cut-off events. For 2190/2573 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2551 event pairs, 46 based on Foata normal form. 18/520 useless extension candidates. Maximal degree in co-relation 2486. Up to 257 conditions per place. [2022-12-06 06:28:27,216 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 71 transitions, 598 flow [2022-12-06 06:28:27,216 INFO L188 LiptonReduction]: Number of co-enabled transitions 994 [2022-12-06 06:28:27,225 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:27,226 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 06:28:27,226 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 598 flow [2022-12-06 06:28:27,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:27,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:27,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:27,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:28:27,227 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -992335824, now seen corresponding path program 1 times [2022-12-06 06:28:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:27,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092844708] [2022-12-06 06:28:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:27,386 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-06 06:28:27,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:27,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092844708] [2022-12-06 06:28:27,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092844708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:27,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:27,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:28:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022554900] [2022-12-06 06:28:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:27,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:28:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:28:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:28:27,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:28:27,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 598 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-06 06:28:27,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:27,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:28:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:28,056 INFO L130 PetriNetUnfolder]: 4223/6135 cut-off events. [2022-12-06 06:28:28,057 INFO L131 PetriNetUnfolder]: For 32186/32562 co-relation queries the response was YES. [2022-12-06 06:28:28,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26137 conditions, 6135 events. 4223/6135 cut-off events. For 32186/32562 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 33394 event pairs, 735 based on Foata normal form. 730/6836 useless extension candidates. Maximal degree in co-relation 26111. Up to 3804 conditions per place. [2022-12-06 06:28:28,096 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 123 selfloop transitions, 9 changer transitions 44/184 dead transitions. [2022-12-06 06:28:28,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 184 transitions, 1913 flow [2022-12-06 06:28:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:28:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:28:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 06:28:28,099 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2022-12-06 06:28:28,099 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 598 flow. Second operand 5 states and 88 transitions. [2022-12-06 06:28:28,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 184 transitions, 1913 flow [2022-12-06 06:28:28,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 184 transitions, 1794 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-12-06 06:28:28,127 INFO L231 Difference]: Finished difference. Result has 67 places, 74 transitions, 588 flow [2022-12-06 06:28:28,131 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=67, PETRI_TRANSITIONS=74} [2022-12-06 06:28:28,132 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2022-12-06 06:28:28,132 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:28,132 INFO L89 Accepts]: Start accepts. Operand has 67 places, 74 transitions, 588 flow [2022-12-06 06:28:28,134 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:28,134 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:28,134 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 74 transitions, 588 flow [2022-12-06 06:28:28,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 74 transitions, 588 flow [2022-12-06 06:28:28,260 INFO L130 PetriNetUnfolder]: 671/1229 cut-off events. [2022-12-06 06:28:28,260 INFO L131 PetriNetUnfolder]: For 4679/5347 co-relation queries the response was YES. [2022-12-06 06:28:28,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 1229 events. 671/1229 cut-off events. For 4679/5347 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 7774 event pairs, 226 based on Foata normal form. 57/1179 useless extension candidates. Maximal degree in co-relation 5197. Up to 562 conditions per place. [2022-12-06 06:28:28,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 74 transitions, 588 flow [2022-12-06 06:28:28,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 1260 [2022-12-06 06:28:28,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L863-3-->L867: Formula: (and (= (mod v_~main$tmp_guard0~0_60 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard0~0_60 (ite (= (ite (= v_~__unbuffered_cnt~0_187 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_60, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [512] L793-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res#1.offset_13| 0) (= |v_P1Thread1of1ForFork3_#res#1.base_13| 0) (= v_~__unbuffered_cnt~0_141 (+ v_~__unbuffered_cnt~0_142 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142} OutVars{P1Thread1of1ForFork3_#res#1.base=|v_P1Thread1of1ForFork3_#res#1.base_13|, P1Thread1of1ForFork3_#res#1.offset=|v_P1Thread1of1ForFork3_#res#1.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res#1.base, P1Thread1of1ForFork3_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-06 06:28:28,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L863-3-->L867: Formula: (and (= (mod v_~main$tmp_guard0~0_60 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard0~0_60 (ite (= (ite (= v_~__unbuffered_cnt~0_187 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_60, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [519] L813-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_29| 0) (= v_~__unbuffered_cnt~0_181 (+ v_~__unbuffered_cnt~0_182 1)) (= |v_P2Thread1of1ForFork0_#res.base_29| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_182} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 06:28:28,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L863-3-->L867: Formula: (and (= (mod v_~main$tmp_guard0~0_60 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|) (= v_~main$tmp_guard0~0_60 (ite (= (ite (= v_~__unbuffered_cnt~0_187 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_13|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_60, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_45|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [498] L839-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_7|) (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_7|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 06:28:28,384 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:28:28,385 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-06 06:28:28,385 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 594 flow [2022-12-06 06:28:28,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-06 06:28:28,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:28,386 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:28,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:28:28,386 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash -286440322, now seen corresponding path program 1 times [2022-12-06 06:28:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:28,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069986202] [2022-12-06 06:28:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:28,556 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-06 06:28:28,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:28,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069986202] [2022-12-06 06:28:28,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069986202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:28,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:28,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:28:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992997267] [2022-12-06 06:28:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:28,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:28,558 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:28:28,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 594 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:28,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:28,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:28:28,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:29,249 INFO L130 PetriNetUnfolder]: 2967/4505 cut-off events. [2022-12-06 06:28:29,249 INFO L131 PetriNetUnfolder]: For 23674/23948 co-relation queries the response was YES. [2022-12-06 06:28:29,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20233 conditions, 4505 events. 2967/4505 cut-off events. For 23674/23948 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25149 event pairs, 313 based on Foata normal form. 499/4980 useless extension candidates. Maximal degree in co-relation 20204. Up to 1501 conditions per place. [2022-12-06 06:28:29,282 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 140 selfloop transitions, 16 changer transitions 38/202 dead transitions. [2022-12-06 06:28:29,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 202 transitions, 2026 flow [2022-12-06 06:28:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:28:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:28:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-12-06 06:28:29,284 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 06:28:29,284 INFO L175 Difference]: Start difference. First operand has 66 places, 73 transitions, 594 flow. Second operand 6 states and 111 transitions. [2022-12-06 06:28:29,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 202 transitions, 2026 flow [2022-12-06 06:28:29,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 202 transitions, 2015 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:28:29,306 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 692 flow [2022-12-06 06:28:29,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2022-12-06 06:28:29,307 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2022-12-06 06:28:29,307 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:29,307 INFO L89 Accepts]: Start accepts. Operand has 73 places, 79 transitions, 692 flow [2022-12-06 06:28:29,308 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:29,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:29,308 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 79 transitions, 692 flow [2022-12-06 06:28:29,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 79 transitions, 692 flow [2022-12-06 06:28:29,406 INFO L130 PetriNetUnfolder]: 366/809 cut-off events. [2022-12-06 06:28:29,406 INFO L131 PetriNetUnfolder]: For 4995/6331 co-relation queries the response was YES. [2022-12-06 06:28:29,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4065 conditions, 809 events. 366/809 cut-off events. For 4995/6331 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5377 event pairs, 61 based on Foata normal form. 51/805 useless extension candidates. Maximal degree in co-relation 4035. Up to 448 conditions per place. [2022-12-06 06:28:29,417 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 79 transitions, 692 flow [2022-12-06 06:28:29,417 INFO L188 LiptonReduction]: Number of co-enabled transitions 1402 [2022-12-06 06:28:29,421 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:28:29,423 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-06 06:28:29,423 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 692 flow [2022-12-06 06:28:29,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:29,424 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:29,424 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:29,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:28:29,424 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -149810809, now seen corresponding path program 1 times [2022-12-06 06:28:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:29,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744349920] [2022-12-06 06:28:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:29,616 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-06 06:28:29,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:29,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744349920] [2022-12-06 06:28:29,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744349920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:29,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:29,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:28:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924179834] [2022-12-06 06:28:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:28:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:28:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:28:29,619 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:28:29,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-06 06:28:29,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:29,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:28:29,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:30,172 INFO L130 PetriNetUnfolder]: 2601/3998 cut-off events. [2022-12-06 06:28:30,172 INFO L131 PetriNetUnfolder]: For 23291/23551 co-relation queries the response was YES. [2022-12-06 06:28:30,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19241 conditions, 3998 events. 2601/3998 cut-off events. For 23291/23551 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22421 event pairs, 266 based on Foata normal form. 296/4272 useless extension candidates. Maximal degree in co-relation 19208. Up to 1329 conditions per place. [2022-12-06 06:28:30,207 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 147 selfloop transitions, 24 changer transitions 50/229 dead transitions. [2022-12-06 06:28:30,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 229 transitions, 2371 flow [2022-12-06 06:28:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:28:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:28:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-06 06:28:30,209 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-06 06:28:30,209 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 692 flow. Second operand 8 states and 145 transitions. [2022-12-06 06:28:30,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 229 transitions, 2371 flow [2022-12-06 06:28:30,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 229 transitions, 2244 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-06 06:28:30,318 INFO L231 Difference]: Finished difference. Result has 79 places, 84 transitions, 755 flow [2022-12-06 06:28:30,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=755, PETRI_PLACES=79, PETRI_TRANSITIONS=84} [2022-12-06 06:28:30,319 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2022-12-06 06:28:30,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:30,319 INFO L89 Accepts]: Start accepts. Operand has 79 places, 84 transitions, 755 flow [2022-12-06 06:28:30,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:30,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:30,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 84 transitions, 755 flow [2022-12-06 06:28:30,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 84 transitions, 755 flow [2022-12-06 06:28:30,396 INFO L130 PetriNetUnfolder]: 225/594 cut-off events. [2022-12-06 06:28:30,396 INFO L131 PetriNetUnfolder]: For 3682/4322 co-relation queries the response was YES. [2022-12-06 06:28:30,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 594 events. 225/594 cut-off events. For 3682/4322 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4001 event pairs, 9 based on Foata normal form. 30/583 useless extension candidates. Maximal degree in co-relation 2858. Up to 243 conditions per place. [2022-12-06 06:28:30,406 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 84 transitions, 755 flow [2022-12-06 06:28:30,407 INFO L188 LiptonReduction]: Number of co-enabled transitions 1478 [2022-12-06 06:28:30,424 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [382] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_152 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x$w_buff0_used~0_151 (ite .cse1 0 v_~x$w_buff0_used~0_152)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_127) v_~x$w_buff1_used~0_126) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_24)) (= (ite .cse1 v_~x$w_buff0~0_68 (ite .cse2 v_~x$w_buff1~0_61 v_~x~0_102)) v_~x~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:28:30,624 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:28:30,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-06 06:28:30,625 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 84 transitions, 762 flow [2022-12-06 06:28:30,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-06 06:28:30,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:30,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:30,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:28:30,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash 205131405, now seen corresponding path program 1 times [2022-12-06 06:28:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:30,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236128229] [2022-12-06 06:28:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:30,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:30,950 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-06 06:28:30,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:30,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236128229] [2022-12-06 06:28:30,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236128229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:30,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:30,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:28:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436468878] [2022-12-06 06:28:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:30,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:30,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:28:30,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 84 transitions, 762 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-06 06:28:30,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:30,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:28:30,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:32,254 INFO L130 PetriNetUnfolder]: 8777/12868 cut-off events. [2022-12-06 06:28:32,254 INFO L131 PetriNetUnfolder]: For 60451/60451 co-relation queries the response was YES. [2022-12-06 06:28:32,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59821 conditions, 12868 events. 8777/12868 cut-off events. For 60451/60451 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 74794 event pairs, 1706 based on Foata normal form. 14/12882 useless extension candidates. Maximal degree in co-relation 59786. Up to 7032 conditions per place. [2022-12-06 06:28:32,318 INFO L137 encePairwiseOnDemand]: 17/31 looper letters, 139 selfloop transitions, 57 changer transitions 107/303 dead transitions. [2022-12-06 06:28:32,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 303 transitions, 3294 flow [2022-12-06 06:28:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:28:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:28:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-06 06:28:32,319 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-06 06:28:32,320 INFO L175 Difference]: Start difference. First operand has 79 places, 84 transitions, 762 flow. Second operand 6 states and 120 transitions. [2022-12-06 06:28:32,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 303 transitions, 3294 flow [2022-12-06 06:28:32,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 303 transitions, 2936 flow, removed 130 selfloop flow, removed 4 redundant places. [2022-12-06 06:28:32,820 INFO L231 Difference]: Finished difference. Result has 85 places, 128 transitions, 1375 flow [2022-12-06 06:28:32,820 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1375, PETRI_PLACES=85, PETRI_TRANSITIONS=128} [2022-12-06 06:28:32,821 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2022-12-06 06:28:32,821 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:32,821 INFO L89 Accepts]: Start accepts. Operand has 85 places, 128 transitions, 1375 flow [2022-12-06 06:28:32,822 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:32,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:32,823 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 128 transitions, 1375 flow [2022-12-06 06:28:32,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 128 transitions, 1375 flow [2022-12-06 06:28:32,965 INFO L130 PetriNetUnfolder]: 893/1710 cut-off events. [2022-12-06 06:28:32,966 INFO L131 PetriNetUnfolder]: For 7697/8022 co-relation queries the response was YES. [2022-12-06 06:28:32,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8318 conditions, 1710 events. 893/1710 cut-off events. For 7697/8022 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11065 event pairs, 88 based on Foata normal form. 56/1696 useless extension candidates. Maximal degree in co-relation 8281. Up to 917 conditions per place. [2022-12-06 06:28:32,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 128 transitions, 1375 flow [2022-12-06 06:28:32,986 INFO L188 LiptonReduction]: Number of co-enabled transitions 1310 [2022-12-06 06:28:34,810 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:28:34,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1990 [2022-12-06 06:28:34,812 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 128 transitions, 1419 flow [2022-12-06 06:28:34,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-06 06:28:34,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:34,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:34,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:28:34,812 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 336755203, now seen corresponding path program 1 times [2022-12-06 06:28:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:34,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997779988] [2022-12-06 06:28:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:35,056 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-06 06:28:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:35,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997779988] [2022-12-06 06:28:35,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997779988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:35,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:35,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:28:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464560768] [2022-12-06 06:28:35,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:35,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:28:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:28:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:28:35,058 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:28:35,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 128 transitions, 1419 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:35,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:35,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:28:35,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:35,779 INFO L130 PetriNetUnfolder]: 3285/4921 cut-off events. [2022-12-06 06:28:35,779 INFO L131 PetriNetUnfolder]: For 41471/42433 co-relation queries the response was YES. [2022-12-06 06:28:35,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27274 conditions, 4921 events. 3285/4921 cut-off events. For 41471/42433 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 27743 event pairs, 386 based on Foata normal form. 272/4938 useless extension candidates. Maximal degree in co-relation 27234. Up to 2654 conditions per place. [2022-12-06 06:28:35,832 INFO L137 encePairwiseOnDemand]: 22/30 looper letters, 208 selfloop transitions, 18 changer transitions 25/264 dead transitions. [2022-12-06 06:28:35,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 264 transitions, 3322 flow [2022-12-06 06:28:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:28:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:28:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions. [2022-12-06 06:28:35,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-06 06:28:35,834 INFO L175 Difference]: Start difference. First operand has 80 places, 128 transitions, 1419 flow. Second operand 8 states and 122 transitions. [2022-12-06 06:28:35,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 264 transitions, 3322 flow [2022-12-06 06:28:35,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 264 transitions, 3142 flow, removed 52 selfloop flow, removed 7 redundant places. [2022-12-06 06:28:35,928 INFO L231 Difference]: Finished difference. Result has 83 places, 125 transitions, 1289 flow [2022-12-06 06:28:35,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1289, PETRI_PLACES=83, PETRI_TRANSITIONS=125} [2022-12-06 06:28:35,929 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2022-12-06 06:28:35,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:35,929 INFO L89 Accepts]: Start accepts. Operand has 83 places, 125 transitions, 1289 flow [2022-12-06 06:28:35,930 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:35,930 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:35,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 125 transitions, 1289 flow [2022-12-06 06:28:35,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 125 transitions, 1289 flow [2022-12-06 06:28:36,043 INFO L130 PetriNetUnfolder]: 646/1231 cut-off events. [2022-12-06 06:28:36,044 INFO L131 PetriNetUnfolder]: For 4615/4805 co-relation queries the response was YES. [2022-12-06 06:28:36,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5936 conditions, 1231 events. 646/1231 cut-off events. For 4615/4805 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7477 event pairs, 78 based on Foata normal form. 37/1224 useless extension candidates. Maximal degree in co-relation 5910. Up to 672 conditions per place. [2022-12-06 06:28:36,056 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 125 transitions, 1289 flow [2022-12-06 06:28:36,057 INFO L188 LiptonReduction]: Number of co-enabled transitions 1114 [2022-12-06 06:28:36,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_152 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x$w_buff0_used~0_151 (ite .cse1 0 v_~x$w_buff0_used~0_152)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_127) v_~x$w_buff1_used~0_126) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_24)) (= (ite .cse1 v_~x$w_buff0~0_68 (ite .cse2 v_~x$w_buff1~0_61 v_~x~0_102)) v_~x~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,243 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,304 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,418 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,475 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_152 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x$w_buff0_used~0_151 (ite .cse1 0 v_~x$w_buff0_used~0_152)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_127) v_~x$w_buff1_used~0_126) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_24)) (= (ite .cse1 v_~x$w_buff0~0_68 (ite .cse2 v_~x$w_buff1~0_61 v_~x~0_102)) v_~x~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,601 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,716 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,891 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:36,950 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,127 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,244 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,331 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L783-->L786: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,340 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,513 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [382] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_152 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x$w_buff0_used~0_151 (ite .cse1 0 v_~x$w_buff0_used~0_152)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_127) v_~x$w_buff1_used~0_126) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_24)) (= (ite .cse1 v_~x$w_buff0~0_68 (ite .cse2 v_~x$w_buff1~0_61 v_~x~0_102)) v_~x~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,571 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,728 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:37,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [396] L803-->L806: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] [2022-12-06 06:28:38,800 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:28:38,801 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2872 [2022-12-06 06:28:38,802 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 122 transitions, 1333 flow [2022-12-06 06:28:38,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:28:38,802 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:38,802 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:28:38,802 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1635994545, now seen corresponding path program 1 times [2022-12-06 06:28:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:38,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942562] [2022-12-06 06:28:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:38,991 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-06 06:28:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:38,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942562] [2022-12-06 06:28:38,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:38,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:38,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:28:38,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271327168] [2022-12-06 06:28:38,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:38,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:28:38,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:38,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:28:38,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:28:38,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 56 [2022-12-06 06:28:38,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 122 transitions, 1333 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-06 06:28:38,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:38,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 56 [2022-12-06 06:28:38,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:39,585 INFO L130 PetriNetUnfolder]: 3057/4893 cut-off events. [2022-12-06 06:28:39,585 INFO L131 PetriNetUnfolder]: For 31158/31731 co-relation queries the response was YES. [2022-12-06 06:28:39,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26023 conditions, 4893 events. 3057/4893 cut-off events. For 31158/31731 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 29346 event pairs, 943 based on Foata normal form. 86/4791 useless extension candidates. Maximal degree in co-relation 25985. Up to 2325 conditions per place. [2022-12-06 06:28:39,618 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 80 selfloop transitions, 4 changer transitions 61/153 dead transitions. [2022-12-06 06:28:39,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 153 transitions, 1819 flow [2022-12-06 06:28:39,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:28:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:28:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 06:28:39,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2022-12-06 06:28:39,620 INFO L175 Difference]: Start difference. First operand has 78 places, 122 transitions, 1333 flow. Second operand 3 states and 47 transitions. [2022-12-06 06:28:39,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 153 transitions, 1819 flow [2022-12-06 06:28:39,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 153 transitions, 1704 flow, removed 28 selfloop flow, removed 9 redundant places. [2022-12-06 06:28:39,708 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 697 flow [2022-12-06 06:28:39,708 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2022-12-06 06:28:39,708 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2022-12-06 06:28:39,708 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:39,708 INFO L89 Accepts]: Start accepts. Operand has 72 places, 78 transitions, 697 flow [2022-12-06 06:28:39,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:39,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:39,711 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 78 transitions, 697 flow [2022-12-06 06:28:39,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 78 transitions, 697 flow [2022-12-06 06:28:39,764 INFO L130 PetriNetUnfolder]: 290/602 cut-off events. [2022-12-06 06:28:39,764 INFO L131 PetriNetUnfolder]: For 2840/3023 co-relation queries the response was YES. [2022-12-06 06:28:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2637 conditions, 602 events. 290/602 cut-off events. For 2840/3023 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3339 event pairs, 41 based on Foata normal form. 88/667 useless extension candidates. Maximal degree in co-relation 2607. Up to 310 conditions per place. [2022-12-06 06:28:39,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 78 transitions, 697 flow [2022-12-06 06:28:39,771 INFO L188 LiptonReduction]: Number of co-enabled transitions 656 [2022-12-06 06:28:40,035 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:28:40,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 328 [2022-12-06 06:28:40,036 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 717 flow [2022-12-06 06:28:40,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-06 06:28:40,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:40,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:40,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:28:40,037 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1936776207, now seen corresponding path program 1 times [2022-12-06 06:28:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:40,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422435070] [2022-12-06 06:28:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:28:46,005 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-06 06:28:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:28:46,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422435070] [2022-12-06 06:28:46,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422435070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:28:46,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:28:46,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:28:46,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038515389] [2022-12-06 06:28:46,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:28:46,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:28:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:28:46,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:28:46,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:28:46,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 06:28:46,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 717 flow. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-06 06:28:46,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:28:46,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 06:28:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:28:46,433 INFO L130 PetriNetUnfolder]: 1980/3050 cut-off events. [2022-12-06 06:28:46,434 INFO L131 PetriNetUnfolder]: For 15714/15714 co-relation queries the response was YES. [2022-12-06 06:28:46,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16064 conditions, 3050 events. 1980/3050 cut-off events. For 15714/15714 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15388 event pairs, 291 based on Foata normal form. 1/3051 useless extension candidates. Maximal degree in co-relation 16031. Up to 1525 conditions per place. [2022-12-06 06:28:46,448 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 51 selfloop transitions, 8 changer transitions 87/146 dead transitions. [2022-12-06 06:28:46,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 146 transitions, 1579 flow [2022-12-06 06:28:46,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:28:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:28:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 06:28:46,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-06 06:28:46,450 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 717 flow. Second operand 6 states and 75 transitions. [2022-12-06 06:28:46,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 146 transitions, 1579 flow [2022-12-06 06:28:46,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 146 transitions, 1566 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-06 06:28:46,486 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 421 flow [2022-12-06 06:28:46,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2022-12-06 06:28:46,487 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2022-12-06 06:28:46,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:28:46,487 INFO L89 Accepts]: Start accepts. Operand has 76 places, 48 transitions, 421 flow [2022-12-06 06:28:46,488 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:28:46,488 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:28:46,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 48 transitions, 421 flow [2022-12-06 06:28:46,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 48 transitions, 421 flow [2022-12-06 06:28:46,519 INFO L130 PetriNetUnfolder]: 133/323 cut-off events. [2022-12-06 06:28:46,520 INFO L131 PetriNetUnfolder]: For 1450/1493 co-relation queries the response was YES. [2022-12-06 06:28:46,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 323 events. 133/323 cut-off events. For 1450/1493 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1729 event pairs, 17 based on Foata normal form. 25/335 useless extension candidates. Maximal degree in co-relation 1391. Up to 107 conditions per place. [2022-12-06 06:28:46,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 48 transitions, 421 flow [2022-12-06 06:28:46,524 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 06:28:46,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L756: Formula: (and (= v_~b~0_57 1) (= v_~x~0_705 1) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{~b~0=v_~b~0_57, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_705, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [397] L806-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~x$w_buff1_used~0_96 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_97)) (= (ite .cse2 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= (ite .cse2 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_39 v_~x~0_68)) v_~x~0_67) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_68, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_39, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_67, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:28:46,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L756: Formula: (and (= v_~b~0_57 1) (= v_~x~0_705 1) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{~b~0=v_~b~0_57, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_705, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:28:46,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->L756: Formula: (and (= v_~b~0_57 1) (= v_~x~0_705 1) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{~b~0=v_~b~0_57, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_705, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [406] L832-->L839: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_131 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_132 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_109 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_108 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd4~0_20)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_109) v_~x$w_buff1_used~0_108) (= (ite .cse4 0 v_~x$w_buff0_used~0_132) v_~x$w_buff0_used~0_131) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_80))) (= (ite .cse3 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_109, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_132} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_108, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_131} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:28:47,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [586] $Ultimate##0-->L839: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_820 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_178 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_170 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_821 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_746 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= v_~b~0_71 1) (= v_~x$r_buff0_thd4~0_169 (ite .cse0 0 v_~x$r_buff0_thd4~0_170)) (= v_~x$w_buff0_used~0_820 (ite .cse1 0 v_~x$w_buff0_used~0_821)) (= (ite .cse1 v_~x$w_buff0~0_499 (ite .cse2 v_~x$w_buff1~0_456 1)) v_~x~0_739) (= v_~x$w_buff1_used~0_745 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_746)) (= v_~x$r_buff1_thd4~0_177 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_745 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_169 256) 0)))) 0 v_~x$r_buff1_thd4~0_178)) (= v_P0Thread1of1ForFork1_~arg.offset_31 |v_P0Thread1of1ForFork1_#in~arg.offset_31|) (= |v_P0Thread1of1ForFork1_#in~arg.base_31| v_P0Thread1of1ForFork1_~arg.base_31)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_499, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_456, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_746, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_170, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_178, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_821} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_499, ~b~0=v_~b~0_71, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_456, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_745, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_31, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_169, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_31|, ~x~0=v_~x~0_739, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_177, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_31, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_820} AuxVars[] AssignedVars[~b~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [382] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff0_used~0_152 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_127 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd1~0_26) v_~x$r_buff0_thd1~0_25) (= v_~x$w_buff0_used~0_151 (ite .cse1 0 v_~x$w_buff0_used~0_152)) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_127) v_~x$w_buff1_used~0_126) (= v_~x$r_buff1_thd1~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_126 256) 0))) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_24)) (= (ite .cse1 v_~x$w_buff0~0_68 (ite .cse2 v_~x$w_buff1~0_61 v_~x~0_102)) v_~x~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_24, ~x~0=v_~x~0_102, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_68, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_61, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_126, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~x~0=v_~x~0_101, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:28:47,435 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->L806: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_~z~0_185 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= v_~y~0_39 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z~0=v_~z~0_185, ~y~0=v_~y~0_39, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0] and [390] L786-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_123 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_124 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse2)) (.cse3 (and .cse1 .cse5))) (and (= v_~x$w_buff0_used~0_123 (ite .cse0 0 v_~x$w_buff0_used~0_124)) (= v_~x$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1) (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse2)) 0 v_~x$r_buff1_thd2~0_24)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x~0_71 (ite .cse0 v_~x$w_buff0~0_48 (ite .cse4 v_~x$w_buff1~0_41 v_~x~0_72))) (= v_~x$r_buff0_thd2~0_28 (ite .cse3 0 v_~x$r_buff0_thd2~0_29))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_124} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:28:47,514 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [590] $Ultimate##0-->L806: Formula: (and (= |v_P2Thread1of1ForFork0_#in~arg.base_19| v_P2Thread1of1ForFork0_~arg.base_19) (= v_~z~0_185 1) (= |v_P2Thread1of1ForFork0_#in~arg.offset_19| v_P2Thread1of1ForFork0_~arg.offset_19) (= v_~y~0_39 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_19, ~z~0=v_~z~0_185, ~y~0=v_~y~0_39, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_19|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_~arg.offset, ~z~0, ~y~0] and [532] $Ultimate##0-->L829: Formula: (and (= |v_P3Thread1of1ForFork2_#in~arg.base_15| v_P3Thread1of1ForFork2_~arg.base_15) (= v_~z~0_87 2) (= v_~a~0_42 v_~__unbuffered_p3_EAX~0_86) (= v_~a~0_42 1) (= v_P3Thread1of1ForFork2_~arg.offset_15 |v_P3Thread1of1ForFork2_#in~arg.offset_15|)) InVars {P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} OutVars{~a~0=v_~a~0_42, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_86, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_15|, ~z~0=v_~z~0_87, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_15, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_15|} AuxVars[] AssignedVars[~a~0, P3Thread1of1ForFork2_~arg.offset, ~__unbuffered_p3_EAX~0, ~z~0, P3Thread1of1ForFork2_~arg.base] [2022-12-06 06:28:47,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [583] $Ultimate##0-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_143 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_808 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_140 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_734 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_809 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_734) v_~x$w_buff1_used~0_733) (= v_~x$r_buff0_thd1~0_139 (ite .cse1 0 v_~x$r_buff0_thd1~0_140)) (= |v_P0Thread1of1ForFork1_#in~arg.base_25| v_P0Thread1of1ForFork1_~arg.base_25) (= (ite .cse2 v_~x$w_buff0~0_493 (ite .cse0 v_~x$w_buff1~0_450 1)) v_~x~0_727) (= v_~b~0_65 1) (= v_P0Thread1of1ForFork1_~arg.offset_25 |v_P0Thread1of1ForFork1_#in~arg.offset_25|) (= v_~x$w_buff0_used~0_808 (ite .cse2 0 v_~x$w_buff0_used~0_809)) (= v_~x$r_buff1_thd1~0_142 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_733 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_139 256) 0)))) 0 v_~x$r_buff1_thd1~0_143))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_493, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_140, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_450, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_734, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_143, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_809} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_493, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_139, ~b~0=v_~b~0_65, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_450, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_733, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_25, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_142, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_25|, ~x~0=v_~x~0_727, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_808} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~b~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 06:28:47,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [584] $Ultimate##0-->L813: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_812 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_176 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_168 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_813 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_738 256) 0)))) (.cse0 (and .cse5 .cse3))) (and (= v_~b~0_67 1) (= v_P0Thread1of1ForFork1_~arg.offset_27 |v_P0Thread1of1ForFork1_#in~arg.offset_27|) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_738) v_~x$w_buff1_used~0_737) (= v_~x$w_buff0_used~0_812 (ite .cse2 0 v_~x$w_buff0_used~0_813)) (= (ite .cse2 v_~x$w_buff0~0_495 (ite .cse1 v_~x$w_buff1~0_452 1)) v_~x~0_731) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_168) v_~x$r_buff0_thd3~0_167) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_167 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_737 256) 0)))) 0 v_~x$r_buff1_thd3~0_176) v_~x$r_buff1_thd3~0_175) (= |v_P0Thread1of1ForFork1_#in~arg.base_27| v_P0Thread1of1ForFork1_~arg.base_27)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_495, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_452, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_738, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_168, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_813} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_495, ~b~0=v_~b~0_67, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_452, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_175, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_737, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_27, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_167, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_27|, ~x~0=v_~x~0_731, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_27, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_812} AuxVars[] AssignedVars[~b~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff0_thd3~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 06:28:47,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [585] $Ultimate##0-->L793: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_816 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd2~0_184 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_225 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_817 256) 0)))) (.cse4 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_742 256) 0)))) (.cse3 (and .cse5 .cse1))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_741 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd2~0_224 256) 0)))) 0 v_~x$r_buff1_thd2~0_184) v_~x$r_buff1_thd2~0_183) (= (ite .cse2 0 v_~x$w_buff0_used~0_817) v_~x$w_buff0_used~0_816) (= v_~x$w_buff1_used~0_741 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_742)) (= v_P0Thread1of1ForFork1_~arg.offset_29 |v_P0Thread1of1ForFork1_#in~arg.offset_29|) (= (ite .cse2 v_~x$w_buff0~0_497 (ite .cse4 v_~x$w_buff1~0_454 1)) v_~x~0_735) (= v_~b~0_69 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_29| v_P0Thread1of1ForFork1_~arg.base_29) (= (ite .cse3 0 v_~x$r_buff0_thd2~0_225) v_~x$r_buff0_thd2~0_224)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_497, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_454, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_184, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_742, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_225, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_817} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_497, ~b~0=v_~b~0_69, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_454, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_183, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_741, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_29, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_29|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_224, ~x~0=v_~x~0_735, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_29, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_816} AuxVars[] AssignedVars[~b~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff0_thd2~0, ~x~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 06:28:48,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [587] $Ultimate##0-->L763: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd4~0_174 256) 0)))) (let ((.cse4 (and (not (= (mod v_~x$w_buff0_used~0_826 256) 0)) .cse14))) (let ((.cse7 (ite .cse4 0 v_~x$w_buff0_used~0_826))) (let ((.cse10 (not (= (mod .cse7 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd4~0_182 256) 0)))) (let ((.cse5 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_751 256) 0)))) (.cse6 (and .cse14 .cse10))) (let ((.cse12 (ite (or .cse5 .cse6) 0 v_~x$w_buff1_used~0_751))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_824 256) 0))) (.cse9 (not (= (mod .cse12 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_147 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd1~0_144 256) 0)))) (let ((.cse2 (and .cse10 .cse13)) (.cse3 (and .cse9 .cse0)) (.cse11 (and .cse1 .cse13))) (and (= (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_749 256))) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_143 256) 0)))) 0 v_~x$r_buff1_thd1~0_147) v_~x$r_buff1_thd1~0_146) (= |v_P0Thread1of1ForFork1_#in~arg.base_33| v_P0Thread1of1ForFork1_~arg.base_33) (= (ite .cse2 v_~x$w_buff0~0_501 (ite .cse3 v_~x$w_buff1~0_458 (ite .cse4 v_~x$w_buff0~0_501 (ite .cse5 v_~x$w_buff1~0_458 1)))) v_~x~0_743) (= v_P0Thread1of1ForFork1_~arg.offset_33 |v_P0Thread1of1ForFork1_#in~arg.offset_33|) (= v_~x$r_buff0_thd4~0_173 (ite .cse6 0 v_~x$r_buff0_thd4~0_174)) (= v_~x$w_buff0_used~0_824 (ite .cse2 0 .cse7)) (= v_~x$r_buff1_thd4~0_181 (ite (or (and .cse8 .cse9) (and .cse10 (not (= (mod v_~x$r_buff0_thd4~0_173 256) 0)))) 0 v_~x$r_buff1_thd4~0_182)) (= (ite (or .cse3 .cse11) 0 .cse12) v_~x$w_buff1_used~0_749) (= v_~x$r_buff0_thd1~0_143 (ite .cse11 0 v_~x$r_buff0_thd1~0_144)) (= v_~b~0_73 1)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_501, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_144, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_458, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_751, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_147, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_174, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_182, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_501, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, ~x$w_buff1~0=v_~x$w_buff1~0_458, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_749, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_173, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_181, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_824, ~b~0=v_~b~0_73, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_33, ~x~0=v_~x~0_743} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~b~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] and [528] $Ultimate##0-->L783: Formula: (and (= v_~x$r_buff0_thd2~0_98 1) (= v_~x$r_buff0_thd0~0_221 v_~x$r_buff1_thd0~0_218) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| 0)) (= |v_P1Thread1of1ForFork3_#in~arg#1.offset_7| |v_P1Thread1of1ForFork3_~arg#1.offset_7|) (= v_~x$w_buff0_used~0_392 v_~x$w_buff1_used~0_341) (= v_~x$r_buff1_thd1~0_73 v_~x$r_buff0_thd1~0_73) (= v_~x$w_buff0~0_243 v_~x$w_buff1~0_216) (= v_~x$w_buff0_used~0_391 1) (= 2 v_~x$w_buff0~0_242) (= v_~x$r_buff1_thd2~0_81 v_~x$r_buff0_thd2~0_99) (= |v_P1Thread1of1ForFork3_~arg#1.base_7| |v_P1Thread1of1ForFork3_#in~arg#1.base_7|) (= v_~x$r_buff1_thd4~0_75 v_~x$r_buff0_thd4~0_67) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_391 256) 0)) (not (= (mod v_~x$w_buff1_used~0_341 256) 0)))) 1 0)) (= v_~x$r_buff1_thd3~0_77 v_~x$r_buff0_thd3~0_69) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_243, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_99, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_392} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_242, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_221, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ~x$w_buff1~0=v_~x$w_buff1~0_216, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_77, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_81, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_341, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_73, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_67, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_69, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_98, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_218, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_27|, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_7|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_391, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_27|, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_7|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P1Thread1of1ForFork3_~arg#1.offset] [2022-12-06 06:28:48,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L829-->L832: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [596] $Ultimate##0-->L783: Formula: (let ((.cse6 (not (= (mod v_~x$r_buff0_thd4~0_184 256) 0)))) (let ((.cse3 (and (not (= (mod v_~x$w_buff0_used~0_862 256) 0)) .cse6))) (let ((.cse8 (ite .cse3 0 v_~x$w_buff0_used~0_862))) (let ((.cse5 (not (= (mod v_~x$r_buff0_thd1~0_156 256) 0))) (.cse7 (not (= (mod .cse8 256) 0)))) (let ((.cse0 (and .cse5 .cse7))) (let ((.cse4 (ite .cse0 0 .cse8)) (.cse2 (and .cse6 .cse7))) (and (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_57|) (= v_~x$r_buff0_thd0~0_374 v_~x$r_buff1_thd0~0_373) (= v_~x$r_buff0_thd1~0_155 v_~x$r_buff1_thd1~0_160) (= v_~x$r_buff0_thd3~0_187 v_~x$r_buff1_thd3~0_197) (= v_~x$r_buff0_thd2~0_246 1) (= (ite .cse0 v_~x$w_buff0~0_522 (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_787 256) 0)) (not (= (mod v_~x$r_buff1_thd4~0_193 256) 0))))) (ite (and (not (= (mod (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_787) 256) 0)) (not (= (mod v_~x$r_buff1_thd1~0_162 256) 0))) v_~x$w_buff1~0_479 (ite .cse3 v_~x$w_buff0~0_522 (ite .cse1 v_~x$w_buff1~0_479 1))))) v_~x~0_765) (= |v_P1Thread1of1ForFork3_#in~arg#1.base_37| |v_P1Thread1of1ForFork3_~arg#1.base_37|) (= .cse4 v_~x$w_buff1_used~0_785) (= v_~b~0_81 1) (= 2 v_~x$w_buff0~0_521) (not (= |v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_57| 0)) (= |v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_57| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_860 256) 0)) (not (= (mod v_~x$w_buff1_used~0_785 256) 0)))) 1 0)) (= (ite (and .cse5 (not (= (mod .cse4 256) 0))) 0 v_~x$r_buff0_thd1~0_156) v_~x$r_buff0_thd1~0_155) (= v_~x$r_buff0_thd4~0_183 v_~x$r_buff1_thd4~0_191) (= v_P0Thread1of1ForFork1_~arg.offset_41 |v_P0Thread1of1ForFork1_#in~arg.offset_41|) (= v_~x$r_buff0_thd4~0_183 (ite .cse2 0 v_~x$r_buff0_thd4~0_184)) (= v_~x$w_buff0~0_522 v_~x$w_buff1~0_478) (= v_~x$w_buff0_used~0_860 1) (= |v_P1Thread1of1ForFork3_~arg#1.offset_37| |v_P1Thread1of1ForFork3_#in~arg#1.offset_37|) (= v_~x$r_buff0_thd2~0_247 v_~x$r_buff1_thd2~0_201) (= |v_P0Thread1of1ForFork1_#in~arg.base_41| v_P0Thread1of1ForFork1_~arg.base_41)))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_522, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_479, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_787, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_162, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_187, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_41|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_247, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_37|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_193, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_862, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_41|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_37|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_521, P1Thread1of1ForFork3_~arg#1.base=|v_P1Thread1of1ForFork3_~arg#1.base_37|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_155, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_197, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_160, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_187, P1Thread1of1ForFork3_#in~arg#1.base=|v_P1Thread1of1ForFork3_#in~arg#1.base_37|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_41, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_41|, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_57|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_41, P1Thread1of1ForFork3_~arg#1.offset=|v_P1Thread1of1ForFork3_~arg#1.offset_37|, P1Thread1of1ForFork3_#in~arg#1.offset=|v_P1Thread1of1ForFork3_#in~arg#1.offset_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ~x$w_buff1~0=v_~x$w_buff1~0_478, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_201, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_785, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_183, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_41|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_246, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_373, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork3___VERIFIER_assert_~expression#1_57|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_191, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_860, ~b~0=v_~b~0_81, ~x~0=v_~x~0_765} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork3_~arg#1.base, ~x$r_buff0_thd1~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd4~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork3___VERIFIER_assert_~expression#1, P0Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0, ~b~0, P1Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, P0Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork3_~arg#1.offset, ~x~0] [2022-12-06 06:28:48,627 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L829-->L832: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [587] $Ultimate##0-->L763: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd4~0_174 256) 0)))) (let ((.cse4 (and (not (= (mod v_~x$w_buff0_used~0_826 256) 0)) .cse14))) (let ((.cse7 (ite .cse4 0 v_~x$w_buff0_used~0_826))) (let ((.cse10 (not (= (mod .cse7 256) 0))) (.cse8 (not (= (mod v_~x$r_buff1_thd4~0_182 256) 0)))) (let ((.cse5 (and .cse8 (not (= (mod v_~x$w_buff1_used~0_751 256) 0)))) (.cse6 (and .cse14 .cse10))) (let ((.cse12 (ite (or .cse5 .cse6) 0 v_~x$w_buff1_used~0_751))) (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_824 256) 0))) (.cse9 (not (= (mod .cse12 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd1~0_147 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd1~0_144 256) 0)))) (let ((.cse2 (and .cse10 .cse13)) (.cse3 (and .cse9 .cse0)) (.cse11 (and .cse1 .cse13))) (and (= (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_749 256))) .cse0) (and .cse1 (not (= (mod v_~x$r_buff0_thd1~0_143 256) 0)))) 0 v_~x$r_buff1_thd1~0_147) v_~x$r_buff1_thd1~0_146) (= |v_P0Thread1of1ForFork1_#in~arg.base_33| v_P0Thread1of1ForFork1_~arg.base_33) (= (ite .cse2 v_~x$w_buff0~0_501 (ite .cse3 v_~x$w_buff1~0_458 (ite .cse4 v_~x$w_buff0~0_501 (ite .cse5 v_~x$w_buff1~0_458 1)))) v_~x~0_743) (= v_P0Thread1of1ForFork1_~arg.offset_33 |v_P0Thread1of1ForFork1_#in~arg.offset_33|) (= v_~x$r_buff0_thd4~0_173 (ite .cse6 0 v_~x$r_buff0_thd4~0_174)) (= v_~x$w_buff0_used~0_824 (ite .cse2 0 .cse7)) (= v_~x$r_buff1_thd4~0_181 (ite (or (and .cse8 .cse9) (and .cse10 (not (= (mod v_~x$r_buff0_thd4~0_173 256) 0)))) 0 v_~x$r_buff1_thd4~0_182)) (= (ite (or .cse3 .cse11) 0 .cse12) v_~x$w_buff1_used~0_749) (= v_~x$r_buff0_thd1~0_143 (ite .cse11 0 v_~x$r_buff0_thd1~0_144)) (= v_~b~0_73 1)))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_501, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_144, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_458, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_751, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_147, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_174, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_182, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_826} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_501, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_143, ~x$w_buff1~0=v_~x$w_buff1~0_458, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_749, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_173, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_181, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_824, ~b~0=v_~b~0_73, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_33, ~x~0=v_~x~0_743} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~b~0, ~x$w_buff1_used~0, P0Thread1of1ForFork1_~arg.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0] [2022-12-06 06:28:48,784 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:28:48,785 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2298 [2022-12-06 06:28:48,785 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 566 flow [2022-12-06 06:28:48,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-06 06:28:48,785 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:28:48,785 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:28:48,786 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:28:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:28:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 658208935, now seen corresponding path program 1 times [2022-12-06 06:28:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:28:48,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374484391] [2022-12-06 06:28:48,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:28:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:28:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:28:48,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:28:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:28:48,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:28:48,929 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:28:48,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:28:48,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:28:48,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:28:48,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:28:48,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:28:48,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:28:48,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:28:48,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:28:48,934 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:28:48,939 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:28:48,939 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:28:49,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:28:49 BasicIcfg [2022-12-06 06:28:49,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:28:49,049 INFO L158 Benchmark]: Toolchain (without parser) took 41983.77ms. Allocated memory was 188.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 154.1MB in the beginning and 696.5MB in the end (delta: -542.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 06:28:49,049 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory was 166.0MB in the beginning and 166.0MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:28:49,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.58ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 125.8MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:28:49,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.74ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 123.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:28:49,050 INFO L158 Benchmark]: Boogie Preprocessor took 56.44ms. Allocated memory is still 188.7MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:28:49,050 INFO L158 Benchmark]: RCFGBuilder took 750.88ms. Allocated memory is still 188.7MB. Free memory was 121.1MB in the beginning and 82.3MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 06:28:49,050 INFO L158 Benchmark]: TraceAbstraction took 40540.65ms. Allocated memory was 188.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 81.8MB in the beginning and 696.5MB in the end (delta: -614.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 06:28:49,052 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.15ms. Allocated memory is still 188.7MB. Free memory was 166.0MB in the beginning and 166.0MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 564.58ms. Allocated memory is still 188.7MB. Free memory was 154.1MB in the beginning and 125.8MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.74ms. Allocated memory is still 188.7MB. Free memory was 125.8MB in the beginning and 123.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.44ms. Allocated memory is still 188.7MB. Free memory was 123.2MB in the beginning and 121.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 750.88ms. Allocated memory is still 188.7MB. Free memory was 121.1MB in the beginning and 82.3MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 40540.65ms. Allocated memory was 188.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 81.8MB in the beginning and 696.5MB in the end (delta: -614.7MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 139 PlacesBefore, 47 PlacesAfterwards, 128 TransitionsBefore, 35 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 53 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 2557, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2630, independent: 2557, independent conditional: 0, independent unconditional: 2557, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2145, independent: 2087, independent conditional: 0, independent unconditional: 2087, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2145, independent: 2049, independent conditional: 0, independent unconditional: 2049, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 426, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2630, independent: 470, independent conditional: 0, independent unconditional: 470, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 2145, unknown conditional: 0, unknown unconditional: 2145] , Statistics on independence cache: Total cache size (in pairs): 3094, Positive cache size: 3036, Positive conditional cache size: 0, Positive unconditional cache size: 3036, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 388, independent: 331, independent conditional: 331, independent unconditional: 0, dependent: 57, dependent conditional: 57, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 388, independent: 331, independent conditional: 28, independent unconditional: 303, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 388, independent: 331, independent conditional: 28, independent unconditional: 303, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 331, independent conditional: 28, independent unconditional: 303, dependent: 57, dependent conditional: 6, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 184, independent: 161, independent conditional: 14, independent unconditional: 147, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 184, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 23, dependent conditional: 2, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 170, independent conditional: 14, independent unconditional: 156, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 184, unknown conditional: 16, unknown unconditional: 168] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 162, Positive conditional cache size: 14, Positive unconditional cache size: 148, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, 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, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 137, independent conditional: 137, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 163, independent: 137, independent conditional: 4, independent unconditional: 133, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 15, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 175, Positive conditional cache size: 14, Positive unconditional cache size: 161, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 168, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 168, independent: 144, independent conditional: 14, independent unconditional: 130, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 168, independent: 144, independent conditional: 8, independent unconditional: 136, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 168, independent: 144, independent conditional: 8, independent unconditional: 136, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 168, independent: 144, independent conditional: 8, independent unconditional: 136, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 175, Positive conditional cache size: 14, Positive unconditional cache size: 161, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 224, independent: 200, independent conditional: 200, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 224, independent: 200, independent conditional: 59, independent unconditional: 141, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 200, independent conditional: 41, independent unconditional: 159, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 200, independent conditional: 41, independent unconditional: 159, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 224, independent: 187, independent conditional: 39, independent unconditional: 148, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 17, unknown conditional: 2, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 188, Positive conditional cache size: 16, Positive unconditional cache size: 172, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 412, independent: 382, independent conditional: 382, 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: 412, independent: 382, independent conditional: 119, independent unconditional: 263, 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: 412, independent: 382, independent conditional: 91, independent unconditional: 291, 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: 412, independent: 382, independent conditional: 91, independent unconditional: 291, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 412, independent: 371, independent conditional: 91, independent unconditional: 280, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 199, Positive conditional cache size: 16, Positive unconditional cache size: 183, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 555, independent: 511, independent conditional: 511, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 555, independent: 511, independent conditional: 232, independent unconditional: 279, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 555, independent: 511, independent conditional: 194, independent unconditional: 317, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 555, independent: 511, independent conditional: 194, independent unconditional: 317, dependent: 44, dependent conditional: 0, dependent unconditional: 44, 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: 555, independent: 511, independent conditional: 194, independent unconditional: 317, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 199, Positive conditional cache size: 16, Positive unconditional cache size: 183, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, 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, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 830 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 521, independent: 474, independent conditional: 474, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 521, independent: 474, independent conditional: 158, independent unconditional: 316, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 521, independent: 474, independent conditional: 126, independent unconditional: 348, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 521, independent: 474, independent conditional: 126, independent unconditional: 348, dependent: 47, dependent conditional: 0, dependent unconditional: 47, 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: 521, independent: 474, independent conditional: 126, independent unconditional: 348, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 199, Positive conditional cache size: 16, Positive unconditional cache size: 183, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, 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, 60 PlacesBefore, 60 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 591, independent: 540, independent conditional: 540, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 591, independent: 540, independent conditional: 197, independent unconditional: 343, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 591, independent: 540, independent conditional: 162, independent unconditional: 378, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 591, independent: 540, independent conditional: 162, independent unconditional: 378, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 591, independent: 540, independent conditional: 162, independent unconditional: 378, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 199, Positive conditional cache size: 16, Positive unconditional cache size: 183, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 775, independent: 713, independent conditional: 713, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 775, independent: 713, independent conditional: 345, independent unconditional: 368, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 775, independent: 713, independent conditional: 316, independent unconditional: 397, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 775, independent: 713, independent conditional: 316, independent unconditional: 397, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 775, independent: 707, independent conditional: 312, independent unconditional: 395, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 205, Positive conditional cache size: 20, Positive unconditional cache size: 185, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, 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.1s, 67 PlacesBefore, 66 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1090, independent: 1012, independent conditional: 1012, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1090, independent: 1012, independent conditional: 628, independent unconditional: 384, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1090, independent: 1012, independent conditional: 570, independent unconditional: 442, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1090, independent: 1012, independent conditional: 570, independent unconditional: 442, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 1090, independent: 1000, independent conditional: 558, independent unconditional: 442, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 225, Positive conditional cache size: 32, Positive unconditional cache size: 193, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 506, independent: 469, independent conditional: 469, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 506, independent: 469, independent conditional: 267, independent unconditional: 202, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 506, independent: 469, independent conditional: 246, independent unconditional: 223, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 506, independent: 469, independent conditional: 246, independent unconditional: 223, dependent: 37, dependent conditional: 0, dependent unconditional: 37, 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: 506, independent: 469, independent conditional: 246, independent unconditional: 223, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 225, Positive conditional cache size: 32, Positive unconditional cache size: 193, Negative cache size: 35, Negative conditional cache size: 8, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 79 PlacesBefore, 79 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1124, independent: 1047, independent conditional: 1047, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1124, independent: 1047, independent conditional: 689, independent unconditional: 358, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1124, independent: 1047, independent conditional: 624, independent unconditional: 423, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1124, independent: 1047, independent conditional: 624, independent unconditional: 423, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 16, independent conditional: 13, independent unconditional: 3, 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: 17, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 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] ], Cache Queries: [ total: 1124, independent: 1031, independent conditional: 611, independent unconditional: 420, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 17, unknown conditional: 13, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 247, Positive conditional cache size: 45, Positive unconditional cache size: 202, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 65, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 80 PlacesBefore, 80 PlacesAfterwards, 128 TransitionsBefore, 128 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 98, independent conditional: 60, independent unconditional: 38, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 98, independent conditional: 46, independent unconditional: 52, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 98, independent conditional: 46, independent unconditional: 52, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 87, independent conditional: 44, independent unconditional: 43, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 11, unknown conditional: 2, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 278, Positive conditional cache size: 47, Positive unconditional cache size: 231, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 81 PlacesBefore, 78 PlacesAfterwards, 125 TransitionsBefore, 122 TransitionsAfterwards, 1114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 804, independent: 776, independent conditional: 776, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 804, independent: 776, independent conditional: 748, independent unconditional: 28, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 804, independent: 776, independent conditional: 482, independent unconditional: 294, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 804, independent: 776, independent conditional: 482, independent unconditional: 294, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 804, independent: 773, independent conditional: 479, independent unconditional: 294, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 506, Positive conditional cache size: 50, Positive unconditional cache size: 456, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 266, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 71 PlacesBefore, 70 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 656 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 214, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 214, independent: 208, independent conditional: 154, independent unconditional: 54, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 208, independent conditional: 149, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 208, independent conditional: 149, independent unconditional: 59, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 6, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 214, independent: 199, independent conditional: 143, independent unconditional: 56, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 680, Positive conditional cache size: 69, Positive unconditional cache size: 611, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 71 PlacesBefore, 69 PlacesAfterwards, 48 TransitionsBefore, 49 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 132, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 100, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 132, independent: 132, independent conditional: 69, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132, independent: 132, independent conditional: 69, independent unconditional: 63, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 22, independent unconditional: 9, 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: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 132, independent: 101, independent conditional: 47, independent unconditional: 54, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 31, unknown conditional: 22, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 890, Positive cache size: 854, Positive conditional cache size: 93, Positive unconditional cache size: 761, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-2, t1185={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-1, t1185={5:0}, t1186={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=1, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 [L805] 3 z = 1 [L822] 3 z = 2 [L825] 3 a = 1 [L828] 3 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 863]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 656 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1647 IncrementalHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 26 mSDtfsCounter, 1647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1419occurred in iteration=13, InterpolantAutomatonStates: 79, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 2212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-06 06:28:49,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...