/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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:56:45,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:56:45,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:56:45,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:56:45,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:56:45,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:56:45,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:56:45,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:56:45,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:56:45,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:56:45,279 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:56:45,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:56:45,281 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:56:45,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:56:45,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:56:45,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:56:45,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:56:45,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:56:45,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:56:45,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:56:45,294 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:56:45,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:56:45,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:56:45,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:56:45,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:56:45,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:56:45,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:56:45,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:56:45,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:56:45,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:56:45,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:56:45,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:56:45,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:56:45,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:56:45,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:56:45,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:56:45,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:56:45,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:56:45,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:56:45,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:56:45,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:56:45,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 11:56:45,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:56:45,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:56:45,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:56:45,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:56:45,337 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:56:45,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:56:45,338 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:56:45,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:56:45,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:56:45,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:56:45,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:56:45,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:56:45,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:56:45,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:56:45,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 11:56:45,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:56:45,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:56:45,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:56:45,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:56:45,642 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:56:45,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 11:56:46,590 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:56:46,844 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:56:46,844 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 11:56:46,876 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1c82225/181b059491ac418bbd6400341da52240/FLAG260a7d4df [2022-12-13 11:56:46,888 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b1c82225/181b059491ac418bbd6400341da52240 [2022-12-13 11:56:46,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:56:46,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:56:46,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:56:46,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:56:46,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:56:46,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e358056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:46, skipping insertion in model container [2022-12-13 11:56:46,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:56:46" (1/1) ... [2022-12-13 11:56:46,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:56:46,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:56:47,076 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 11:56:47,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:56:47,278 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:56:47,287 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/mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-13 11:56:47,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:56:47,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:56:47,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:56:47,341 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:56:47,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47 WrapperNode [2022-12-13 11:56:47,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:56:47,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:56:47,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:56:47,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:56:47,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,388 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 11:56:47,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:56:47,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:56:47,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:56:47,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:56:47,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,418 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:56:47,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:56:47,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:56:47,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:56:47,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (1/1) ... [2022-12-13 11:56:47,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:56:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:56:47,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:56:47,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:56:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:56:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:56:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:56:47,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:56:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:56:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:56:47,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:56:47,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:56:47,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:56:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:56:47,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:56:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:56:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:56:47,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:56:47,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:56:47,498 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:56:47,587 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:56:47,588 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:56:47,777 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:56:47,880 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:56:47,880 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:56:47,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:56:47 BoogieIcfgContainer [2022-12-13 11:56:47,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:56:47,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:56:47,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:56:47,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:56:47,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:56:46" (1/3) ... [2022-12-13 11:56:47,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7b0879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:56:47, skipping insertion in model container [2022-12-13 11:56:47,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:56:47" (2/3) ... [2022-12-13 11:56:47,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7b0879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:56:47, skipping insertion in model container [2022-12-13 11:56:47,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:56:47" (3/3) ... [2022-12-13 11:56:47,888 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-13 11:56:47,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:56:47,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:56:47,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:56:47,941 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:56:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 11:56:47,996 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 11:56:47,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:48,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 11:56:48,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-13 11:56:48,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:48,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:48,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:48,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:48,037 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-13 11:56:48,038 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:48,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 11:56:48,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-13 11:56:48,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-13 11:56:54,472 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 11:56:54,484 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:56:54,488 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;@43237907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:56:54,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:56:54,492 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 11:56:54,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:54,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:54,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:54,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:54,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1323519518, now seen corresponding path program 1 times [2022-12-13 11:56:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:54,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064592112] [2022-12-13 11:56:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:54,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:54,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064592112] [2022-12-13 11:56:54,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064592112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:54,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:54,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:56:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66381427] [2022-12-13 11:56:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:54,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:54,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:54,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:54,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-13 11:56:54,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:54,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:54,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-13 11:56:54,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:56,016 INFO L130 PetriNetUnfolder]: 6079/9809 cut-off events. [2022-12-13 11:56:56,016 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 11:56:56,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 9809 events. 6079/9809 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 73377 event pairs, 855 based on Foata normal form. 0/5894 useless extension candidates. Maximal degree in co-relation 18581. Up to 7305 conditions per place. [2022-12-13 11:56:56,045 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-13 11:56:56,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-13 11:56:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-12-13 11:56:56,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-13 11:56:56,056 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 121 flow. Second operand 3 states and 111 transitions. [2022-12-13 11:56:56,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 325 flow [2022-12-13 11:56:56,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:56:56,062 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 70 flow [2022-12-13 11:56:56,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2022-12-13 11:56:56,066 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2022-12-13 11:56:56,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:56,067 INFO L89 Accepts]: Start accepts. Operand has 61 places, 30 transitions, 70 flow [2022-12-13 11:56:56,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:56,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:56,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 30 transitions, 70 flow [2022-12-13 11:56:56,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 11:56:56,075 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 11:56:56,075 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:56,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 69 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:56:56,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 11:56:56,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 11:56:56,136 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:56,137 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 11:56:56,137 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 11:56:56,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:56,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:56,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:56,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:56:56,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 592008445, now seen corresponding path program 1 times [2022-12-13 11:56:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:56,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723715327] [2022-12-13 11:56:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:56,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:56,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723715327] [2022-12-13 11:56:56,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723715327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:56,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:56,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:56:56,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60224942] [2022-12-13 11:56:56,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:56,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:56:56,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:56:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:56:56,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 11:56:56,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:56,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:56,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 11:56:56,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:56,625 INFO L130 PetriNetUnfolder]: 1136/1857 cut-off events. [2022-12-13 11:56:56,625 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2022-12-13 11:56:56,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1857 events. 1136/1857 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9564 event pairs, 559 based on Foata normal form. 10/1544 useless extension candidates. Maximal degree in co-relation 3698. Up to 1615 conditions per place. [2022-12-13 11:56:56,634 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-13 11:56:56,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 170 flow [2022-12-13 11:56:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:56:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:56:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 11:56:56,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-13 11:56:56,637 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 62 transitions. [2022-12-13 11:56:56,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 170 flow [2022-12-13 11:56:56,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:56,639 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 85 flow [2022-12-13 11:56:56,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-13 11:56:56,640 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -25 predicate places. [2022-12-13 11:56:56,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:56,640 INFO L89 Accepts]: Start accepts. Operand has 40 places, 32 transitions, 85 flow [2022-12-13 11:56:56,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:56,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:56,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 85 flow [2022-12-13 11:56:56,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 85 flow [2022-12-13 11:56:56,646 INFO L130 PetriNetUnfolder]: 3/46 cut-off events. [2022-12-13 11:56:56,647 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:56:56,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 46 events. 3/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2022-12-13 11:56:56,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 85 flow [2022-12-13 11:56:56,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 544 [2022-12-13 11:56:56,662 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:56,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 11:56:56,664 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 85 flow [2022-12-13 11:56:56,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:56,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:56,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:56,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:56:56,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1172391830, now seen corresponding path program 1 times [2022-12-13 11:56:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:56,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933276687] [2022-12-13 11:56:56,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:56,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:57,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933276687] [2022-12-13 11:56:57,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933276687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:57,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:57,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176085026] [2022-12-13 11:56:57,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:57,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:57,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:57,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 11:56:57,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:57,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:57,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 11:56:57,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:57,315 INFO L130 PetriNetUnfolder]: 1257/2054 cut-off events. [2022-12-13 11:56:57,316 INFO L131 PetriNetUnfolder]: For 137/138 co-relation queries the response was YES. [2022-12-13 11:56:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 2054 events. 1257/2054 cut-off events. For 137/138 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10545 event pairs, 523 based on Foata normal form. 8/1704 useless extension candidates. Maximal degree in co-relation 4274. Up to 1760 conditions per place. [2022-12-13 11:56:57,325 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 34 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2022-12-13 11:56:57,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 213 flow [2022-12-13 11:56:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 11:56:57,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-13 11:56:57,326 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 85 flow. Second operand 4 states and 74 transitions. [2022-12-13 11:56:57,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 213 flow [2022-12-13 11:56:57,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:57,328 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 119 flow [2022-12-13 11:56:57,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2022-12-13 11:56:57,328 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -21 predicate places. [2022-12-13 11:56:57,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:57,329 INFO L89 Accepts]: Start accepts. Operand has 44 places, 37 transitions, 119 flow [2022-12-13 11:56:57,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:57,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:57,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 119 flow [2022-12-13 11:56:57,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 119 flow [2022-12-13 11:56:57,336 INFO L130 PetriNetUnfolder]: 11/96 cut-off events. [2022-12-13 11:56:57,336 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 11:56:57,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 96 events. 11/96 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 440 event pairs, 1 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2022-12-13 11:56:57,338 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 119 flow [2022-12-13 11:56:57,338 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 11:56:57,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [208] L823-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_54 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_111 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_58 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_112 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_76)) v_~y~0_75) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_57 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_54) v_~y$r_buff1_thd0~0_53) (= (ite .cse0 0 v_~y$w_buff0_used~0_112) v_~y$w_buff0_used~0_111) (= (ite .cse4 0 v_~y$r_buff0_thd0~0_58) v_~y$r_buff0_thd0~0_57) (= v_~y$w_buff1_used~0_102 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_103))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_58, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_76, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_57, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_75, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [374] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 11:56:57,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [208] L823-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_54 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_111 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_58 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_112 256) 0)))) (.cse4 (and .cse5 .cse2)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_103 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_76)) v_~y~0_75) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd0~0_57 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_102 256) 0)) .cse3)) 0 v_~y$r_buff1_thd0~0_54) v_~y$r_buff1_thd0~0_53) (= (ite .cse0 0 v_~y$w_buff0_used~0_112) v_~y$w_buff0_used~0_111) (= (ite .cse4 0 v_~y$r_buff0_thd0~0_58) v_~y$r_buff0_thd0~0_57) (= v_~y$w_buff1_used~0_102 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_103))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_112, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_58, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_76, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_57, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_75, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-13 11:56:57,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:56:57,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 11:56:57,626 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 121 flow [2022-12-13 11:56:57,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:57,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:57,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:56:57,626 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:57,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:57,627 INFO L85 PathProgramCache]: Analyzing trace with hash 35430440, now seen corresponding path program 1 times [2022-12-13 11:56:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:57,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512437471] [2022-12-13 11:56:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:57,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512437471] [2022-12-13 11:56:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512437471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:57,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:57,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568681279] [2022-12-13 11:56:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:57,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:56:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:56:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:56:57,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 11:56:57,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:57,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:57,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 11:56:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:58,082 INFO L130 PetriNetUnfolder]: 1193/2019 cut-off events. [2022-12-13 11:56:58,082 INFO L131 PetriNetUnfolder]: For 734/735 co-relation queries the response was YES. [2022-12-13 11:56:58,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 2019 events. 1193/2019 cut-off events. For 734/735 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10923 event pairs, 254 based on Foata normal form. 25/1696 useless extension candidates. Maximal degree in co-relation 4615. Up to 1458 conditions per place. [2022-12-13 11:56:58,091 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2022-12-13 11:56:58,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 261 flow [2022-12-13 11:56:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 11:56:58,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 11:56:58,094 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 121 flow. Second operand 4 states and 80 transitions. [2022-12-13 11:56:58,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 261 flow [2022-12-13 11:56:58,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 255 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:58,097 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 164 flow [2022-12-13 11:56:58,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-12-13 11:56:58,099 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -18 predicate places. [2022-12-13 11:56:58,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:58,099 INFO L89 Accepts]: Start accepts. Operand has 47 places, 39 transitions, 164 flow [2022-12-13 11:56:58,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:58,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:58,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 39 transitions, 164 flow [2022-12-13 11:56:58,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 164 flow [2022-12-13 11:56:58,111 INFO L130 PetriNetUnfolder]: 23/119 cut-off events. [2022-12-13 11:56:58,111 INFO L131 PetriNetUnfolder]: For 43/51 co-relation queries the response was YES. [2022-12-13 11:56:58,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 119 events. 23/119 cut-off events. For 43/51 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 570 event pairs, 1 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 237. Up to 29 conditions per place. [2022-12-13 11:56:58,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 164 flow [2022-12-13 11:56:58,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 648 [2022-12-13 11:56:58,129 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:58,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 11:56:58,134 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 164 flow [2022-12-13 11:56:58,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:58,134 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:58,134 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:58,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:56:58,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:58,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 416789615, now seen corresponding path program 1 times [2022-12-13 11:56:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:58,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386961939] [2022-12-13 11:56:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:58,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:58,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386961939] [2022-12-13 11:56:58,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386961939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:58,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:58,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:56:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660266485] [2022-12-13 11:56:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:58,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:56:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:58,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:56:58,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:56:58,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 11:56:58,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:58,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:58,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 11:56:58,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:58,622 INFO L130 PetriNetUnfolder]: 1219/2059 cut-off events. [2022-12-13 11:56:58,622 INFO L131 PetriNetUnfolder]: For 1445/1446 co-relation queries the response was YES. [2022-12-13 11:56:58,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5325 conditions, 2059 events. 1219/2059 cut-off events. For 1445/1446 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11158 event pairs, 278 based on Foata normal form. 8/1717 useless extension candidates. Maximal degree in co-relation 5308. Up to 1662 conditions per place. [2022-12-13 11:56:58,634 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2022-12-13 11:56:58,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 306 flow [2022-12-13 11:56:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:56:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:56:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-12-13 11:56:58,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6015625 [2022-12-13 11:56:58,635 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 164 flow. Second operand 4 states and 77 transitions. [2022-12-13 11:56:58,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 306 flow [2022-12-13 11:56:58,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 297 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 11:56:58,638 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 196 flow [2022-12-13 11:56:58,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 11:56:58,638 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -15 predicate places. [2022-12-13 11:56:58,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:58,638 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 196 flow [2022-12-13 11:56:58,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:58,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:58,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 196 flow [2022-12-13 11:56:58,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 196 flow [2022-12-13 11:56:58,662 INFO L130 PetriNetUnfolder]: 51/164 cut-off events. [2022-12-13 11:56:58,662 INFO L131 PetriNetUnfolder]: For 160/170 co-relation queries the response was YES. [2022-12-13 11:56:58,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 164 events. 51/164 cut-off events. For 160/170 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 820 event pairs, 6 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 385. Up to 56 conditions per place. [2022-12-13 11:56:58,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 196 flow [2022-12-13 11:56:58,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-13 11:56:58,671 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:58,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-13 11:56:58,672 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 196 flow [2022-12-13 11:56:58,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:58,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:58,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:58,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:56:58,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash 35484256, now seen corresponding path program 1 times [2022-12-13 11:56:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747844262] [2022-12-13 11:56:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:59,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747844262] [2022-12-13 11:56:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747844262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:59,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799205029] [2022-12-13 11:56:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:56:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:59,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:56:59,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:56:59,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 11:56:59,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:59,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:59,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 11:56:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:59,441 INFO L130 PetriNetUnfolder]: 1231/2083 cut-off events. [2022-12-13 11:56:59,441 INFO L131 PetriNetUnfolder]: For 2425/2426 co-relation queries the response was YES. [2022-12-13 11:56:59,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5805 conditions, 2083 events. 1231/2083 cut-off events. For 2425/2426 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11386 event pairs, 273 based on Foata normal form. 13/1745 useless extension candidates. Maximal degree in co-relation 5786. Up to 1560 conditions per place. [2022-12-13 11:56:59,457 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 46 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2022-12-13 11:56:59,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 402 flow [2022-12-13 11:56:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:56:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:56:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-13 11:56:59,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6125 [2022-12-13 11:56:59,459 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 196 flow. Second operand 5 states and 98 transitions. [2022-12-13 11:56:59,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 402 flow [2022-12-13 11:56:59,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 385 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 11:56:59,463 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 236 flow [2022-12-13 11:56:59,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=236, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-13 11:56:59,465 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -12 predicate places. [2022-12-13 11:56:59,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:56:59,465 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 236 flow [2022-12-13 11:56:59,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:56:59,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:56:59,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 236 flow [2022-12-13 11:56:59,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 236 flow [2022-12-13 11:56:59,480 INFO L130 PetriNetUnfolder]: 55/171 cut-off events. [2022-12-13 11:56:59,480 INFO L131 PetriNetUnfolder]: For 217/228 co-relation queries the response was YES. [2022-12-13 11:56:59,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 171 events. 55/171 cut-off events. For 217/228 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 840 event pairs, 3 based on Foata normal form. 2/133 useless extension candidates. Maximal degree in co-relation 467. Up to 61 conditions per place. [2022-12-13 11:56:59,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 236 flow [2022-12-13 11:56:59,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 11:56:59,486 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:56:59,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 11:56:59,487 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 236 flow [2022-12-13 11:56:59,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:59,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:56:59,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:56:59,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:56:59,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:56:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:56:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash 35575892, now seen corresponding path program 1 times [2022-12-13 11:56:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:56:59,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516062861] [2022-12-13 11:56:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:56:59,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:56:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:56:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:56:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:56:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516062861] [2022-12-13 11:56:59,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516062861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:56:59,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:56:59,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:56:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113021176] [2022-12-13 11:56:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:56:59,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:56:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:56:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:56:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:56:59,726 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 11:56:59,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:56:59,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:56:59,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 11:56:59,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:56:59,994 INFO L130 PetriNetUnfolder]: 1368/2272 cut-off events. [2022-12-13 11:56:59,994 INFO L131 PetriNetUnfolder]: For 3583/3584 co-relation queries the response was YES. [2022-12-13 11:57:00,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 2272 events. 1368/2272 cut-off events. For 3583/3584 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12309 event pairs, 833 based on Foata normal form. 5/1883 useless extension candidates. Maximal degree in co-relation 6953. Up to 1770 conditions per place. [2022-12-13 11:57:00,013 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 40 selfloop transitions, 15 changer transitions 0/65 dead transitions. [2022-12-13 11:57:00,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 432 flow [2022-12-13 11:57:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 11:57:00,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.55625 [2022-12-13 11:57:00,015 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 236 flow. Second operand 5 states and 89 transitions. [2022-12-13 11:57:00,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 432 flow [2022-12-13 11:57:00,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:57:00,021 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 328 flow [2022-12-13 11:57:00,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-13 11:57:00,022 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -9 predicate places. [2022-12-13 11:57:00,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:00,022 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 328 flow [2022-12-13 11:57:00,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:00,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:00,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 328 flow [2022-12-13 11:57:00,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 328 flow [2022-12-13 11:57:00,056 INFO L130 PetriNetUnfolder]: 63/191 cut-off events. [2022-12-13 11:57:00,056 INFO L131 PetriNetUnfolder]: For 470/489 co-relation queries the response was YES. [2022-12-13 11:57:00,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 191 events. 63/191 cut-off events. For 470/489 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 983 event pairs, 3 based on Foata normal form. 3/154 useless extension candidates. Maximal degree in co-relation 656. Up to 77 conditions per place. [2022-12-13 11:57:00,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 328 flow [2022-12-13 11:57:00,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 11:57:00,060 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:00,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-13 11:57:00,060 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 328 flow [2022-12-13 11:57:00,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:00,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:00,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:00,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:57:00,061 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:00,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1098342394, now seen corresponding path program 1 times [2022-12-13 11:57:00,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:00,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208285183] [2022-12-13 11:57:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:00,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208285183] [2022-12-13 11:57:00,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208285183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:00,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:00,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289749705] [2022-12-13 11:57:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:00,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:57:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:57:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:57:00,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 11:57:00,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:00,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:00,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 11:57:00,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:00,612 INFO L130 PetriNetUnfolder]: 1362/2289 cut-off events. [2022-12-13 11:57:00,613 INFO L131 PetriNetUnfolder]: For 5768/5769 co-relation queries the response was YES. [2022-12-13 11:57:00,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7807 conditions, 2289 events. 1362/2289 cut-off events. For 5768/5769 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12617 event pairs, 243 based on Foata normal form. 5/1909 useless extension candidates. Maximal degree in co-relation 7785. Up to 1668 conditions per place. [2022-12-13 11:57:00,629 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 52 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2022-12-13 11:57:00,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 566 flow [2022-12-13 11:57:00,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 11:57:00,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 11:57:00,631 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 328 flow. Second operand 5 states and 94 transitions. [2022-12-13 11:57:00,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 566 flow [2022-12-13 11:57:00,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 547 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:00,638 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 418 flow [2022-12-13 11:57:00,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-13 11:57:00,639 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2022-12-13 11:57:00,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:00,639 INFO L89 Accepts]: Start accepts. Operand has 61 places, 58 transitions, 418 flow [2022-12-13 11:57:00,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:00,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:00,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 418 flow [2022-12-13 11:57:00,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 418 flow [2022-12-13 11:57:00,656 INFO L130 PetriNetUnfolder]: 60/188 cut-off events. [2022-12-13 11:57:00,656 INFO L131 PetriNetUnfolder]: For 624/646 co-relation queries the response was YES. [2022-12-13 11:57:00,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 188 events. 60/188 cut-off events. For 624/646 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 975 event pairs, 3 based on Foata normal form. 3/151 useless extension candidates. Maximal degree in co-relation 710. Up to 63 conditions per place. [2022-12-13 11:57:00,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 58 transitions, 418 flow [2022-12-13 11:57:00,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 938 [2022-12-13 11:57:00,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [319] L760-->L767: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_91 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_44 (ite .cse1 v_~y$w_buff1~0_33 v_~y~0_62)) v_~y~0_61) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_90 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23) (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$r_buff0_thd2~0_25 (ite .cse4 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff1_used~0_90 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_91))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:00,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:00,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 11:57:00,811 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 426 flow [2022-12-13 11:57:00,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:00,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:00,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:00,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:57:00,811 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1102798551, now seen corresponding path program 1 times [2022-12-13 11:57:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054436556] [2022-12-13 11:57:00,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:00,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:01,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054436556] [2022-12-13 11:57:01,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054436556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:01,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:01,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:01,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857037796] [2022-12-13 11:57:01,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:57:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:57:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:57:01,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2022-12-13 11:57:01,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:01,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:01,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2022-12-13 11:57:01,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:01,398 INFO L130 PetriNetUnfolder]: 1449/2421 cut-off events. [2022-12-13 11:57:01,398 INFO L131 PetriNetUnfolder]: For 8816/8817 co-relation queries the response was YES. [2022-12-13 11:57:01,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8902 conditions, 2421 events. 1449/2421 cut-off events. For 8816/8817 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 13654 event pairs, 238 based on Foata normal form. 15/2027 useless extension candidates. Maximal degree in co-relation 8877. Up to 1514 conditions per place. [2022-12-13 11:57:01,417 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 53 selfloop transitions, 22 changer transitions 0/85 dead transitions. [2022-12-13 11:57:01,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 680 flow [2022-12-13 11:57:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 11:57:01,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 11:57:01,418 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 426 flow. Second operand 5 states and 99 transitions. [2022-12-13 11:57:01,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 680 flow [2022-12-13 11:57:01,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 645 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:01,428 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 466 flow [2022-12-13 11:57:01,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-12-13 11:57:01,429 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2022-12-13 11:57:01,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:01,429 INFO L89 Accepts]: Start accepts. Operand has 65 places, 59 transitions, 466 flow [2022-12-13 11:57:01,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:01,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:01,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 59 transitions, 466 flow [2022-12-13 11:57:01,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 466 flow [2022-12-13 11:57:01,449 INFO L130 PetriNetUnfolder]: 64/220 cut-off events. [2022-12-13 11:57:01,449 INFO L131 PetriNetUnfolder]: For 834/859 co-relation queries the response was YES. [2022-12-13 11:57:01,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 220 events. 64/220 cut-off events. For 834/859 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1276 event pairs, 1 based on Foata normal form. 3/167 useless extension candidates. Maximal degree in co-relation 843. Up to 63 conditions per place. [2022-12-13 11:57:01,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 466 flow [2022-12-13 11:57:01,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 958 [2022-12-13 11:57:01,453 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:01,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 11:57:01,454 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 466 flow [2022-12-13 11:57:01,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:01,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:01,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:57:01,454 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -173746420, now seen corresponding path program 1 times [2022-12-13 11:57:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:01,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932413739] [2022-12-13 11:57:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:01,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932413739] [2022-12-13 11:57:01,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932413739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:01,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:01,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374450149] [2022-12-13 11:57:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:01,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:01,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:57:01,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:01,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:01,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:57:01,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:02,514 INFO L130 PetriNetUnfolder]: 4012/6543 cut-off events. [2022-12-13 11:57:02,515 INFO L131 PetriNetUnfolder]: For 29065/29065 co-relation queries the response was YES. [2022-12-13 11:57:02,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22665 conditions, 6543 events. 4012/6543 cut-off events. For 29065/29065 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 42799 event pairs, 628 based on Foata normal form. 150/5426 useless extension candidates. Maximal degree in co-relation 22638. Up to 1990 conditions per place. [2022-12-13 11:57:02,547 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 83 selfloop transitions, 66 changer transitions 0/156 dead transitions. [2022-12-13 11:57:02,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 156 transitions, 1392 flow [2022-12-13 11:57:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:57:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:57:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2022-12-13 11:57:02,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6320346320346321 [2022-12-13 11:57:02,548 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 466 flow. Second operand 7 states and 146 transitions. [2022-12-13 11:57:02,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 156 transitions, 1392 flow [2022-12-13 11:57:02,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 156 transitions, 1307 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 11:57:02,574 INFO L231 Difference]: Finished difference. Result has 71 places, 110 transitions, 1135 flow [2022-12-13 11:57:02,575 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1135, PETRI_PLACES=71, PETRI_TRANSITIONS=110} [2022-12-13 11:57:02,575 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 6 predicate places. [2022-12-13 11:57:02,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:02,576 INFO L89 Accepts]: Start accepts. Operand has 71 places, 110 transitions, 1135 flow [2022-12-13 11:57:02,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:02,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:02,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 110 transitions, 1135 flow [2022-12-13 11:57:02,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 110 transitions, 1135 flow [2022-12-13 11:57:02,625 INFO L130 PetriNetUnfolder]: 193/691 cut-off events. [2022-12-13 11:57:02,626 INFO L131 PetriNetUnfolder]: For 3051/3165 co-relation queries the response was YES. [2022-12-13 11:57:02,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2557 conditions, 691 events. 193/691 cut-off events. For 3051/3165 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5692 event pairs, 7 based on Foata normal form. 18/496 useless extension candidates. Maximal degree in co-relation 2530. Up to 132 conditions per place. [2022-12-13 11:57:02,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 110 transitions, 1135 flow [2022-12-13 11:57:02,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 1470 [2022-12-13 11:57:02,635 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:57:02,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 11:57:02,635 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 110 transitions, 1135 flow [2022-12-13 11:57:02,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:02,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:02,636 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:02,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:57:02,636 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1556391456, now seen corresponding path program 1 times [2022-12-13 11:57:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098186742] [2022-12-13 11:57:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098186742] [2022-12-13 11:57:02,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098186742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:02,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:02,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:57:02,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15189849] [2022-12-13 11:57:02,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:02,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:57:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:02,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:57:02,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:57:02,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 11:57:02,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 110 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:02,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:02,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 11:57:02,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:03,451 INFO L130 PetriNetUnfolder]: 4556/7276 cut-off events. [2022-12-13 11:57:03,451 INFO L131 PetriNetUnfolder]: For 49442/49965 co-relation queries the response was YES. [2022-12-13 11:57:03,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30227 conditions, 7276 events. 4556/7276 cut-off events. For 49442/49965 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 48980 event pairs, 1248 based on Foata normal form. 327/5026 useless extension candidates. Maximal degree in co-relation 30197. Up to 6811 conditions per place. [2022-12-13 11:57:03,493 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 116 selfloop transitions, 10 changer transitions 0/145 dead transitions. [2022-12-13 11:57:03,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 145 transitions, 1695 flow [2022-12-13 11:57:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:57:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:57:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 11:57:03,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6767676767676768 [2022-12-13 11:57:03,494 INFO L175 Difference]: Start difference. First operand has 71 places, 110 transitions, 1135 flow. Second operand 3 states and 67 transitions. [2022-12-13 11:57:03,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 145 transitions, 1695 flow [2022-12-13 11:57:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 145 transitions, 1639 flow, removed 28 selfloop flow, removed 0 redundant places. [2022-12-13 11:57:03,524 INFO L231 Difference]: Finished difference. Result has 74 places, 112 transitions, 1076 flow [2022-12-13 11:57:03,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1008, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=74, PETRI_TRANSITIONS=112} [2022-12-13 11:57:03,524 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2022-12-13 11:57:03,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:03,524 INFO L89 Accepts]: Start accepts. Operand has 74 places, 112 transitions, 1076 flow [2022-12-13 11:57:03,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:03,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:03,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 112 transitions, 1076 flow [2022-12-13 11:57:03,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 112 transitions, 1076 flow [2022-12-13 11:57:03,823 INFO L130 PetriNetUnfolder]: 2310/4247 cut-off events. [2022-12-13 11:57:03,823 INFO L131 PetriNetUnfolder]: For 10589/10846 co-relation queries the response was YES. [2022-12-13 11:57:03,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13718 conditions, 4247 events. 2310/4247 cut-off events. For 10589/10846 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 35675 event pairs, 786 based on Foata normal form. 40/2296 useless extension candidates. Maximal degree in co-relation 13688. Up to 3022 conditions per place. [2022-12-13 11:57:03,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 112 transitions, 1076 flow [2022-12-13 11:57:03,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 1392 [2022-12-13 11:57:05,178 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:05,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1654 [2022-12-13 11:57:05,178 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 112 transitions, 1098 flow [2022-12-13 11:57:05,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:05,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:05,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:05,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:57:05,184 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 211242383, now seen corresponding path program 1 times [2022-12-13 11:57:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:05,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393860942] [2022-12-13 11:57:05,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:05,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:05,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393860942] [2022-12-13 11:57:05,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393860942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:05,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:05,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095015390] [2022-12-13 11:57:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:05,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2022-12-13 11:57:05,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 112 transitions, 1098 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 11:57:05,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:05,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2022-12-13 11:57:05,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:06,417 INFO L130 PetriNetUnfolder]: 6330/10349 cut-off events. [2022-12-13 11:57:06,418 INFO L131 PetriNetUnfolder]: For 48504/48815 co-relation queries the response was YES. [2022-12-13 11:57:06,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43774 conditions, 10349 events. 6330/10349 cut-off events. For 48504/48815 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 74088 event pairs, 1995 based on Foata normal form. 253/8418 useless extension candidates. Maximal degree in co-relation 43741. Up to 6474 conditions per place. [2022-12-13 11:57:06,470 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 97 selfloop transitions, 17 changer transitions 48/172 dead transitions. [2022-12-13 11:57:06,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 172 transitions, 1999 flow [2022-12-13 11:57:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-12-13 11:57:06,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2022-12-13 11:57:06,472 INFO L175 Difference]: Start difference. First operand has 74 places, 112 transitions, 1098 flow. Second operand 4 states and 95 transitions. [2022-12-13 11:57:06,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 172 transitions, 1999 flow [2022-12-13 11:57:06,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 172 transitions, 1983 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:06,536 INFO L231 Difference]: Finished difference. Result has 78 places, 98 transitions, 996 flow [2022-12-13 11:57:06,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=996, PETRI_PLACES=78, PETRI_TRANSITIONS=98} [2022-12-13 11:57:06,538 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2022-12-13 11:57:06,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:06,538 INFO L89 Accepts]: Start accepts. Operand has 78 places, 98 transitions, 996 flow [2022-12-13 11:57:06,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:06,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:06,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 98 transitions, 996 flow [2022-12-13 11:57:06,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 98 transitions, 996 flow [2022-12-13 11:57:06,844 INFO L130 PetriNetUnfolder]: 2756/5196 cut-off events. [2022-12-13 11:57:06,844 INFO L131 PetriNetUnfolder]: For 11370/11673 co-relation queries the response was YES. [2022-12-13 11:57:06,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15571 conditions, 5196 events. 2756/5196 cut-off events. For 11370/11673 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 45851 event pairs, 1137 based on Foata normal form. 55/2553 useless extension candidates. Maximal degree in co-relation 15538. Up to 4090 conditions per place. [2022-12-13 11:57:06,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 98 transitions, 996 flow [2022-12-13 11:57:06,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 1200 [2022-12-13 11:57:06,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [312] L742-->L745: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [326] L786-->L789: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 11:57:06,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [312] L742-->L745: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [327] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_71 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_71 (ite .cse0 0 v_~y$w_buff0_used~0_72)) (= v_~y$w_buff1_used~0_66 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_67)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_23) v_~y$r_buff0_thd3~0_22) (= v_~y~0_41 (ite .cse0 v_~y$w_buff0~0_24 (ite .cse2 v_~y$w_buff1~0_17 v_~y~0_42))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_66 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_22 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_14) v_~y$r_buff1_thd3~0_13)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y~0=v_~y~0_42, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:07,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:07,049 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 511 [2022-12-13 11:57:07,049 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 98 transitions, 1012 flow [2022-12-13 11:57:07,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 11:57:07,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:07,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:07,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:57:07,049 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:07,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:07,050 INFO L85 PathProgramCache]: Analyzing trace with hash -917723731, now seen corresponding path program 1 times [2022-12-13 11:57:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:07,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064062768] [2022-12-13 11:57:07,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:07,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:07,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:07,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064062768] [2022-12-13 11:57:07,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064062768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:07,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:07,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692777499] [2022-12-13 11:57:07,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:07,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:07,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:07,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:07,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2022-12-13 11:57:07,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 98 transitions, 1012 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:07,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:07,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2022-12-13 11:57:07,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:08,715 INFO L130 PetriNetUnfolder]: 9015/14904 cut-off events. [2022-12-13 11:57:08,715 INFO L131 PetriNetUnfolder]: For 61908/62377 co-relation queries the response was YES. [2022-12-13 11:57:08,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60301 conditions, 14904 events. 9015/14904 cut-off events. For 61908/62377 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 116501 event pairs, 1915 based on Foata normal form. 263/11611 useless extension candidates. Maximal degree in co-relation 60265. Up to 10291 conditions per place. [2022-12-13 11:57:08,799 INFO L137 encePairwiseOnDemand]: 24/41 looper letters, 119 selfloop transitions, 26 changer transitions 65/220 dead transitions. [2022-12-13 11:57:08,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 220 transitions, 2565 flow [2022-12-13 11:57:08,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:57:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:57:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2022-12-13 11:57:08,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.556910569105691 [2022-12-13 11:57:08,801 INFO L175 Difference]: Start difference. First operand has 78 places, 98 transitions, 1012 flow. Second operand 6 states and 137 transitions. [2022-12-13 11:57:08,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 220 transitions, 2565 flow [2022-12-13 11:57:08,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 220 transitions, 2541 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-13 11:57:08,907 INFO L231 Difference]: Finished difference. Result has 86 places, 99 transitions, 1081 flow [2022-12-13 11:57:08,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1081, PETRI_PLACES=86, PETRI_TRANSITIONS=99} [2022-12-13 11:57:08,908 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 21 predicate places. [2022-12-13 11:57:08,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:08,908 INFO L89 Accepts]: Start accepts. Operand has 86 places, 99 transitions, 1081 flow [2022-12-13 11:57:08,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:08,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:08,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 99 transitions, 1081 flow [2022-12-13 11:57:08,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 99 transitions, 1081 flow [2022-12-13 11:57:09,469 INFO L130 PetriNetUnfolder]: 4278/7945 cut-off events. [2022-12-13 11:57:09,469 INFO L131 PetriNetUnfolder]: For 18916/19419 co-relation queries the response was YES. [2022-12-13 11:57:09,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23303 conditions, 7945 events. 4278/7945 cut-off events. For 18916/19419 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 74339 event pairs, 1929 based on Foata normal form. 70/3741 useless extension candidates. Maximal degree in co-relation 23265. Up to 6520 conditions per place. [2022-12-13 11:57:09,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 99 transitions, 1081 flow [2022-12-13 11:57:09,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 1334 [2022-12-13 11:57:09,567 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [374] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 11:57:09,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [465] $Ultimate##0-->L767: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_479 256) 0))) (.cse0 (not (= (mod v_~y$r_buff0_thd2~0_93 256) 0))) (.cse4 (= 0 (mod v_~y$w_buff0_used~0_481 256)))) (let ((.cse1 (and .cse0 (not .cse4))) (.cse2 (and .cse0 .cse3))) (and (= v_~y~0_421 (ite .cse0 v_~y$w_buff0~0_347 (ite .cse1 v_~y$w_buff1~0_319 v_~y~0_422))) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff0_used~0_481) v_~y$w_buff1_used~0_455) (= v_~y$r_buff0_thd3~0_136 1) (= v_~y$w_buff1~0_319 v_~y$w_buff0~0_348) (= v_~y$w_buff0_used~0_479 (ite .cse0 0 1)) (= 2 v_~y$w_buff0~0_347) (= v_~y$r_buff0_thd0~0_353 v_~y$r_buff1_thd0~0_353) (= v_~y$r_buff0_thd3~0_137 v_~y$r_buff1_thd3~0_102) (= (ite (or (and (not (= 0 (mod v_~y$w_buff1_used~0_455 256))) .cse0) (and (not (= (mod v_~y$r_buff0_thd2~0_92 256) 0)) .cse3)) 0 v_~y$r_buff0_thd2~0_93) v_~y$r_buff1_thd2~0_97) (= v_~y$r_buff0_thd2~0_92 (ite .cse2 0 v_~y$r_buff0_thd2~0_93)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_28| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28|) (= |v_P2Thread1of1ForFork1_~arg#1.base_26| |v_P2Thread1of1ForFork1_#in~arg#1.base_26|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28| (ite .cse4 1 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_26| |v_P2Thread1of1ForFork1_~arg#1.offset_26|) (= v_~y$r_buff0_thd1~0_48 v_~y$r_buff1_thd1~0_48) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_28| 0))))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_26|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_481, ~y$w_buff0~0=v_~y$w_buff0~0_348, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_353, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_93, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_26|, ~y~0=v_~y~0_422} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_479, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_26|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_26|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_97, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_102, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_26|, ~y$w_buff1~0=v_~y$w_buff1~0_319, ~y$w_buff0~0=v_~y$w_buff0~0_347, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_353, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_26|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_92, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_28|, ~y~0=v_~y~0_421, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_353, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_455, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_28|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-13 11:57:09,907 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [466] L818-3-->L829: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_485 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd0~0_356 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_356 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_486 256) 0)))) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_460 256) 0)) .cse1)) (.cse4 (and .cse0 .cse5))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~y$r_buff1_thd0~0_355 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd0~0_355 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_459 256) 0)) .cse1)) 0 v_~y$r_buff1_thd0~0_356)) (= v_~y$w_buff0_used~0_485 (ite .cse2 0 v_~y$w_buff0_used~0_486)) (= (mod v_~main$tmp_guard0~0_126 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= v_~main$tmp_guard0~0_126 (ite (= (ite (= v_~__unbuffered_cnt~0_557 3) 1 0) 0) 0 1)) (= v_~y~0_425 (ite .cse2 v_~y$w_buff0~0_351 (ite .cse3 v_~y$w_buff1~0_321 v_~y~0_426))) (= v_~y$r_buff0_thd0~0_355 (ite .cse4 0 v_~y$r_buff0_thd0~0_356)) (= v_~y$w_buff1_used~0_459 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_460)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_91| 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_486, ~y$w_buff1~0=v_~y$w_buff1~0_321, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~y$w_buff0~0=v_~y$w_buff0~0_351, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_557, ~y~0=v_~y~0_426, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_356, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_460} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_485, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_321, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_355, ~y$w_buff0~0=v_~y$w_buff0~0_351, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_91|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_123|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_557, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_89|, ~y~0=v_~y~0_425, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_355, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_459, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:57:10,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L757-->L829: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_404 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_545 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_404 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_546 256) 0)) .cse5)) (.cse4 (and .cse2 (not (= (mod v_~y$w_buff1_used~0_516 256) 0))))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (= (ite .cse0 0 v_~y$w_buff0_used~0_546) v_~y$w_buff0_used~0_545) (= v_~y$r_buff0_thd0~0_403 (ite .cse1 0 v_~y$r_buff0_thd0~0_404)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_579 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_148) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_148 256)) (= v_~y$r_buff1_thd0~0_403 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_515 256) 0)) .cse2) (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_403 256) 0)))) 0 v_~y$r_buff1_thd0~0_404)) (= v_~y$w_buff1_used~0_515 (ite (or .cse4 .cse1) 0 v_~y$w_buff1_used~0_516)) (= v_~y~0_479 (ite .cse0 v_~y$w_buff0~0_385 (ite .cse4 v_~y$w_buff1~0_351 1)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_546, ~y$w_buff1~0=v_~y$w_buff1~0_351, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_404, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_579, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_404, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_516} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_545, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_148, ~y$w_buff1~0=v_~y$w_buff1~0_351, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_403, ~y$w_buff0~0=v_~y$w_buff0~0_385, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_145|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_579, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_111|, ~y~0=v_~y~0_479, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_403, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_515, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [374] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 11:57:10,254 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:57:10,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1347 [2022-12-13 11:57:10,255 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 1146 flow [2022-12-13 11:57:10,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:10,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:10,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:10,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:57:10,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:10,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1483782583, now seen corresponding path program 1 times [2022-12-13 11:57:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:10,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344982454] [2022-12-13 11:57:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:10,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:10,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344982454] [2022-12-13 11:57:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344982454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:10,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:10,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570395899] [2022-12-13 11:57:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:10,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:57:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:57:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:57:10,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2022-12-13 11:57:10,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 1146 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:10,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:10,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2022-12-13 11:57:10,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:12,417 INFO L130 PetriNetUnfolder]: 9904/16672 cut-off events. [2022-12-13 11:57:12,419 INFO L131 PetriNetUnfolder]: For 78713/79247 co-relation queries the response was YES. [2022-12-13 11:57:12,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68293 conditions, 16672 events. 9904/16672 cut-off events. For 78713/79247 co-relation queries the response was YES. Maximal size of possible extension queue 1466. Compared 135899 event pairs, 2630 based on Foata normal form. 252/12720 useless extension candidates. Maximal degree in co-relation 68252. Up to 12157 conditions per place. [2022-12-13 11:57:12,493 INFO L137 encePairwiseOnDemand]: 27/42 looper letters, 91 selfloop transitions, 32 changer transitions 45/178 dead transitions. [2022-12-13 11:57:12,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 178 transitions, 2032 flow [2022-12-13 11:57:12,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:57:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:57:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2022-12-13 11:57:12,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2022-12-13 11:57:12,494 INFO L175 Difference]: Start difference. First operand has 87 places, 100 transitions, 1146 flow. Second operand 7 states and 135 transitions. [2022-12-13 11:57:12,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 178 transitions, 2032 flow [2022-12-13 11:57:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 178 transitions, 1970 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 11:57:12,585 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 1106 flow [2022-12-13 11:57:12,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1106, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2022-12-13 11:57:12,586 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 32 predicate places. [2022-12-13 11:57:12,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:12,586 INFO L89 Accepts]: Start accepts. Operand has 97 places, 94 transitions, 1106 flow [2022-12-13 11:57:12,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:12,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:12,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 94 transitions, 1106 flow [2022-12-13 11:57:12,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 94 transitions, 1106 flow [2022-12-13 11:57:12,958 INFO L130 PetriNetUnfolder]: 3806/7077 cut-off events. [2022-12-13 11:57:12,959 INFO L131 PetriNetUnfolder]: For 18349/18729 co-relation queries the response was YES. [2022-12-13 11:57:12,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20850 conditions, 7077 events. 3806/7077 cut-off events. For 18349/18729 co-relation queries the response was YES. Maximal size of possible extension queue 1189. Compared 65871 event pairs, 1902 based on Foata normal form. 39/3120 useless extension candidates. Maximal degree in co-relation 20806. Up to 5977 conditions per place. [2022-12-13 11:57:13,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 94 transitions, 1106 flow [2022-12-13 11:57:13,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 1204 [2022-12-13 11:57:13,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:57:13,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1291 [2022-12-13 11:57:13,877 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 1126 flow [2022-12-13 11:57:13,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:13,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:13,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:13,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:57:13,878 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:13,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1585829310, now seen corresponding path program 1 times [2022-12-13 11:57:13,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:13,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354510603] [2022-12-13 11:57:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:13,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:14,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354510603] [2022-12-13 11:57:14,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354510603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:14,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:14,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109020929] [2022-12-13 11:57:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:14,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:14,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:14,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:14,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2022-12-13 11:57:14,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 1126 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:14,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:14,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2022-12-13 11:57:14,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:15,489 INFO L130 PetriNetUnfolder]: 6835/11577 cut-off events. [2022-12-13 11:57:15,489 INFO L131 PetriNetUnfolder]: For 65812/66198 co-relation queries the response was YES. [2022-12-13 11:57:15,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50386 conditions, 11577 events. 6835/11577 cut-off events. For 65812/66198 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 89614 event pairs, 2901 based on Foata normal form. 56/8662 useless extension candidates. Maximal degree in co-relation 50339. Up to 9268 conditions per place. [2022-12-13 11:57:15,559 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 78 selfloop transitions, 14 changer transitions 31/132 dead transitions. [2022-12-13 11:57:15,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 132 transitions, 1580 flow [2022-12-13 11:57:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:57:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:57:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-13 11:57:15,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-13 11:57:15,560 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 1126 flow. Second operand 6 states and 108 transitions. [2022-12-13 11:57:15,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 132 transitions, 1580 flow [2022-12-13 11:57:15,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 132 transitions, 1504 flow, removed 29 selfloop flow, removed 5 redundant places. [2022-12-13 11:57:15,728 INFO L231 Difference]: Finished difference. Result has 96 places, 89 transitions, 1037 flow [2022-12-13 11:57:15,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1037, PETRI_PLACES=96, PETRI_TRANSITIONS=89} [2022-12-13 11:57:15,729 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 31 predicate places. [2022-12-13 11:57:15,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:15,729 INFO L89 Accepts]: Start accepts. Operand has 96 places, 89 transitions, 1037 flow [2022-12-13 11:57:15,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:15,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:15,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 89 transitions, 1037 flow [2022-12-13 11:57:15,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 1037 flow [2022-12-13 11:57:16,045 INFO L130 PetriNetUnfolder]: 2630/4907 cut-off events. [2022-12-13 11:57:16,046 INFO L131 PetriNetUnfolder]: For 11968/12110 co-relation queries the response was YES. [2022-12-13 11:57:16,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13941 conditions, 4907 events. 2630/4907 cut-off events. For 11968/12110 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 43324 event pairs, 1338 based on Foata normal form. 33/2135 useless extension candidates. Maximal degree in co-relation 13898. Up to 4270 conditions per place. [2022-12-13 11:57:16,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 1037 flow [2022-12-13 11:57:16,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-13 11:57:16,574 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] $Ultimate##0-->L757: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_~x~0_26 2) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] and [374] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 11:57:16,842 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:57:16,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1114 [2022-12-13 11:57:16,843 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 1068 flow [2022-12-13 11:57:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:16,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:16,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:16,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:57:16,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:16,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2020265878, now seen corresponding path program 1 times [2022-12-13 11:57:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:16,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757484477] [2022-12-13 11:57:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:16,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757484477] [2022-12-13 11:57:17,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757484477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:17,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:17,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:57:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252152391] [2022-12-13 11:57:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:17,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:57:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:17,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:57:17,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:57:17,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 43 [2022-12-13 11:57:17,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 1068 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:17,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:17,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 43 [2022-12-13 11:57:17,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:17,560 INFO L130 PetriNetUnfolder]: 2446/4461 cut-off events. [2022-12-13 11:57:17,560 INFO L131 PetriNetUnfolder]: For 30875/31005 co-relation queries the response was YES. [2022-12-13 11:57:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20761 conditions, 4461 events. 2446/4461 cut-off events. For 30875/31005 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 32562 event pairs, 409 based on Foata normal form. 233/2802 useless extension candidates. Maximal degree in co-relation 20715. Up to 4096 conditions per place. [2022-12-13 11:57:17,580 INFO L137 encePairwiseOnDemand]: 27/43 looper letters, 65 selfloop transitions, 19 changer transitions 19/110 dead transitions. [2022-12-13 11:57:17,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 1525 flow [2022-12-13 11:57:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:57:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:57:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-12-13 11:57:17,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5465116279069767 [2022-12-13 11:57:17,581 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 1068 flow. Second operand 4 states and 94 transitions. [2022-12-13 11:57:17,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 1525 flow [2022-12-13 11:57:17,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 110 transitions, 1363 flow, removed 35 selfloop flow, removed 12 redundant places. [2022-12-13 11:57:17,626 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 731 flow [2022-12-13 11:57:17,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=731, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2022-12-13 11:57:17,627 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 20 predicate places. [2022-12-13 11:57:17,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:17,627 INFO L89 Accepts]: Start accepts. Operand has 85 places, 73 transitions, 731 flow [2022-12-13 11:57:17,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:17,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:17,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 73 transitions, 731 flow [2022-12-13 11:57:17,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 73 transitions, 731 flow [2022-12-13 11:57:17,776 INFO L130 PetriNetUnfolder]: 1024/2387 cut-off events. [2022-12-13 11:57:17,776 INFO L131 PetriNetUnfolder]: For 8375/9249 co-relation queries the response was YES. [2022-12-13 11:57:17,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10236 conditions, 2387 events. 1024/2387 cut-off events. For 8375/9249 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 20973 event pairs, 180 based on Foata normal form. 30/1359 useless extension candidates. Maximal degree in co-relation 10199. Up to 1768 conditions per place. [2022-12-13 11:57:17,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 73 transitions, 731 flow [2022-12-13 11:57:17,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 622 [2022-12-13 11:57:17,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L757-->L760: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [327] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_71 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_71 (ite .cse0 0 v_~y$w_buff0_used~0_72)) (= v_~y$w_buff1_used~0_66 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_67)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_23) v_~y$r_buff0_thd3~0_22) (= v_~y~0_41 (ite .cse0 v_~y$w_buff0~0_24 (ite .cse2 v_~y$w_buff1~0_17 v_~y~0_42))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_66 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_22 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_14) v_~y$r_buff1_thd3~0_13)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y~0=v_~y~0_42, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:18,071 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [374] $Ultimate##0-->L786: Formula: (and (= v_~y$w_buff0_used~0_157 1) (= v_~y$r_buff0_thd3~0_48 1) (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff1_thd2~0_37) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_87) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9| 0)) (= v_~y$r_buff0_thd3~0_49 v_~y$r_buff1_thd3~0_31) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd1~0_13 v_~y$r_buff1_thd1~0_13) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= v_~y$w_buff0_used~0_158 v_~y$w_buff1_used~0_146) (= v_~y$w_buff0~0_83 v_~y$w_buff1~0_65) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_146 256) 0)) (not (= (mod v_~y$w_buff0_used~0_157 256) 0)))) 1 0)) (= 2 v_~y$w_buff0~0_82) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_158, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_49, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_83, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_157, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_37, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_65, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_48, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_82, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_13, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_87, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_9|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_146} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [389] $Ultimate##0-->L757: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_~x~0_26 2) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 11:57:18,282 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [501] $Ultimate##0-->L757: Formula: (and (= v_~y$r_buff0_thd1~0_68 v_~y$r_buff1_thd1~0_68) (= v_~y$r_buff0_thd3~0_188 1) (= 2 v_~y$w_buff0~0_423) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_37| v_P1Thread1of1ForFork0_~arg.offset_37) (= v_~y$w_buff0_used~0_602 v_~y$w_buff1_used~0_563) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_563 256) 0)) (not (= (mod v_~y$w_buff0_used~0_601 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_433 v_~y$r_buff1_thd0~0_435) (= v_~y$w_buff1~0_381 v_~y$w_buff0~0_424) (= v_P1Thread1of1ForFork0_~arg.base_37 |v_P1Thread1of1ForFork0_#in~arg.base_37|) (= v_~y$w_buff0_used~0_601 1) (= |v_P2Thread1of1ForFork1_~arg#1.base_46| |v_P2Thread1of1ForFork1_#in~arg#1.base_46|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_46| |v_P2Thread1of1ForFork1_~arg#1.offset_46|) (= v_~y$r_buff0_thd2~0_130 v_~y$r_buff1_thd2~0_131) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= 2 v_~x~0_181) (= v_~y$r_buff0_thd3~0_189 v_~y$r_buff1_thd3~0_134)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_46|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_602, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_37|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_189, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_433, ~y$w_buff0~0=v_~y$w_buff0~0_424, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_46|} OutVars{P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_37, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_601, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_46|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_46|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_68, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_37, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_134, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_46|, ~y$w_buff1~0=v_~y$w_buff1~0_381, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_37|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_188, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_433, ~y$w_buff0~0=v_~y$w_buff0~0_423, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_130, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_68, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_37|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~x~0=v_~x~0_181, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_435, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_563} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.base, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork0_~arg.offset, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [326] L786-->L789: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 11:57:18,395 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [492] $Ultimate##0-->L767: Formula: (let ((.cse4 (= (mod v_~y$w_buff0_used~0_566 256) 0)) (.cse0 (not (= (mod v_~y$r_buff0_thd2~0_113 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_565 256) 0)))) (let ((.cse2 (and .cse0 .cse3)) (.cse1 (and .cse0 (not .cse4)))) (and (= v_~y$r_buff0_thd0~0_417 v_~y$r_buff1_thd0~0_419) (= (ite .cse0 0 1) v_~y$w_buff0_used~0_565) (= v_~y$w_buff1_used~0_535 (ite (or .cse1 .cse2) 0 v_~y$w_buff0_used~0_566)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_38| |v_P2Thread1of1ForFork1_~arg#1.offset_38|) (= 2 v_~y$w_buff0~0_397) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_40| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_40|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_40| 0)) (= 2 v_~x~0_175) (= v_~y$r_buff1_thd2~0_115 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_112 256) 0))) (and .cse0 (not (= (mod v_~y$w_buff1_used~0_535 256) 0)))) 0 v_~y$r_buff0_thd2~0_113)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_31| v_P1Thread1of1ForFork0_~arg.offset_31) (= v_P1Thread1of1ForFork0_~arg.base_31 |v_P1Thread1of1ForFork0_#in~arg.base_31|) (= v_~y$r_buff0_thd1~0_60 v_~y$r_buff1_thd1~0_60) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_40|) (= v_~y$r_buff0_thd3~0_169 v_~y$r_buff1_thd3~0_122) (= |v_P2Thread1of1ForFork1_~arg#1.base_38| |v_P2Thread1of1ForFork1_#in~arg#1.base_38|) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_113) v_~y$r_buff0_thd2~0_112) (= v_~y~0_495 (ite .cse0 v_~y$w_buff0~0_397 (ite .cse1 v_~y$w_buff1~0_363 1))) (= v_~y$w_buff1~0_363 v_~y$w_buff0~0_398) (= v_~y$r_buff0_thd3~0_168 1)))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_38|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_566, ~y$w_buff0~0=v_~y$w_buff0~0_398, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_417, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_113, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_38|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_31, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_38|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_38|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_115, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_60, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_38|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_31, ~y$w_buff1~0=v_~y$w_buff1~0_363, ~y$w_buff0~0=v_~y$w_buff0~0_397, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_168, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_417, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_38|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_31|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_112, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_31|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_40|, ~y~0=v_~y~0_495, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_419, ~x~0=v_~x~0_175, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_535, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_40|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [326] L786-->L789: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_2) InVars {~z~0=v_~z~0_2} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_2} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 11:57:19,223 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 11:57:19,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1597 [2022-12-13 11:57:19,224 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 725 flow [2022-12-13 11:57:19,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:19,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:19,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:19,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:57:19,224 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:19,224 INFO L85 PathProgramCache]: Analyzing trace with hash -830803290, now seen corresponding path program 1 times [2022-12-13 11:57:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:19,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461285653] [2022-12-13 11:57:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:19,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:57:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:57:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:57:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461285653] [2022-12-13 11:57:19,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461285653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:57:19,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:57:19,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:57:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92723398] [2022-12-13 11:57:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:57:19,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:57:19,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:57:19,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:57:19,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:57:19,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-13 11:57:19,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 725 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:19,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:57:19,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-13 11:57:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:57:19,513 INFO L130 PetriNetUnfolder]: 657/1490 cut-off events. [2022-12-13 11:57:19,513 INFO L131 PetriNetUnfolder]: For 7630/7630 co-relation queries the response was YES. [2022-12-13 11:57:19,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8049 conditions, 1490 events. 657/1490 cut-off events. For 7630/7630 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10467 event pairs, 4 based on Foata normal form. 234/1063 useless extension candidates. Maximal degree in co-relation 8009. Up to 1126 conditions per place. [2022-12-13 11:57:19,519 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 23 selfloop transitions, 28 changer transitions 37/89 dead transitions. [2022-12-13 11:57:19,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 89 transitions, 1218 flow [2022-12-13 11:57:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:57:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:57:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 11:57:19,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.445 [2022-12-13 11:57:19,522 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 725 flow. Second operand 5 states and 89 transitions. [2022-12-13 11:57:19,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 89 transitions, 1218 flow [2022-12-13 11:57:19,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 870 flow, removed 106 selfloop flow, removed 14 redundant places. [2022-12-13 11:57:19,533 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 339 flow [2022-12-13 11:57:19,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2022-12-13 11:57:19,534 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 5 predicate places. [2022-12-13 11:57:19,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:57:19,534 INFO L89 Accepts]: Start accepts. Operand has 70 places, 45 transitions, 339 flow [2022-12-13 11:57:19,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:57:19,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:57:19,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 45 transitions, 339 flow [2022-12-13 11:57:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 45 transitions, 339 flow [2022-12-13 11:57:19,562 INFO L130 PetriNetUnfolder]: 162/461 cut-off events. [2022-12-13 11:57:19,562 INFO L131 PetriNetUnfolder]: For 243/291 co-relation queries the response was YES. [2022-12-13 11:57:19,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 461 events. 162/461 cut-off events. For 243/291 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3370 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 1749. Up to 325 conditions per place. [2022-12-13 11:57:19,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 45 transitions, 339 flow [2022-12-13 11:57:19,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 134 [2022-12-13 11:57:19,778 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [510] $Ultimate##0-->L796: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_641 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_155 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_225 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_642 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_588 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_457 (ite .cse1 v_~y$w_buff1~0_399 1)) v_~y~0_535) (= v_~y$w_buff0_used~0_641 (ite .cse0 0 v_~y$w_buff0_used~0_642)) (= |v_P1Thread1of1ForFork0_#in~arg.offset_51| v_P1Thread1of1ForFork0_~arg.offset_51) (= v_~y$w_buff1_used~0_587 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_588)) (= (ite .cse2 0 v_~y$r_buff0_thd3~0_225) v_~y$r_buff0_thd3~0_224) (= v_P1Thread1of1ForFork0_~arg.base_51 |v_P1Thread1of1ForFork0_#in~arg.base_51|) (= 2 v_~x~0_195) (= (ite (or (and .cse3 (not (= 0 (mod v_~y$w_buff1_used~0_587 256)))) (and .cse4 (not (= (mod v_~y$r_buff0_thd3~0_224 256) 0)))) 0 v_~y$r_buff1_thd3~0_155) v_~y$r_buff1_thd3~0_154)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_155, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_642, ~y$w_buff1~0=v_~y$w_buff1~0_399, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ~y$w_buff0~0=v_~y$w_buff0~0_457, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_51|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_51|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_588} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_154, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_51, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_641, ~y$w_buff1~0=v_~y$w_buff1~0_399, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_51, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_224, ~y$w_buff0~0=v_~y$w_buff0~0_457, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_51|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_51|, ~y~0=v_~y~0_535, ~x~0=v_~x~0_195, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_587} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~y$r_buff0_thd3~0, ~y~0, ~x~0, ~y$w_buff1_used~0] and [319] L760-->L767: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_91 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_44 (ite .cse1 v_~y$w_buff1~0_33 v_~y~0_62)) v_~y~0_61) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_90 256) 0)) .cse2) (and (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_24) v_~y$r_buff1_thd2~0_23) (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$r_buff0_thd2~0_25 (ite .cse4 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff1_used~0_90 (ite (or .cse1 .cse4) 0 v_~y$w_buff1_used~0_91))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:20,928 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L745: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= v_~z~0_53 1) (= v_~x~0_167 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~z~0=v_~z~0_53, ~x~0=v_~x~0_167, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [511] $Ultimate##0-->L767: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_148 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_151 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_645 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_592 256) 0)))) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_646 256) 0))))) (and (= 2 v_~x~0_197) (= (ite .cse0 0 v_~y$r_buff0_thd2~0_151) v_~y$r_buff0_thd2~0_150) (= |v_P1Thread1of1ForFork0_#in~arg.offset_53| v_P1Thread1of1ForFork0_~arg.offset_53) (= v_~y~0_537 (ite .cse1 v_~y$w_buff0~0_459 (ite .cse2 v_~y$w_buff1~0_401 1))) (= v_~y$w_buff1_used~0_591 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_592)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_591 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_150 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_148) v_~y$r_buff1_thd2~0_147) (= v_P1Thread1of1ForFork0_~arg.base_53 |v_P1Thread1of1ForFork0_#in~arg.base_53|) (= v_~y$w_buff0_used~0_645 (ite .cse1 0 v_~y$w_buff0_used~0_646))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_148, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_646, ~y$w_buff1~0=v_~y$w_buff1~0_401, ~y$w_buff0~0=v_~y$w_buff0~0_459, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_151, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_53|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_592} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_147, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_53, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_645, ~y$w_buff1~0=v_~y$w_buff1~0_401, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_53, ~y$w_buff0~0=v_~y$w_buff0~0_459, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_150, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_53|, ~y~0=v_~y~0_537, ~x~0=v_~x~0_197, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_591} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~y$r_buff0_thd2~0, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 11:57:21,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L745: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= v_~z~0_53 1) (= v_~x~0_167 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~z~0=v_~z~0_53, ~x~0=v_~x~0_167, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] and [512] $Ultimate##0-->L767: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd3~0_229 256) 0)))) (let ((.cse10 (and (not (= (mod v_~y$w_buff0_used~0_651 256) 0)) .cse14))) (let ((.cse12 (ite .cse10 0 v_~y$w_buff0_used~0_651))) (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_159 256) 0))) (.cse2 (not (= (mod .cse12 256) 0)))) (let ((.cse3 (and .cse14 .cse2)) (.cse11 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_597 256) 0))))) (let ((.cse8 (ite (or .cse3 .cse11) 0 v_~y$w_buff1_used~0_597))) (let ((.cse0 (not (= (mod .cse8 256) 0))) (.cse6 (not (= 0 (mod v_~y$r_buff1_thd2~0_152 256)))) (.cse5 (not (= (mod v_~y$w_buff0_used~0_649 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd2~0_155 256) 0)))) (let ((.cse4 (and .cse5 .cse13)) (.cse7 (and .cse0 .cse6)) (.cse9 (and .cse13 .cse2))) (and (= v_~y$r_buff1_thd3~0_158 (ite (or (and .cse0 .cse1) (and (not (= (mod v_~y$r_buff0_thd3~0_228 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_159)) (= (ite .cse3 0 v_~y$r_buff0_thd3~0_229) v_~y$r_buff0_thd3~0_228) (= v_~y$r_buff0_thd2~0_154 (ite .cse4 0 v_~y$r_buff0_thd2~0_155)) (= 2 v_~x~0_199) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_154 256) 0)) .cse5) (and .cse6 (not (= (mod v_~y$w_buff1_used~0_595 256) 0)))) 0 v_~y$r_buff1_thd2~0_152) v_~y$r_buff1_thd2~0_151) (= v_~y$w_buff1_used~0_595 (ite (or .cse4 .cse7) 0 .cse8)) (= v_~y~0_539 (ite .cse9 v_~y$w_buff0~0_461 (ite .cse7 v_~y$w_buff1~0_403 (ite .cse10 v_~y$w_buff0~0_461 (ite .cse11 v_~y$w_buff1~0_403 1))))) (= (ite .cse9 0 .cse12) v_~y$w_buff0_used~0_649) (= v_P1Thread1of1ForFork0_~arg.base_55 |v_P1Thread1of1ForFork0_#in~arg.base_55|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_55| v_P1Thread1of1ForFork0_~arg.offset_55)))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_152, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_651, ~y$w_buff1~0=v_~y$w_buff1~0_403, ~y$w_buff0~0=v_~y$w_buff0~0_461, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_229, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_55|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_155, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_55|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_597} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_649, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_55, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_158, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_55, ~y$w_buff1~0=v_~y$w_buff1~0_403, ~y$w_buff0~0=v_~y$w_buff0~0_461, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_228, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_55|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_154, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_55|, ~y~0=v_~y~0_539, ~x~0=v_~x~0_199, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_595} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~y$r_buff0_thd3~0, ~y$r_buff0_thd2~0, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 11:57:22,042 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] $Ultimate##0-->L789: Formula: (and (= |v_P2Thread1of1ForFork1_~arg#1.base_44| |v_P2Thread1of1ForFork1_#in~arg#1.base_44|) (= v_~y$w_buff1~0_379 v_~y$w_buff0~0_420) (= v_~y$r_buff0_thd2~0_128 v_~y$r_buff1_thd2~0_129) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_561 256) 0)) (not (= (mod v_~y$w_buff0_used~0_597 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_46|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_44| |v_P2Thread1of1ForFork1_~arg#1.offset_44|) (= v_~y$r_buff0_thd0~0_431 v_~y$r_buff1_thd0~0_433) (= v_~y$w_buff0_used~0_597 1) (= v_~y$r_buff0_thd3~0_185 v_~y$r_buff1_thd3~0_132) (= v_~y$r_buff0_thd3~0_184 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_46| 0)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_46| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_46|) (= 2 v_~y$w_buff0~0_419) (= v_~y$w_buff0_used~0_598 v_~y$w_buff1_used~0_561) (= v_~z~0_61 v_~__unbuffered_p2_EAX~0_140) (= v_~y$r_buff0_thd1~0_66 v_~y$r_buff1_thd1~0_66)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_44|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_598, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_431, ~y$w_buff0~0=v_~y$w_buff0~0_420, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_128, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_44|, ~z~0=v_~z~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_597, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_44|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_66, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_44|, ~y$w_buff1~0=v_~y$w_buff1~0_379, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_431, ~y$w_buff0~0=v_~y$w_buff0~0_419, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_128, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_46|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_140, ~z~0=v_~z~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_433, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_46|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [514] $Ultimate##0-->L767: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd3~0_233 256) 0)))) (let ((.cse10 (and .cse14 (not (= (mod v_~y$w_buff0_used~0_660 256) 0))))) (let ((.cse6 (ite .cse10 0 v_~y$w_buff0_used~0_660))) (let ((.cse4 (not (= (mod .cse6 256) 0))) (.cse2 (not (= 0 (mod v_~y$r_buff1_thd3~0_163 256))))) (let ((.cse11 (and (not (= (mod v_~y$w_buff1_used~0_606 256) 0)) .cse2)) (.cse12 (and .cse14 .cse4))) (let ((.cse9 (ite (or .cse11 .cse12) 0 v_~y$w_buff1_used~0_606))) (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_160 256) 0))) (.cse3 (not (= (mod .cse9 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd2~0_163 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_659 256) 0)))) (let ((.cse7 (and .cse13 .cse0)) (.cse5 (and .cse4 .cse13)) (.cse8 (and .cse1 .cse3))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_162 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_605 256) 0)))) 0 v_~y$r_buff1_thd2~0_160) v_~y$r_buff1_thd2~0_159) (= |v_P0Thread1of1ForFork2_#in~arg.offset_31| v_P0Thread1of1ForFork2_~arg.offset_31) (= (ite (or (and .cse2 .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_232 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_163) v_~y$r_buff1_thd3~0_162) (= v_~z~0_79 1) (= (ite .cse5 0 .cse6) v_~y$w_buff0_used~0_659) (= (ite .cse7 0 v_~y$r_buff0_thd2~0_163) v_~y$r_buff0_thd2~0_162) (= |v_P1Thread1of1ForFork0_#in~arg.offset_59| v_P1Thread1of1ForFork0_~arg.offset_59) (= v_P1Thread1of1ForFork0_~arg.base_59 |v_P1Thread1of1ForFork0_#in~arg.base_59|) (= (ite (or .cse7 .cse8) 0 .cse9) v_~y$w_buff1_used~0_605) (= 2 v_~x~0_205) (= v_~y~0_545 (ite .cse5 v_~y$w_buff0~0_465 (ite .cse8 v_~y$w_buff1~0_407 (ite .cse10 v_~y$w_buff0~0_465 (ite .cse11 v_~y$w_buff1~0_407 1))))) (= (ite .cse12 0 v_~y$r_buff0_thd3~0_233) v_~y$r_buff0_thd3~0_232) (= v_P0Thread1of1ForFork2_~arg.base_31 |v_P0Thread1of1ForFork2_#in~arg.base_31|)))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_160, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_163, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_660, ~y$w_buff1~0=v_~y$w_buff1~0_407, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_31|, ~y$w_buff0~0=v_~y$w_buff0~0_465, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_233, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_59|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_163, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_59|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_31|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_606} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_659, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_59, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_31|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_31, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_159, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_162, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_59, ~y$w_buff1~0=v_~y$w_buff1~0_407, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_31|, ~y$w_buff0~0=v_~y$w_buff0~0_465, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_232, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_59|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_162, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_59|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_31, ~z~0=v_~z~0_79, ~y~0=v_~y~0_545, ~x~0=v_~x~0_205, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_605} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$r_buff0_thd3~0, ~y$r_buff0_thd2~0, P0Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 11:57:22,364 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [513] $Ultimate##0-->L767: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_655 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_156 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_159 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_656 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_602 256) 0)))) (.cse2 (and .cse5 .cse4))) (and (= 2 v_~x~0_201) (= v_~y~0_543 (ite .cse0 v_~y$w_buff0~0_463 (ite .cse1 v_~y$w_buff1~0_405 1))) (= (ite .cse0 0 v_~y$w_buff0_used~0_656) v_~y$w_buff0_used~0_655) (= v_~y$w_buff1_used~0_601 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_602)) (= v_P1Thread1of1ForFork0_~arg.base_57 |v_P1Thread1of1ForFork0_#in~arg.base_57|) (= v_P0Thread1of1ForFork2_~arg.base_29 |v_P0Thread1of1ForFork2_#in~arg.base_29|) (= v_~y$r_buff1_thd2~0_155 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_601 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_158 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_156)) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_159) v_~y$r_buff0_thd2~0_158) (= |v_P0Thread1of1ForFork2_#in~arg.offset_29| v_P0Thread1of1ForFork2_~arg.offset_29) (= |v_P1Thread1of1ForFork0_#in~arg.offset_57| v_P1Thread1of1ForFork0_~arg.offset_57) (= v_~z~0_77 1)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_156, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_656, ~y$w_buff1~0=v_~y$w_buff1~0_405, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_463, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_159, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_57|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_602} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_655, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_57, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_29, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_155, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_57, ~y$w_buff1~0=v_~y$w_buff1~0_405, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, ~y$w_buff0~0=v_~y$w_buff0~0_463, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_158, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_57|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_29, ~z~0=v_~z~0_77, ~y~0=v_~y~0_543, ~x~0=v_~x~0_201, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_601} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~y$r_buff0_thd2~0, P0Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0, ~x~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] and [327] L789-->L796: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_14 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_23 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_71 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_72 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse3))) (and (= v_~y$w_buff0_used~0_71 (ite .cse0 0 v_~y$w_buff0_used~0_72)) (= v_~y$w_buff1_used~0_66 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_67)) (= (ite .cse1 0 v_~y$r_buff0_thd3~0_23) v_~y$r_buff0_thd3~0_22) (= v_~y~0_41 (ite .cse0 v_~y$w_buff0~0_24 (ite .cse2 v_~y$w_buff1~0_17 v_~y~0_42))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_66 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_22 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_14) v_~y$r_buff1_thd3~0_13)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_72, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y~0=v_~y~0_42, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_71, ~y$w_buff1~0=v_~y$w_buff1~0_17, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$w_buff0~0=v_~y$w_buff0~0_24, ~y~0=v_~y~0_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 11:57:24,290 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [500] $Ultimate##0-->L789: Formula: (and (= |v_P2Thread1of1ForFork1_~arg#1.base_44| |v_P2Thread1of1ForFork1_#in~arg#1.base_44|) (= v_~y$w_buff1~0_379 v_~y$w_buff0~0_420) (= v_~y$r_buff0_thd2~0_128 v_~y$r_buff1_thd2~0_129) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_561 256) 0)) (not (= (mod v_~y$w_buff0_used~0_597 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_46|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_44| |v_P2Thread1of1ForFork1_~arg#1.offset_44|) (= v_~y$r_buff0_thd0~0_431 v_~y$r_buff1_thd0~0_433) (= v_~y$w_buff0_used~0_597 1) (= v_~y$r_buff0_thd3~0_185 v_~y$r_buff1_thd3~0_132) (= v_~y$r_buff0_thd3~0_184 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_46| 0)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_46| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_46|) (= 2 v_~y$w_buff0~0_419) (= v_~y$w_buff0_used~0_598 v_~y$w_buff1_used~0_561) (= v_~z~0_61 v_~__unbuffered_p2_EAX~0_140) (= v_~y$r_buff0_thd1~0_66 v_~y$r_buff1_thd1~0_66)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_44|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_598, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_431, ~y$w_buff0~0=v_~y$w_buff0~0_420, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_128, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_44|, ~z~0=v_~z~0_61} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_597, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_44|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_66, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_44|, ~y$w_buff1~0=v_~y$w_buff1~0_379, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_431, ~y$w_buff0~0=v_~y$w_buff0~0_419, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_128, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_46|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_140, ~z~0=v_~z~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_433, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_46|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_561} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [518] $Ultimate##0-->L796: Formula: (let ((.cse14 (not (= (mod v_~y$r_buff0_thd2~0_171 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff0_used~0_683 256) 0)) .cse14))) (let ((.cse9 (ite .cse2 0 v_~y$w_buff0_used~0_683))) (let ((.cse8 (not (= (mod .cse9 256) 0))) (.cse7 (not (= (mod v_~y$r_buff1_thd2~0_168 256) 0)))) (let ((.cse3 (and (not (= 0 (mod v_~y$w_buff1_used~0_627 256))) .cse7)) (.cse5 (and .cse8 .cse14))) (let ((.cse12 (ite (or .cse3 .cse5) 0 v_~y$w_buff1_used~0_627))) (let ((.cse11 (not (= (mod v_~y$w_buff0_used~0_681 256) 0))) (.cse10 (not (= (mod v_~y$r_buff1_thd3~0_171 256) 0))) (.cse6 (not (= (mod .cse12 256) 0))) (.cse13 (not (= (mod v_~y$r_buff0_thd3~0_243 256) 0)))) (let ((.cse0 (and .cse8 .cse13)) (.cse1 (and .cse10 .cse6)) (.cse4 (and .cse11 .cse13))) (and (= v_~y~0_561 (ite .cse0 v_~y$w_buff0~0_479 (ite .cse1 v_~y$w_buff1~0_419 (ite .cse2 v_~y$w_buff0~0_479 (ite .cse3 v_~y$w_buff1~0_419 1))))) (= v_~y$r_buff0_thd3~0_242 (ite .cse4 0 v_~y$r_buff0_thd3~0_243)) (= (ite .cse5 0 v_~y$r_buff0_thd2~0_171) v_~y$r_buff0_thd2~0_170) (= v_~z~0_85 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_35| v_P0Thread1of1ForFork2_~arg.offset_35) (= 2 v_~x~0_215) (= (ite (or (and .cse6 .cse7) (and .cse8 (not (= (mod v_~y$r_buff0_thd2~0_170 256) 0)))) 0 v_~y$r_buff1_thd2~0_168) v_~y$r_buff1_thd2~0_167) (= (ite .cse0 0 .cse9) v_~y$w_buff0_used~0_681) (= |v_P1Thread1of1ForFork0_#in~arg.offset_63| v_P1Thread1of1ForFork0_~arg.offset_63) (= v_P1Thread1of1ForFork0_~arg.base_63 |v_P1Thread1of1ForFork0_#in~arg.base_63|) (= v_P0Thread1of1ForFork2_~arg.base_35 |v_P0Thread1of1ForFork2_#in~arg.base_35|) (= (ite (or (and .cse10 (not (= (mod v_~y$w_buff1_used~0_625 256) 0))) (and .cse11 (not (= (mod v_~y$r_buff0_thd3~0_242 256) 0)))) 0 v_~y$r_buff1_thd3~0_171) v_~y$r_buff1_thd3~0_170) (= (ite (or .cse1 .cse4) 0 .cse12) v_~y$w_buff1_used~0_625)))))))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_683, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_35|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_168, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_171, ~y$w_buff1~0=v_~y$w_buff1~0_419, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_35|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_243, ~y$w_buff0~0=v_~y$w_buff0~0_479, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_63|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_63|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_627} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_681, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_63, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_35|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_35, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_167, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_170, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_63, ~y$w_buff1~0=v_~y$w_buff1~0_419, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_35|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_242, ~y$w_buff0~0=v_~y$w_buff0~0_479, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_63|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_170, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_63|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_35, ~z~0=v_~z~0_85, ~y~0=v_~y~0_561, ~x~0=v_~x~0_215, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_625} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$r_buff0_thd3~0, ~y$r_buff0_thd2~0, P0Thread1of1ForFork2_~arg.offset, ~z~0, ~y~0, ~x~0, ~y$w_buff1_used~0] [2022-12-13 11:57:24,599 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 11:57:24,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5065 [2022-12-13 11:57:24,599 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 336 flow [2022-12-13 11:57:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:57:24,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:57:24,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:24,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:57:24,600 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:57:24,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:57:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2058864557, now seen corresponding path program 1 times [2022-12-13 11:57:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:57:24,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047586077] [2022-12-13 11:57:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:57:24,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:57:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:24,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:57:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:57:24,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:57:24,670 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:57:24,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:57:24,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:57:24,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:57:24,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:57:24,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:57:24,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:57:24,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:57:24,672 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:57:24,676 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:57:24,676 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:57:24,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:57:24 BasicIcfg [2022-12-13 11:57:24,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:57:24,733 INFO L158 Benchmark]: Toolchain (without parser) took 37841.80ms. Allocated memory was 248.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 223.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 782.4MB. Max. memory is 8.0GB. [2022-12-13 11:57:24,733 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 248.5MB. Free memory is still 225.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:57:24,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.22ms. Allocated memory is still 248.5MB. Free memory was 223.8MB in the beginning and 197.5MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:57:24,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.80ms. Allocated memory is still 248.5MB. Free memory was 197.5MB in the beginning and 195.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:57:24,734 INFO L158 Benchmark]: Boogie Preprocessor took 31.90ms. Allocated memory is still 248.5MB. Free memory was 195.0MB in the beginning and 192.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 11:57:24,734 INFO L158 Benchmark]: RCFGBuilder took 460.58ms. Allocated memory is still 248.5MB. Free memory was 192.9MB in the beginning and 160.9MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 11:57:24,734 INFO L158 Benchmark]: TraceAbstraction took 36849.00ms. Allocated memory was 248.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 159.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 718.4MB. Max. memory is 8.0GB. [2022-12-13 11:57:24,735 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 248.5MB. Free memory is still 225.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 449.22ms. Allocated memory is still 248.5MB. Free memory was 223.8MB in the beginning and 197.5MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.80ms. Allocated memory is still 248.5MB. Free memory was 197.5MB in the beginning and 195.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.90ms. Allocated memory is still 248.5MB. Free memory was 195.0MB in the beginning and 192.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 460.58ms. Allocated memory is still 248.5MB. Free memory was 192.9MB in the beginning and 160.9MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 36849.00ms. Allocated memory was 248.5MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 159.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 718.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 111 PlacesBefore, 65 PlacesAfterwards, 103 TransitionsBefore, 56 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 3 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 3061, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3178, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1713, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1713, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 220, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3178, independent: 1393, independent conditional: 0, independent unconditional: 1393, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 1713, unknown conditional: 0, unknown unconditional: 1713] , Statistics on independence cache: Total cache size (in pairs): 3019, Positive cache size: 2974, Positive conditional cache size: 0, Positive unconditional cache size: 2974, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, 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, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 290, independent: 258, independent conditional: 258, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 290, independent: 258, independent conditional: 18, independent unconditional: 240, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 290, independent: 258, independent conditional: 18, independent unconditional: 240, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 290, independent: 258, independent conditional: 18, independent unconditional: 240, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 223, independent: 203, independent conditional: 14, independent unconditional: 189, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 223, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 39, dependent conditional: 8, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 290, independent: 55, independent conditional: 4, independent unconditional: 51, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 223, unknown conditional: 16, unknown unconditional: 207] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 203, Positive conditional cache size: 14, Positive unconditional cache size: 189, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, 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, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 250, independent: 227, independent conditional: 227, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 250, independent: 227, independent conditional: 24, independent unconditional: 203, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 250, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 250, independent: 227, independent conditional: 0, independent unconditional: 227, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 217, Positive conditional cache size: 14, Positive unconditional cache size: 203, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 44 PlacesBefore, 43 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, independent: 299, independent conditional: 299, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344, independent: 299, independent conditional: 50, independent unconditional: 249, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, independent: 299, independent conditional: 28, independent unconditional: 271, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, independent: 299, independent conditional: 28, independent unconditional: 271, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 20, independent conditional: 1, independent unconditional: 19, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 344, independent: 279, independent conditional: 27, independent unconditional: 252, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 25, unknown conditional: 1, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 285, Positive cache size: 258, Positive conditional cache size: 15, Positive unconditional cache size: 243, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 98, independent conditional: 22, independent unconditional: 76, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 98, independent conditional: 4, independent unconditional: 94, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 98, independent conditional: 4, independent unconditional: 94, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 114, independent: 93, independent conditional: 4, independent unconditional: 89, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 263, Positive conditional cache size: 15, Positive unconditional cache size: 248, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, 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, 42 TransitionsBefore, 42 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 73, independent: 62, independent conditional: 18, independent unconditional: 44, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 62, independent conditional: 4, independent unconditional: 58, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 263, Positive conditional cache size: 15, Positive unconditional cache size: 248, Negative cache size: 31, Negative conditional cache size: 3, 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: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 65, independent conditional: 23, independent unconditional: 42, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, independent: 65, independent conditional: 9, independent unconditional: 56, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, independent: 65, independent conditional: 9, independent unconditional: 56, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, independent: 63, independent conditional: 7, independent unconditional: 56, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 265, Positive conditional cache size: 17, Positive unconditional cache size: 248, Negative cache size: 31, Negative conditional cache size: 3, 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: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 80, independent: 66, independent conditional: 20, independent unconditional: 46, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 80, independent: 66, independent conditional: 4, independent unconditional: 62, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 265, Positive conditional cache size: 17, Positive unconditional cache size: 248, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 61 PlacesBefore, 61 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 156, independent conditional: 156, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 156, independent conditional: 53, independent unconditional: 103, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 156, independent conditional: 17, independent unconditional: 139, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 156, independent conditional: 17, independent unconditional: 139, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 191, independent: 153, independent conditional: 14, independent unconditional: 139, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 275, Positive conditional cache size: 20, Positive unconditional cache size: 255, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 958 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 22, independent unconditional: 56, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 78, independent conditional: 4, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 78, independent conditional: 4, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, 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: 100, independent: 78, independent conditional: 4, independent unconditional: 74, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 275, Positive conditional cache size: 20, Positive unconditional cache size: 255, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, 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, 71 PlacesBefore, 71 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 1470 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 306, independent: 280, independent conditional: 280, 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: 306, independent: 280, independent conditional: 138, independent unconditional: 142, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 306, independent: 280, independent conditional: 24, independent unconditional: 256, 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: 306, independent: 280, independent conditional: 24, independent unconditional: 256, 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: 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: 306, independent: 280, independent conditional: 24, independent unconditional: 256, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 275, Positive conditional cache size: 20, Positive unconditional cache size: 255, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 114, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 74 PlacesBefore, 74 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 901, independent: 887, independent conditional: 887, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 901, independent: 887, independent conditional: 631, independent unconditional: 256, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 901, independent: 887, independent conditional: 413, independent unconditional: 474, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 901, independent: 887, independent conditional: 413, independent unconditional: 474, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 4, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 901, independent: 880, independent conditional: 409, independent unconditional: 471, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 351, Positive conditional cache size: 24, Positive unconditional cache size: 327, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 218, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 78 PlacesBefore, 78 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 1200 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 404, independent: 390, independent conditional: 390, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 404, independent: 390, independent conditional: 208, independent unconditional: 182, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 404, independent: 390, independent conditional: 146, independent unconditional: 244, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 404, independent: 390, independent conditional: 146, independent unconditional: 244, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 1, independent unconditional: 5, 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: 404, independent: 384, independent conditional: 145, independent unconditional: 239, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 407, Positive cache size: 376, Positive conditional cache size: 25, Positive unconditional cache size: 351, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 62, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 86 PlacesBefore, 87 PlacesAfterwards, 99 TransitionsBefore, 100 TransitionsAfterwards, 1334 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 41, independent conditional: 41, 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: 41, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 41, independent conditional: 1, independent unconditional: 40, 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: 41, independent: 41, independent conditional: 1, independent unconditional: 40, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 41, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 454, Positive cache size: 423, Positive conditional cache size: 26, Positive unconditional cache size: 397, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 94 PlacesBefore, 94 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 11, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 473, Positive cache size: 442, Positive conditional cache size: 26, Positive unconditional cache size: 416, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, 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.7s, 94 PlacesBefore, 93 PlacesAfterwards, 89 TransitionsBefore, 88 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, independent: 365, independent conditional: 365, 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: 365, independent: 365, independent conditional: 268, independent unconditional: 97, 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: 365, independent: 365, independent conditional: 193, independent unconditional: 172, 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: 365, independent: 365, independent conditional: 193, independent unconditional: 172, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 365, independent: 361, independent conditional: 192, independent unconditional: 169, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 755, Positive conditional cache size: 33, Positive unconditional cache size: 722, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 75, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 85 PlacesBefore, 79 PlacesAfterwards, 73 TransitionsBefore, 67 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 79, independent conditional: 79, 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: 79, independent: 79, independent conditional: 67, independent unconditional: 12, 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: 79, independent: 79, independent conditional: 41, independent unconditional: 38, 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: 79, independent: 79, independent conditional: 41, independent unconditional: 38, 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: 10, independent: 10, independent conditional: 9, independent unconditional: 1, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 79, independent: 69, independent conditional: 32, independent unconditional: 37, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 921, Positive cache size: 890, Positive conditional cache size: 42, Positive unconditional cache size: 848, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 65 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 38 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 44, independent conditional: 44, 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: 44, independent: 44, independent conditional: 43, independent unconditional: 1, 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: 44, independent: 44, independent conditional: 35, independent unconditional: 9, 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: 44, independent: 44, independent conditional: 35, independent unconditional: 9, 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: 22, independent: 22, independent conditional: 21, independent unconditional: 1, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 44, independent: 22, independent conditional: 14, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 21, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1009, Positive cache size: 978, Positive conditional cache size: 63, Positive unconditional cache size: 915, Negative cache size: 31, Negative conditional cache size: 3, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492; [L814] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492, ((void *)0), P0, ((void *)0))=-3, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1493; [L816] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493, ((void *)0), P1, ((void *)0))=-2, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1494; [L818] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494, ((void *)0), P2, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L780] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L780] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 __unbuffered_p2_EAX = z [L741] 3 z = 1 [L744] 3 x = 1 [L756] 3 x = 2 [L759] 3 y = 1 [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L762] 3 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] 3 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] 3 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: 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: 814]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 567 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1577 IncrementalHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 40 mSDtfsCounter, 1577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1146occurred in iteration=13, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 2521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:57:24,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...