/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/mix021_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:19:52,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:19:52,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:19:52,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:19:52,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:19:52,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:19:52,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:19:52,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:19:52,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:19:52,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:19:52,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:19:52,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:19:52,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:19:52,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:19:52,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:19:52,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:19:52,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:19:52,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:19:52,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:19:52,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:19:52,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:19:52,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:19:52,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:19:52,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:19:52,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:19:52,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:19:52,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:19:52,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:19:52,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:19:52,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:19:52,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:19:52,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:19:52,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:19:52,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:19:52,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:19:52,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:19:52,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:19:52,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:19:52,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:19:52,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:19:52,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:19:52,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:19:52,580 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:19:52,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:19:52,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:19:52,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:19:52,583 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:19:52,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:19:52,584 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:19:52,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:19:52,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:19:52,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:19:52,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:19:52,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:19:52,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:19:52,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:19:52,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:19:52,586 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:19:52,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:19:52,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:19:52,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:19:52,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:19:52,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:19:52,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:19:52,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:19:52,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:19:52,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:19:52,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:19:52,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:19:52,588 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:19:52,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:19:53,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:19:53,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:19:53,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:19:53,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:19:53,111 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:19:53,115 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:19:54,457 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:19:54,724 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:19:54,725 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:19:54,740 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bae9f20d/2f51865124c24f73ad3f632d1a90e8ed/FLAGda41745cd [2022-12-06 06:19:54,753 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bae9f20d/2f51865124c24f73ad3f632d1a90e8ed [2022-12-06 06:19:54,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:19:54,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:19:54,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:19:54,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:19:54,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:19:54,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:54" (1/1) ... [2022-12-06 06:19:54,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d8abf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:54, skipping insertion in model container [2022-12-06 06:19:54,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:19:54" (1/1) ... [2022-12-06 06:19:54,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:19:54,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:19:55,007 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:19:55,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:19:55,268 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:19:55,279 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 06:19:55,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:19:55,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:19:55,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:19:55,393 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:19:55,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55 WrapperNode [2022-12-06 06:19:55,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:19:55,395 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:19:55,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:19:55,395 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:19:55,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,471 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-06 06:19:55,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:19:55,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:19:55,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:19:55,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:19:55,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,509 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:19:55,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:19:55,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:19:55,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:19:55,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (1/1) ... [2022-12-06 06:19:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:19:55,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:19:55,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:19:55,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:19:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:19:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:19:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:19:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:19:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:19:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:19:55,605 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:19:55,605 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:19:55,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:19:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:19:55,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:19:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:19:55,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:19:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:19:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:19:55,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:19:55,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:19:55,609 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:19:55,808 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:19:55,809 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:19:56,190 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:19:56,314 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:19:56,315 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:19:56,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:56 BoogieIcfgContainer [2022-12-06 06:19:56,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:19:56,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:19:56,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:19:56,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:19:56,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:19:54" (1/3) ... [2022-12-06 06:19:56,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44375403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:56, skipping insertion in model container [2022-12-06 06:19:56,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:19:55" (2/3) ... [2022-12-06 06:19:56,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44375403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:19:56, skipping insertion in model container [2022-12-06 06:19:56,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:19:56" (3/3) ... [2022-12-06 06:19:56,326 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 06:19:56,343 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:19:56,343 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:19:56,343 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:19:56,431 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:19:56,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:19:56,536 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:19:56,536 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:56,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 06:19:56,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2022-12-06 06:19:56,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2022-12-06 06:19:56,551 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:56,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:19:56,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2022-12-06 06:19:56,623 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-12-06 06:19:56,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:19:56,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 06:19:56,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2022-12-06 06:19:56,637 INFO L188 LiptonReduction]: Number of co-enabled transitions 3164 [2022-12-06 06:20:01,669 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 06:20:01,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:20:01,697 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;@439ee241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:20:01,697 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:20:01,700 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-06 06:20:01,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:01,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:01,701 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 06:20:01,701 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 537909, now seen corresponding path program 1 times [2022-12-06 06:20:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:01,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20330152] [2022-12-06 06:20:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:02,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:02,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20330152] [2022-12-06 06:20:02,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20330152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:02,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:02,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594081050] [2022-12-06 06:20:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:02,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:02,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:20:02,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:02,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:02,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:20:02,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:04,149 INFO L130 PetriNetUnfolder]: 6050/8520 cut-off events. [2022-12-06 06:20:04,149 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 06:20:04,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16919 conditions, 8520 events. 6050/8520 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 46663 event pairs, 1682 based on Foata normal form. 0/7765 useless extension candidates. Maximal degree in co-relation 16907. Up to 6574 conditions per place. [2022-12-06 06:20:04,231 INFO L137 encePairwiseOnDemand]: 31/36 looper letters, 41 selfloop transitions, 2 changer transitions 10/57 dead transitions. [2022-12-06 06:20:04,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 241 flow [2022-12-06 06:20:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-06 06:20:04,241 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:20:04,243 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 70 transitions. [2022-12-06 06:20:04,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 241 flow [2022-12-06 06:20:04,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:20:04,249 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 68 flow [2022-12-06 06:20:04,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-06 06:20:04,254 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2022-12-06 06:20:04,255 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:04,255 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 68 flow [2022-12-06 06:20:04,258 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:04,258 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:04,258 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 68 flow [2022-12-06 06:20:04,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 06:20:04,285 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 06:20:04,286 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:20:04,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:20:04,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 06:20:04,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 06:20:04,615 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:04,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 362 [2022-12-06 06:20:04,617 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 06:20:04,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:04,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:04,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:04,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:20:04,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1640774994, now seen corresponding path program 1 times [2022-12-06 06:20:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:04,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207804909] [2022-12-06 06:20:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:04,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207804909] [2022-12-06 06:20:04,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207804909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:04,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:04,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:04,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093757718] [2022-12-06 06:20:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:04,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:04,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:04,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:04,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:04,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:20:04,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:04,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:04,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:20:04,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:07,491 INFO L130 PetriNetUnfolder]: 16243/22100 cut-off events. [2022-12-06 06:20:07,491 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2022-12-06 06:20:07,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45716 conditions, 22100 events. 16243/22100 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 117840 event pairs, 5739 based on Foata normal form. 634/22734 useless extension candidates. Maximal degree in co-relation 45706. Up to 13082 conditions per place. [2022-12-06 06:20:07,645 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-12-06 06:20:07,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2022-12-06 06:20:07,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 06:20:07,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 06:20:07,648 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 52 transitions. [2022-12-06 06:20:07,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2022-12-06 06:20:07,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:07,651 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 126 flow [2022-12-06 06:20:07,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2022-12-06 06:20:07,652 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2022-12-06 06:20:07,652 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:07,652 INFO L89 Accepts]: Start accepts. Operand has 41 places, 35 transitions, 126 flow [2022-12-06 06:20:07,653 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:07,653 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:07,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-06 06:20:07,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 126 flow [2022-12-06 06:20:07,722 INFO L130 PetriNetUnfolder]: 276/697 cut-off events. [2022-12-06 06:20:07,722 INFO L131 PetriNetUnfolder]: For 86/114 co-relation queries the response was YES. [2022-12-06 06:20:07,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 697 events. 276/697 cut-off events. For 86/114 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4714 event pairs, 120 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 1348. Up to 325 conditions per place. [2022-12-06 06:20:07,730 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 35 transitions, 126 flow [2022-12-06 06:20:07,730 INFO L188 LiptonReduction]: Number of co-enabled transitions 524 [2022-12-06 06:20:07,802 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:07,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 06:20:07,804 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 126 flow [2022-12-06 06:20:07,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:07,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:07,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:07,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:20:07,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -675583943, now seen corresponding path program 1 times [2022-12-06 06:20:07,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:07,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893186269] [2022-12-06 06:20:07,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:07,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:07,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893186269] [2022-12-06 06:20:07,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893186269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:07,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:07,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:20:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785331128] [2022-12-06 06:20:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:07,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:20:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:07,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:20:07,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:20:07,982 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:20:07,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:07,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:07,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:20:07,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:09,780 INFO L130 PetriNetUnfolder]: 12937/18361 cut-off events. [2022-12-06 06:20:09,781 INFO L131 PetriNetUnfolder]: For 7093/7259 co-relation queries the response was YES. [2022-12-06 06:20:09,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44462 conditions, 18361 events. 12937/18361 cut-off events. For 7093/7259 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 110684 event pairs, 3167 based on Foata normal form. 76/17974 useless extension candidates. Maximal degree in co-relation 44450. Up to 16076 conditions per place. [2022-12-06 06:20:09,938 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 44 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2022-12-06 06:20:09,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 292 flow [2022-12-06 06:20:09,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:20:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:20:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 06:20:09,940 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:20:09,940 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 126 flow. Second operand 3 states and 51 transitions. [2022-12-06 06:20:09,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 292 flow [2022-12-06 06:20:09,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:20:09,975 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 151 flow [2022-12-06 06:20:09,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2022-12-06 06:20:09,976 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2022-12-06 06:20:09,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:09,979 INFO L89 Accepts]: Start accepts. Operand has 42 places, 39 transitions, 151 flow [2022-12-06 06:20:09,981 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:09,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:09,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 151 flow [2022-12-06 06:20:09,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 151 flow [2022-12-06 06:20:10,040 INFO L130 PetriNetUnfolder]: 231/599 cut-off events. [2022-12-06 06:20:10,041 INFO L131 PetriNetUnfolder]: For 91/174 co-relation queries the response was YES. [2022-12-06 06:20:10,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 599 events. 231/599 cut-off events. For 91/174 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3857 event pairs, 79 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 1130. Up to 278 conditions per place. [2022-12-06 06:20:10,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 151 flow [2022-12-06 06:20:10,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 596 [2022-12-06 06:20:10,092 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:10,093 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 06:20:10,093 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 151 flow [2022-12-06 06:20:10,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:10,093 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:10,094 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:10,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:20:10,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:10,094 INFO L85 PathProgramCache]: Analyzing trace with hash -675582021, now seen corresponding path program 1 times [2022-12-06 06:20:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:10,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897632658] [2022-12-06 06:20:10,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:10,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897632658] [2022-12-06 06:20:10,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897632658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:10,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:10,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:20:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904909379] [2022-12-06 06:20:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:10,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:10,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:20:10,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 151 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:10,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:10,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:20:10,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:11,829 INFO L130 PetriNetUnfolder]: 15523/21126 cut-off events. [2022-12-06 06:20:11,829 INFO L131 PetriNetUnfolder]: For 7346/7346 co-relation queries the response was YES. [2022-12-06 06:20:11,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52877 conditions, 21126 events. 15523/21126 cut-off events. For 7346/7346 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 112257 event pairs, 2979 based on Foata normal form. 48/21174 useless extension candidates. Maximal degree in co-relation 52864. Up to 11932 conditions per place. [2022-12-06 06:20:11,932 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 65 selfloop transitions, 14 changer transitions 0/79 dead transitions. [2022-12-06 06:20:11,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 425 flow [2022-12-06 06:20:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:20:11,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-06 06:20:11,933 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 151 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:20:11,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 79 transitions, 425 flow [2022-12-06 06:20:11,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:20:11,937 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 226 flow [2022-12-06 06:20:11,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2022-12-06 06:20:11,938 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2022-12-06 06:20:11,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:11,939 INFO L89 Accepts]: Start accepts. Operand has 46 places, 45 transitions, 226 flow [2022-12-06 06:20:11,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:11,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:11,940 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 45 transitions, 226 flow [2022-12-06 06:20:11,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 45 transitions, 226 flow [2022-12-06 06:20:11,982 INFO L130 PetriNetUnfolder]: 205/543 cut-off events. [2022-12-06 06:20:11,983 INFO L131 PetriNetUnfolder]: For 418/609 co-relation queries the response was YES. [2022-12-06 06:20:11,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 543 events. 205/543 cut-off events. For 418/609 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3470 event pairs, 57 based on Foata normal form. 1/526 useless extension candidates. Maximal degree in co-relation 1328. Up to 246 conditions per place. [2022-12-06 06:20:11,988 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 45 transitions, 226 flow [2022-12-06 06:20:11,988 INFO L188 LiptonReduction]: Number of co-enabled transitions 676 [2022-12-06 06:20:12,002 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:12,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-06 06:20:12,011 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 226 flow [2022-12-06 06:20:12,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:12,012 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:12,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:12,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:20:12,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:12,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash 531734964, now seen corresponding path program 1 times [2022-12-06 06:20:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:12,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507956855] [2022-12-06 06:20:12,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:12,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:12,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507956855] [2022-12-06 06:20:12,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507956855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:12,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:12,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:20:12,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739671873] [2022-12-06 06:20:12,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:12,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:12,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:20:12,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 226 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:12,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:12,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:20:12,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:13,824 INFO L130 PetriNetUnfolder]: 14589/19864 cut-off events. [2022-12-06 06:20:13,824 INFO L131 PetriNetUnfolder]: For 18989/18989 co-relation queries the response was YES. [2022-12-06 06:20:13,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55780 conditions, 19864 events. 14589/19864 cut-off events. For 18989/18989 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 100058 event pairs, 3828 based on Foata normal form. 184/20048 useless extension candidates. Maximal degree in co-relation 55764. Up to 8543 conditions per place. [2022-12-06 06:20:13,944 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 67 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2022-12-06 06:20:13,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 532 flow [2022-12-06 06:20:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:13,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 06:20:13,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2022-12-06 06:20:13,947 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 226 flow. Second operand 4 states and 60 transitions. [2022-12-06 06:20:13,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 532 flow [2022-12-06 06:20:13,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 532 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:20:13,983 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 361 flow [2022-12-06 06:20:13,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=361, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2022-12-06 06:20:13,984 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2022-12-06 06:20:13,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:13,984 INFO L89 Accepts]: Start accepts. Operand has 52 places, 53 transitions, 361 flow [2022-12-06 06:20:13,985 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:13,985 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:13,985 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 53 transitions, 361 flow [2022-12-06 06:20:13,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 361 flow [2022-12-06 06:20:14,033 INFO L130 PetriNetUnfolder]: 173/469 cut-off events. [2022-12-06 06:20:14,033 INFO L131 PetriNetUnfolder]: For 877/1059 co-relation queries the response was YES. [2022-12-06 06:20:14,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 469 events. 173/469 cut-off events. For 877/1059 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2824 event pairs, 36 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 1446. Up to 210 conditions per place. [2022-12-06 06:20:14,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 361 flow [2022-12-06 06:20:14,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-06 06:20:14,048 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:14,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-06 06:20:14,049 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 361 flow [2022-12-06 06:20:14,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:14,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:14,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:14,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:20:14,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:14,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1970208466, now seen corresponding path program 1 times [2022-12-06 06:20:14,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:14,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617230025] [2022-12-06 06:20:14,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:14,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:14,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617230025] [2022-12-06 06:20:14,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617230025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:14,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:14,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:20:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294494514] [2022-12-06 06:20:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:14,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:14,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:14,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:14,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:20:14,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 361 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:14,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:14,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:20:14,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:16,846 INFO L130 PetriNetUnfolder]: 19688/27036 cut-off events. [2022-12-06 06:20:16,847 INFO L131 PetriNetUnfolder]: For 43592/43592 co-relation queries the response was YES. [2022-12-06 06:20:16,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80132 conditions, 27036 events. 19688/27036 cut-off events. For 43592/43592 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 150936 event pairs, 3657 based on Foata normal form. 300/27336 useless extension candidates. Maximal degree in co-relation 80111. Up to 12108 conditions per place. [2022-12-06 06:20:16,956 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 66 selfloop transitions, 24 changer transitions 4/94 dead transitions. [2022-12-06 06:20:16,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 94 transitions, 699 flow [2022-12-06 06:20:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 06:20:16,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2022-12-06 06:20:16,957 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 361 flow. Second operand 4 states and 73 transitions. [2022-12-06 06:20:16,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 94 transitions, 699 flow [2022-12-06 06:20:17,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 94 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:20:17,144 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 495 flow [2022-12-06 06:20:17,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=495, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2022-12-06 06:20:17,145 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2022-12-06 06:20:17,145 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:17,145 INFO L89 Accepts]: Start accepts. Operand has 57 places, 56 transitions, 495 flow [2022-12-06 06:20:17,146 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:17,146 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:17,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 56 transitions, 495 flow [2022-12-06 06:20:17,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 495 flow [2022-12-06 06:20:17,180 INFO L130 PetriNetUnfolder]: 160/507 cut-off events. [2022-12-06 06:20:17,180 INFO L131 PetriNetUnfolder]: For 1468/1709 co-relation queries the response was YES. [2022-12-06 06:20:17,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1809 conditions, 507 events. 160/507 cut-off events. For 1468/1709 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3345 event pairs, 40 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 1787. Up to 214 conditions per place. [2022-12-06 06:20:17,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 56 transitions, 495 flow [2022-12-06 06:20:17,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 808 [2022-12-06 06:20:17,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:20:17,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 06:20:17,191 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 495 flow [2022-12-06 06:20:17,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:17,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:17,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:17,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:20:17,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:17,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash 566688022, now seen corresponding path program 1 times [2022-12-06 06:20:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:17,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543542978] [2022-12-06 06:20:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:17,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:17,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543542978] [2022-12-06 06:20:17,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543542978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:17,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:17,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:20:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652070591] [2022-12-06 06:20:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:17,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 28 [2022-12-06 06:20:17,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 56 transitions, 495 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:17,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:17,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 28 [2022-12-06 06:20:17,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:19,021 INFO L130 PetriNetUnfolder]: 11953/17704 cut-off events. [2022-12-06 06:20:19,021 INFO L131 PetriNetUnfolder]: For 36671/37943 co-relation queries the response was YES. [2022-12-06 06:20:19,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51488 conditions, 17704 events. 11953/17704 cut-off events. For 36671/37943 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 115995 event pairs, 1992 based on Foata normal form. 1724/19069 useless extension candidates. Maximal degree in co-relation 51463. Up to 11065 conditions per place. [2022-12-06 06:20:19,122 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 104 selfloop transitions, 10 changer transitions 0/134 dead transitions. [2022-12-06 06:20:19,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 134 transitions, 1285 flow [2022-12-06 06:20:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:20:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:20:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-06 06:20:19,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2022-12-06 06:20:19,126 INFO L175 Difference]: Start difference. First operand has 57 places, 56 transitions, 495 flow. Second operand 5 states and 92 transitions. [2022-12-06 06:20:19,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 134 transitions, 1285 flow [2022-12-06 06:20:19,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 134 transitions, 1261 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-06 06:20:19,174 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 564 flow [2022-12-06 06:20:19,174 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=564, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2022-12-06 06:20:19,174 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-06 06:20:19,175 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:19,175 INFO L89 Accepts]: Start accepts. Operand has 64 places, 65 transitions, 564 flow [2022-12-06 06:20:19,177 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:19,177 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:19,177 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 65 transitions, 564 flow [2022-12-06 06:20:19,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 65 transitions, 564 flow [2022-12-06 06:20:19,346 INFO L130 PetriNetUnfolder]: 1144/2339 cut-off events. [2022-12-06 06:20:19,346 INFO L131 PetriNetUnfolder]: For 3672/4502 co-relation queries the response was YES. [2022-12-06 06:20:19,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 2339 events. 1144/2339 cut-off events. For 3672/4502 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 19399 event pairs, 506 based on Foata normal form. 26/2147 useless extension candidates. Maximal degree in co-relation 7452. Up to 1518 conditions per place. [2022-12-06 06:20:19,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 65 transitions, 564 flow [2022-12-06 06:20:19,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 1240 [2022-12-06 06:20:19,386 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L871-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_16 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_57 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_16, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [481] L811-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P2Thread1of1ForFork2_#res.offset_23| 0) (= |v_P2Thread1of1ForFork2_#res.base_23| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_23|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-06 06:20:19,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L871-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_16 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_57 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_16, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [518] L847-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_185 (+ v_~__unbuffered_cnt~0_186 1)) (= |v_P3Thread1of1ForFork0_#res.offset_25| 0) (= |v_P3Thread1of1ForFork0_#res.base_25| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_25|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:20:19,451 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L871-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_16 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_57 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_16, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [516] L791-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.base_19| 0) (= |v_P1Thread1of1ForFork1_#res.offset_19| 0) (= v_~__unbuffered_cnt~0_163 (+ v_~__unbuffered_cnt~0_164 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_164} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-06 06:20:19,482 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [438] L871-3-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25| (mod v_~main$tmp_guard0~0_16 256)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_57 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_17|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_16, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_11|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_25|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [517] L771-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_177 (+ v_~__unbuffered_cnt~0_178 1)) (= |v_P0Thread1of1ForFork3_#res#1.base_7| 0) (= |v_P0Thread1of1ForFork3_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_178} OutVars{P0Thread1of1ForFork3_#res#1.offset=|v_P0Thread1of1ForFork3_#res#1.offset_7|, P0Thread1of1ForFork3_#res#1.base=|v_P0Thread1of1ForFork3_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_177} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res#1.offset, P0Thread1of1ForFork3_#res#1.base, ~__unbuffered_cnt~0] [2022-12-06 06:20:19,599 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:19,600 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 425 [2022-12-06 06:20:19,600 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 574 flow [2022-12-06 06:20:19,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:19,600 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:19,600 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:19,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:20:19,600 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 935606985, now seen corresponding path program 1 times [2022-12-06 06:20:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70228501] [2022-12-06 06:20:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:19,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:19,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70228501] [2022-12-06 06:20:19,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70228501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:19,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:19,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:20:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889985833] [2022-12-06 06:20:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:19,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:19,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:19,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:20:19,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 574 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:19,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:19,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:20:19,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:23,248 INFO L130 PetriNetUnfolder]: 18118/26765 cut-off events. [2022-12-06 06:20:23,248 INFO L131 PetriNetUnfolder]: For 78585/79874 co-relation queries the response was YES. [2022-12-06 06:20:23,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102587 conditions, 26765 events. 18118/26765 cut-off events. For 78585/79874 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 181500 event pairs, 3232 based on Foata normal form. 694/27227 useless extension candidates. Maximal degree in co-relation 102557. Up to 13611 conditions per place. [2022-12-06 06:20:23,456 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 84 selfloop transitions, 4 changer transitions 18/118 dead transitions. [2022-12-06 06:20:23,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 1177 flow [2022-12-06 06:20:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:23,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:20:23,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:20:23,480 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 574 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:20:23,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 1177 flow [2022-12-06 06:20:23,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 118 transitions, 1143 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 06:20:23,660 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 586 flow [2022-12-06 06:20:23,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=586, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2022-12-06 06:20:23,661 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-06 06:20:23,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:23,661 INFO L89 Accepts]: Start accepts. Operand has 67 places, 65 transitions, 586 flow [2022-12-06 06:20:23,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:23,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:23,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 65 transitions, 586 flow [2022-12-06 06:20:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 65 transitions, 586 flow [2022-12-06 06:20:23,959 INFO L130 PetriNetUnfolder]: 1726/3483 cut-off events. [2022-12-06 06:20:23,959 INFO L131 PetriNetUnfolder]: For 5592/6907 co-relation queries the response was YES. [2022-12-06 06:20:23,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11074 conditions, 3483 events. 1726/3483 cut-off events. For 5592/6907 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 30479 event pairs, 776 based on Foata normal form. 14/3084 useless extension candidates. Maximal degree in co-relation 11045. Up to 2497 conditions per place. [2022-12-06 06:20:24,020 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 65 transitions, 586 flow [2022-12-06 06:20:24,020 INFO L188 LiptonReduction]: Number of co-enabled transitions 1176 [2022-12-06 06:20:24,382 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:24,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 722 [2022-12-06 06:20:24,383 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 589 flow [2022-12-06 06:20:24,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:24,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:24,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:24,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:20:24,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash 390873387, now seen corresponding path program 1 times [2022-12-06 06:20:24,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:24,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080707833] [2022-12-06 06:20:24,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:24,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080707833] [2022-12-06 06:20:24,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080707833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:24,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:24,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:20:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627613861] [2022-12-06 06:20:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:24,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:20:24,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:20:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:20:24,551 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 06:20:24,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 589 flow. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:24,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:24,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 06:20:24,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:30,843 INFO L130 PetriNetUnfolder]: 28705/41852 cut-off events. [2022-12-06 06:20:30,843 INFO L131 PetriNetUnfolder]: For 140845/140845 co-relation queries the response was YES. [2022-12-06 06:20:31,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162320 conditions, 41852 events. 28705/41852 cut-off events. For 140845/140845 co-relation queries the response was YES. Maximal size of possible extension queue 1819. Compared 285718 event pairs, 7818 based on Foata normal form. 168/42020 useless extension candidates. Maximal degree in co-relation 162288. Up to 21743 conditions per place. [2022-12-06 06:20:31,405 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 85 selfloop transitions, 21 changer transitions 21/127 dead transitions. [2022-12-06 06:20:31,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 127 transitions, 1208 flow [2022-12-06 06:20:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:20:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:20:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-06 06:20:31,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2022-12-06 06:20:31,408 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 589 flow. Second operand 4 states and 87 transitions. [2022-12-06 06:20:31,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 127 transitions, 1208 flow [2022-12-06 06:20:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 127 transitions, 1204 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:20:31,774 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 671 flow [2022-12-06 06:20:31,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=671, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2022-12-06 06:20:31,791 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 24 predicate places. [2022-12-06 06:20:31,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:31,791 INFO L89 Accepts]: Start accepts. Operand has 72 places, 62 transitions, 671 flow [2022-12-06 06:20:31,796 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:31,796 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:31,796 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 62 transitions, 671 flow [2022-12-06 06:20:31,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 671 flow [2022-12-06 06:20:32,261 INFO L130 PetriNetUnfolder]: 1834/3548 cut-off events. [2022-12-06 06:20:32,263 INFO L131 PetriNetUnfolder]: For 6572/7438 co-relation queries the response was YES. [2022-12-06 06:20:32,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11348 conditions, 3548 events. 1834/3548 cut-off events. For 6572/7438 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 29531 event pairs, 943 based on Foata normal form. 8/3208 useless extension candidates. Maximal degree in co-relation 11315. Up to 2541 conditions per place. [2022-12-06 06:20:32,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 62 transitions, 671 flow [2022-12-06 06:20:32,312 INFO L188 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-06 06:20:32,487 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:32,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 697 [2022-12-06 06:20:32,489 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 673 flow [2022-12-06 06:20:32,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:32,489 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:32,489 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:32,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:20:32,489 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826040, now seen corresponding path program 1 times [2022-12-06 06:20:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:32,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138042919] [2022-12-06 06:20:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:32,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138042919] [2022-12-06 06:20:32,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138042919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:32,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:32,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:20:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832315480] [2022-12-06 06:20:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:32,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:20:32,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:20:32,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:20:32,822 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:20:32,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-06 06:20:32,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:32,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:20:32,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:36,174 INFO L130 PetriNetUnfolder]: 12245/19118 cut-off events. [2022-12-06 06:20:36,175 INFO L131 PetriNetUnfolder]: For 50091/50767 co-relation queries the response was YES. [2022-12-06 06:20:36,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67807 conditions, 19118 events. 12245/19118 cut-off events. For 50091/50767 co-relation queries the response was YES. Maximal size of possible extension queue 1101. Compared 138239 event pairs, 1545 based on Foata normal form. 2132/20938 useless extension candidates. Maximal degree in co-relation 67771. Up to 7835 conditions per place. [2022-12-06 06:20:36,323 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 124 selfloop transitions, 14 changer transitions 11/167 dead transitions. [2022-12-06 06:20:36,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 167 transitions, 1917 flow [2022-12-06 06:20:36,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:20:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:20:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-12-06 06:20:36,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6611111111111111 [2022-12-06 06:20:36,330 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 673 flow. Second operand 6 states and 119 transitions. [2022-12-06 06:20:36,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 167 transitions, 1917 flow [2022-12-06 06:20:36,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 167 transitions, 1901 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 06:20:36,790 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 766 flow [2022-12-06 06:20:36,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2022-12-06 06:20:36,793 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2022-12-06 06:20:36,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:36,793 INFO L89 Accepts]: Start accepts. Operand has 78 places, 70 transitions, 766 flow [2022-12-06 06:20:36,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:36,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:36,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 70 transitions, 766 flow [2022-12-06 06:20:36,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 70 transitions, 766 flow [2022-12-06 06:20:37,250 INFO L130 PetriNetUnfolder]: 1426/3032 cut-off events. [2022-12-06 06:20:37,250 INFO L131 PetriNetUnfolder]: For 9510/11678 co-relation queries the response was YES. [2022-12-06 06:20:37,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13961 conditions, 3032 events. 1426/3032 cut-off events. For 9510/11678 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 26223 event pairs, 287 based on Foata normal form. 71/2941 useless extension candidates. Maximal degree in co-relation 13924. Up to 2304 conditions per place. [2022-12-06 06:20:37,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 70 transitions, 766 flow [2022-12-06 06:20:37,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 1348 [2022-12-06 06:20:37,563 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:37,564 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 771 [2022-12-06 06:20:37,564 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 758 flow [2022-12-06 06:20:37,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-06 06:20:37,564 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:37,564 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:37,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:20:37,565 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:37,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:37,565 INFO L85 PathProgramCache]: Analyzing trace with hash -79078822, now seen corresponding path program 1 times [2022-12-06 06:20:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:37,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520028621] [2022-12-06 06:20:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:37,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520028621] [2022-12-06 06:20:37,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520028621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:37,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:37,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:20:37,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491202272] [2022-12-06 06:20:37,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:37,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:20:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:37,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:20:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:20:37,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:20:37,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 758 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:37,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:37,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:20:37,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:39,223 INFO L130 PetriNetUnfolder]: 6946/11228 cut-off events. [2022-12-06 06:20:39,223 INFO L131 PetriNetUnfolder]: For 37694/37950 co-relation queries the response was YES. [2022-12-06 06:20:39,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46698 conditions, 11228 events. 6946/11228 cut-off events. For 37694/37950 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 78313 event pairs, 1125 based on Foata normal form. 907/11913 useless extension candidates. Maximal degree in co-relation 46658. Up to 4416 conditions per place. [2022-12-06 06:20:39,266 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 97 selfloop transitions, 17 changer transitions 52/179 dead transitions. [2022-12-06 06:20:39,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 179 transitions, 2058 flow [2022-12-06 06:20:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:20:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:20:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2022-12-06 06:20:39,268 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6523809523809524 [2022-12-06 06:20:39,268 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 758 flow. Second operand 7 states and 137 transitions. [2022-12-06 06:20:39,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 179 transitions, 2058 flow [2022-12-06 06:20:39,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 179 transitions, 1994 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-12-06 06:20:39,659 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 683 flow [2022-12-06 06:20:39,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=683, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2022-12-06 06:20:39,660 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places. [2022-12-06 06:20:39,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:39,660 INFO L89 Accepts]: Start accepts. Operand has 81 places, 65 transitions, 683 flow [2022-12-06 06:20:39,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:39,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:39,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 65 transitions, 683 flow [2022-12-06 06:20:39,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 65 transitions, 683 flow [2022-12-06 06:20:39,763 INFO L130 PetriNetUnfolder]: 564/1549 cut-off events. [2022-12-06 06:20:39,763 INFO L131 PetriNetUnfolder]: For 5507/6077 co-relation queries the response was YES. [2022-12-06 06:20:39,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7118 conditions, 1549 events. 564/1549 cut-off events. For 5507/6077 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 13369 event pairs, 48 based on Foata normal form. 23/1497 useless extension candidates. Maximal degree in co-relation 7080. Up to 1029 conditions per place. [2022-12-06 06:20:39,782 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 65 transitions, 683 flow [2022-12-06 06:20:39,783 INFO L188 LiptonReduction]: Number of co-enabled transitions 982 [2022-12-06 06:20:39,856 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:39,857 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-06 06:20:39,857 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 673 flow [2022-12-06 06:20:39,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:39,858 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:39,858 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:39,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:20:39,858 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:39,858 INFO L85 PathProgramCache]: Analyzing trace with hash 622401596, now seen corresponding path program 1 times [2022-12-06 06:20:39,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630615531] [2022-12-06 06:20:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:40,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:40,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:40,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630615531] [2022-12-06 06:20:40,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630615531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:40,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:40,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:20:40,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959060016] [2022-12-06 06:20:40,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:40,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:20:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:40,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:20:40,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:20:40,597 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:20:40,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 673 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:40,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:40,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:20:40,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:42,271 INFO L130 PetriNetUnfolder]: 7920/13399 cut-off events. [2022-12-06 06:20:42,272 INFO L131 PetriNetUnfolder]: For 53692/53821 co-relation queries the response was YES. [2022-12-06 06:20:42,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56501 conditions, 13399 events. 7920/13399 cut-off events. For 53692/53821 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 103162 event pairs, 1384 based on Foata normal form. 80/13310 useless extension candidates. Maximal degree in co-relation 56460. Up to 4939 conditions per place. [2022-12-06 06:20:42,324 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 108 selfloop transitions, 7 changer transitions 59/187 dead transitions. [2022-12-06 06:20:42,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 187 transitions, 2088 flow [2022-12-06 06:20:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:20:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:20:42,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-06 06:20:42,326 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-06 06:20:42,326 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 673 flow. Second operand 7 states and 119 transitions. [2022-12-06 06:20:42,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 187 transitions, 2088 flow [2022-12-06 06:20:42,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 187 transitions, 1745 flow, removed 71 selfloop flow, removed 8 redundant places. [2022-12-06 06:20:42,801 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 574 flow [2022-12-06 06:20:42,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2022-12-06 06:20:42,802 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 32 predicate places. [2022-12-06 06:20:42,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:42,802 INFO L89 Accepts]: Start accepts. Operand has 80 places, 66 transitions, 574 flow [2022-12-06 06:20:42,803 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:42,803 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:42,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 66 transitions, 574 flow [2022-12-06 06:20:42,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 66 transitions, 574 flow [2022-12-06 06:20:42,965 INFO L130 PetriNetUnfolder]: 986/2390 cut-off events. [2022-12-06 06:20:42,965 INFO L131 PetriNetUnfolder]: For 5411/5633 co-relation queries the response was YES. [2022-12-06 06:20:42,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8503 conditions, 2390 events. 986/2390 cut-off events. For 5411/5633 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 20540 event pairs, 67 based on Foata normal form. 33/2262 useless extension candidates. Maximal degree in co-relation 8467. Up to 988 conditions per place. [2022-12-06 06:20:42,986 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 66 transitions, 574 flow [2022-12-06 06:20:42,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 950 [2022-12-06 06:20:43,144 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:20:43,146 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 344 [2022-12-06 06:20:43,146 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 580 flow [2022-12-06 06:20:43,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:43,146 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:43,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:43,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:20:43,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1091780702, now seen corresponding path program 2 times [2022-12-06 06:20:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:43,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6772928] [2022-12-06 06:20:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:43,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:43,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6772928] [2022-12-06 06:20:43,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6772928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:43,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:43,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:20:43,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82786296] [2022-12-06 06:20:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:43,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:20:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:43,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:20:43,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:20:43,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:20:43,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 580 flow. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:43,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:43,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:20:43,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:45,596 INFO L130 PetriNetUnfolder]: 6073/10159 cut-off events. [2022-12-06 06:20:45,596 INFO L131 PetriNetUnfolder]: For 23788/23988 co-relation queries the response was YES. [2022-12-06 06:20:45,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40891 conditions, 10159 events. 6073/10159 cut-off events. For 23788/23988 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 74414 event pairs, 959 based on Foata normal form. 350/10310 useless extension candidates. Maximal degree in co-relation 40855. Up to 3818 conditions per place. [2022-12-06 06:20:45,653 INFO L137 encePairwiseOnDemand]: 23/31 looper letters, 58 selfloop transitions, 17 changer transitions 72/151 dead transitions. [2022-12-06 06:20:45,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 151 transitions, 1494 flow [2022-12-06 06:20:45,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:20:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:20:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2022-12-06 06:20:45,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2022-12-06 06:20:45,654 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 580 flow. Second operand 8 states and 128 transitions. [2022-12-06 06:20:45,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 151 transitions, 1494 flow [2022-12-06 06:20:46,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 151 transitions, 1462 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 06:20:46,246 INFO L231 Difference]: Finished difference. Result has 85 places, 42 transitions, 315 flow [2022-12-06 06:20:46,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=315, PETRI_PLACES=85, PETRI_TRANSITIONS=42} [2022-12-06 06:20:46,247 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 37 predicate places. [2022-12-06 06:20:46,248 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:46,248 INFO L89 Accepts]: Start accepts. Operand has 85 places, 42 transitions, 315 flow [2022-12-06 06:20:46,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:46,249 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:46,249 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 42 transitions, 315 flow [2022-12-06 06:20:46,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 42 transitions, 315 flow [2022-12-06 06:20:46,261 INFO L130 PetriNetUnfolder]: 34/104 cut-off events. [2022-12-06 06:20:46,261 INFO L131 PetriNetUnfolder]: For 160/170 co-relation queries the response was YES. [2022-12-06 06:20:46,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 104 events. 34/104 cut-off events. For 160/170 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 321 event pairs, 1 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 390. Up to 36 conditions per place. [2022-12-06 06:20:46,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 42 transitions, 315 flow [2022-12-06 06:20:46,263 INFO L188 LiptonReduction]: Number of co-enabled transitions 364 [2022-12-06 06:20:48,278 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 06:20:48,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2032 [2022-12-06 06:20:48,280 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 35 transitions, 287 flow [2022-12-06 06:20:48,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:48,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:48,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:48,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:20:48,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:48,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1092188678, now seen corresponding path program 1 times [2022-12-06 06:20:48,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:48,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850619015] [2022-12-06 06:20:48,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:48,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:20:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:20:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:20:49,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850619015] [2022-12-06 06:20:49,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850619015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:20:49,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:20:49,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:20:49,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427697872] [2022-12-06 06:20:49,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:20:49,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 06:20:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:20:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 06:20:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 06:20:49,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 06:20:49,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 35 transitions, 287 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:49,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:20:49,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 06:20:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:20:49,934 INFO L130 PetriNetUnfolder]: 450/723 cut-off events. [2022-12-06 06:20:49,935 INFO L131 PetriNetUnfolder]: For 2249/2249 co-relation queries the response was YES. [2022-12-06 06:20:49,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 723 events. 450/723 cut-off events. For 2249/2249 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2742 event pairs, 62 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 3114. Up to 452 conditions per place. [2022-12-06 06:20:49,940 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 47 selfloop transitions, 5 changer transitions 27/79 dead transitions. [2022-12-06 06:20:49,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 743 flow [2022-12-06 06:20:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:20:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:20:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-12-06 06:20:49,942 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 06:20:49,942 INFO L175 Difference]: Start difference. First operand has 74 places, 35 transitions, 287 flow. Second operand 6 states and 49 transitions. [2022-12-06 06:20:49,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 743 flow [2022-12-06 06:20:49,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 539 flow, removed 40 selfloop flow, removed 25 redundant places. [2022-12-06 06:20:49,949 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 193 flow [2022-12-06 06:20:49,949 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2022-12-06 06:20:49,950 INFO L294 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2022-12-06 06:20:49,950 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:20:49,951 INFO L89 Accepts]: Start accepts. Operand has 55 places, 35 transitions, 193 flow [2022-12-06 06:20:49,952 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:20:49,952 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:20:49,952 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 35 transitions, 193 flow [2022-12-06 06:20:49,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 35 transitions, 193 flow [2022-12-06 06:20:49,960 INFO L130 PetriNetUnfolder]: 28/73 cut-off events. [2022-12-06 06:20:49,961 INFO L131 PetriNetUnfolder]: For 136/144 co-relation queries the response was YES. [2022-12-06 06:20:49,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 73 events. 28/73 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 208. Up to 24 conditions per place. [2022-12-06 06:20:49,976 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 35 transitions, 193 flow [2022-12-06 06:20:49,976 INFO L188 LiptonReduction]: Number of co-enabled transitions 246 [2022-12-06 06:20:50,442 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [379] L764-->L771: Formula: (let ((.cse4 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd1~0_25 256) 0))) (.cse3 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and (not (= (mod v_~a$w_buff1_used~0_105 256) 0)) .cse4)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~a$w_buff1_used~0_105) v_~a$w_buff1_used~0_104) (= v_~a$r_buff0_thd1~0_24 (ite .cse1 0 v_~a$r_buff0_thd1~0_25)) (= v_~a~0_66 (ite .cse2 v_~a$w_buff0~0_38 (ite .cse0 v_~a$w_buff1~0_37 v_~a~0_67))) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd1~0_24 256) 0)) .cse3) (and (not (= (mod v_~a$w_buff1_used~0_104 256) 0)) .cse4)) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17)))) InVars {~a~0=v_~a~0_67, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_105} OutVars{~a~0=v_~a~0_66, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$w_buff0~0=v_~a$w_buff0~0_38, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_24, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_104} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0] and [534] L871-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd0~0_221 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_635 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_212 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_636 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_565 256) 0)) .cse0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_111|) (= (mod v_~main$tmp_guard0~0_84 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|) (= v_~a$r_buff1_thd0~0_220 (ite (or (and (not (= 0 (mod v_~a$w_buff1_used~0_564 256))) .cse0) (and (not (= (mod v_~a$r_buff0_thd0~0_211 256) 0)) .cse1)) 0 v_~a$r_buff1_thd0~0_221)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_307 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_84) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_111| 0)) (= v_~a~0_499 (ite .cse2 v_~a$w_buff0~0_364 (ite .cse3 v_~a$w_buff1~0_301 v_~a~0_500))) (= v_~a$r_buff0_thd0~0_211 (ite .cse4 0 v_~a$r_buff0_thd0~0_212)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~a$w_buff0_used~0_635 (ite .cse2 0 v_~a$w_buff0_used~0_636)) (= (ite (= (ite (not (and (= v_~y~0_117 2) (= 2 v_~x~0_108) (= v_~__unbuffered_p3_EAX~0_90 1) (= v_~__unbuffered_p3_EBX~0_114 0) (= v_~__unbuffered_p2_EAX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_80) (= v_~a$w_buff1_used~0_564 (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_565))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_636, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_212, ~a~0=v_~a~0_500, ~a$w_buff1~0=v_~a$w_buff1~0_301, ~a$w_buff0~0=v_~a$w_buff0~0_364, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_221, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_307, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_565, ~y~0=v_~y~0_117, ~x~0=v_~x~0_108} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_93|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_635, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_81|, ~a~0=v_~a~0_499, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~a$w_buff1~0=v_~a$w_buff1~0_301, ~a$w_buff0~0=v_~a$w_buff0~0_364, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_111|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_220, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_307, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_564, ~y~0=v_~y~0_117, ~x~0=v_~x~0_108, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:20:51,104 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [534] L871-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd0~0_221 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_635 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd0~0_212 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_636 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_565 256) 0)) .cse0))) (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_111|) (= (mod v_~main$tmp_guard0~0_84 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|) (= v_~a$r_buff1_thd0~0_220 (ite (or (and (not (= 0 (mod v_~a$w_buff1_used~0_564 256))) .cse0) (and (not (= (mod v_~a$r_buff0_thd0~0_211 256) 0)) .cse1)) 0 v_~a$r_buff1_thd0~0_221)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_307 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_84) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_111| 0)) (= v_~a~0_499 (ite .cse2 v_~a$w_buff0~0_364 (ite .cse3 v_~a$w_buff1~0_301 v_~a~0_500))) (= v_~a$r_buff0_thd0~0_211 (ite .cse4 0 v_~a$r_buff0_thd0~0_212)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_69| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57| (mod v_~main$tmp_guard1~0_80 256)) (= v_~a$w_buff0_used~0_635 (ite .cse2 0 v_~a$w_buff0_used~0_636)) (= (ite (= (ite (not (and (= v_~y~0_117 2) (= 2 v_~x~0_108) (= v_~__unbuffered_p3_EAX~0_90 1) (= v_~__unbuffered_p3_EBX~0_114 0) (= v_~__unbuffered_p2_EAX~0_86 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_80) (= v_~a$w_buff1_used~0_564 (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_565))))) InVars {~a$w_buff0_used~0=v_~a$w_buff0_used~0_636, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_212, ~a~0=v_~a~0_500, ~a$w_buff1~0=v_~a$w_buff1~0_301, ~a$w_buff0~0=v_~a$w_buff0~0_364, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_221, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_307, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_565, ~y~0=v_~y~0_117, ~x~0=v_~x~0_108} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_69|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_93|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_635, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_114, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_84, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_81|, ~a~0=v_~a~0_499, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_57|, ~a$w_buff1~0=v_~a$w_buff1~0_301, ~a$w_buff0~0=v_~a$w_buff0~0_364, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_111|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_220, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_86, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_307, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_564, ~y~0=v_~y~0_117, ~x~0=v_~x~0_108, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_109|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [530] $Ultimate##0-->L764: Formula: (and (= v_~a$w_buff0_used~0_582 1) (= v_~a$w_buff0_used~0_583 v_~a$w_buff1_used~0_516) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_74| 0)) (= v_~a$w_buff0~0_336 1) (= v_~x~0_104 1) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_74| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_582 256) 0)) (not (= (mod v_~a$w_buff1_used~0_516 256) 0)))) 1 0)) (= v_~a$r_buff0_thd2~0_169 v_~a$r_buff1_thd2~0_170) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_72| |v_P0Thread1of1ForFork3_~arg#1.base_72|) (= v_~a$w_buff0~0_337 v_~a$w_buff1~0_278) (= v_~a$r_buff0_thd1~0_214 v_~a$r_buff1_thd1~0_142) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_74| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_74|) (= v_~a$r_buff0_thd0~0_209 v_~a$r_buff1_thd0~0_218) (= v_~a$r_buff0_thd1~0_213 1) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_72| |v_P0Thread1of1ForFork3_~arg#1.offset_72|) (= v_~a$r_buff0_thd3~0_148 v_~a$r_buff1_thd3~0_159) (= v_~a$r_buff0_thd4~0_230 v_~a$r_buff1_thd4~0_238)) InVars {P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_72|, ~a$w_buff0~0=v_~a$w_buff0~0_337, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_72|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_169, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_148, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_583, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_214, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_230} OutVars{P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_72|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_238, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_72|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_159, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_170, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_74|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_169, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_148, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_582, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_213, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_230, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_72|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_72|, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_74|, ~a$w_buff1~0=v_~a$w_buff1~0_278, ~a$w_buff0~0=v_~a$w_buff0~0_336, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_218, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_516, ~x~0=v_~x~0_104} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork3_~arg#1.base, P0Thread1of1ForFork3_~arg#1.offset, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~a$w_buff1~0, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0] [2022-12-06 06:20:51,506 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [535] L764-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse14 (not (= (mod v_~a$r_buff0_thd1~0_262 256) 0)))) (let ((.cse8 (and (not (= (mod v_~a$w_buff0_used~0_705 256) 0)) .cse14))) (let ((.cse1 (ite .cse8 0 v_~a$w_buff0_used~0_705))) (let ((.cse10 (not (= (mod .cse1 256) 0))) (.cse12 (not (= 0 (mod v_~a$r_buff1_thd1~0_181 256))))) (let ((.cse9 (and (not (= (mod v_~a$w_buff1_used~0_630 256) 0)) .cse12)) (.cse7 (and .cse10 .cse14))) (let ((.cse6 (ite (or .cse9 .cse7) 0 v_~a$w_buff1_used~0_630))) (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_703 256) 0))) (.cse11 (not (= (mod .cse6 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd0~0_225 256) 0))) (.cse13 (not (= (mod v_~a$r_buff0_thd0~0_216 256) 0)))) (let ((.cse0 (and .cse13 .cse10)) (.cse5 (and .cse11 .cse3)) (.cse4 (and .cse13 .cse2))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113| 0)) (= (mod v_~main$tmp_guard0~0_86 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111|) (= (ite .cse0 0 .cse1) v_~a$w_buff0_used~0_703) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| (mod v_~main$tmp_guard1~0_82 256)) (= (ite (or (and .cse2 (not (= (mod v_~a$r_buff0_thd0~0_215 256) 0))) (and (not (= (mod v_~a$w_buff1_used~0_628 256) 0)) .cse3)) 0 v_~a$r_buff1_thd0~0_225) v_~a$r_buff1_thd0~0_224) (= (ite (or .cse4 .cse5) 0 .cse6) v_~a$w_buff1_used~0_628) (= (ite .cse7 0 v_~a$r_buff0_thd1~0_262) v_~a$r_buff0_thd1~0_261) (= (ite .cse0 v_~a$w_buff0~0_396 (ite .cse5 v_~a$w_buff1~0_329 (ite .cse8 v_~a$w_buff0~0_396 (ite .cse9 v_~a$w_buff1~0_329 v_~a~0_567)))) v_~a~0_565) (= v_~a$r_buff1_thd1~0_180 (ite (or (and .cse10 (not (= (mod v_~a$r_buff0_thd1~0_261 256) 0))) (and .cse11 .cse12)) 0 v_~a$r_buff1_thd1~0_181)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_309 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_86) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_71| 0) (= v_~a$r_buff0_thd0~0_215 (ite .cse4 0 v_~a$r_buff0_thd0~0_216)) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_96 1) (= v_~__unbuffered_p3_EBX~0_120 0) (= 2 v_~x~0_110) (= v_~y~0_119 2) (= v_~__unbuffered_p2_EAX~0_88 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_82) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_71|)))))))))) InVars {~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_181, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_705, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_262, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_120, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_216, ~a~0=v_~a~0_567, ~a$w_buff1~0=v_~a$w_buff1~0_329, ~a$w_buff0~0=v_~a$w_buff0~0_396, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_96, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_225, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_309, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_630, ~y~0=v_~y~0_119, ~x~0=v_~x~0_110} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_71|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_95|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_180, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_703, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_261, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_120, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_215, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_86, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_83|, ~a~0=v_~a~0_565, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~a$w_buff1~0=v_~a$w_buff1~0_329, ~a$w_buff0~0=v_~a$w_buff0~0_396, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_113|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_96, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_224, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_309, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_628, ~y~0=v_~y~0_119, ~x~0=v_~x~0_110, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_111|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre11#1, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~main$tmp_guard1~0, ~a$r_buff0_thd1~0, ~a$r_buff0_thd0~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [530] $Ultimate##0-->L764: Formula: (and (= v_~a$w_buff0_used~0_582 1) (= v_~a$w_buff0_used~0_583 v_~a$w_buff1_used~0_516) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_74| 0)) (= v_~a$w_buff0~0_336 1) (= v_~x~0_104 1) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_74| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_582 256) 0)) (not (= (mod v_~a$w_buff1_used~0_516 256) 0)))) 1 0)) (= v_~a$r_buff0_thd2~0_169 v_~a$r_buff1_thd2~0_170) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_72| |v_P0Thread1of1ForFork3_~arg#1.base_72|) (= v_~a$w_buff0~0_337 v_~a$w_buff1~0_278) (= v_~a$r_buff0_thd1~0_214 v_~a$r_buff1_thd1~0_142) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_74| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_74|) (= v_~a$r_buff0_thd0~0_209 v_~a$r_buff1_thd0~0_218) (= v_~a$r_buff0_thd1~0_213 1) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_72| |v_P0Thread1of1ForFork3_~arg#1.offset_72|) (= v_~a$r_buff0_thd3~0_148 v_~a$r_buff1_thd3~0_159) (= v_~a$r_buff0_thd4~0_230 v_~a$r_buff1_thd4~0_238)) InVars {P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_72|, ~a$w_buff0~0=v_~a$w_buff0~0_337, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_72|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_169, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_148, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_583, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_214, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_230} OutVars{P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_72|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_238, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_72|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_159, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_170, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_74|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_169, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_148, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_582, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_213, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_209, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_230, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_72|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_72|, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_74|, ~a$w_buff1~0=v_~a$w_buff1~0_278, ~a$w_buff0~0=v_~a$w_buff0~0_336, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_218, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_516, ~x~0=v_~x~0_104} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, P0Thread1of1ForFork3_~arg#1.base, P0Thread1of1ForFork3_~arg#1.offset, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~a$w_buff1~0, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0] [2022-12-06 06:20:52,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [536] L871-3-->L764: Formula: (let ((.cse2 (not (= (mod v_~a$r_buff0_thd0~0_220 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_711 256) 0)) .cse2))) (let ((.cse1 (ite .cse0 0 v_~a$w_buff0_used~0_711))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_115| 0)) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_76| 0)) (= v_~a$w_buff0~0_398 1) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_115|) (= v_~a$r_buff0_thd0~0_219 v_~a$r_buff1_thd0~0_228) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_74| |v_P0Thread1of1ForFork3_~arg#1.offset_74|) (= v_~a$w_buff0_used~0_709 1) (= v_~x~0_112 1) (= v_~a~0_571 (ite .cse0 v_~a$w_buff0~0_399 (ite (and (not (= (mod v_~a$r_buff1_thd0~0_230 256) 0)) (not (= (mod v_~a$w_buff1_used~0_636 256) 0))) v_~a$w_buff1~0_332 v_~a~0_572))) (= .cse1 v_~a$w_buff1_used~0_634) (= v_~a$r_buff0_thd4~0_289 v_~a$r_buff1_thd4~0_297) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~a$w_buff0~0_399 v_~a$w_buff1~0_331) (= v_~a$r_buff0_thd0~0_219 (ite (and (not (= (mod .cse1 256) 0)) .cse2) 0 v_~a$r_buff0_thd0~0_220)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113| (mod v_~main$tmp_guard0~0_88 256)) (= v_~main$tmp_guard0~0_88 (ite (= (ite (= v_~__unbuffered_cnt~0_311 4) 1 0) 0) 0 1)) (= v_~a$r_buff0_thd1~0_265 1) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_76| (ite (not (and (not (= (mod v_~a$w_buff0_used~0_709 256) 0)) (not (= (mod v_~a$w_buff1_used~0_634 256) 0)))) 1 0)) (= (mod v_~main$tmp_guard1~0_84 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|) (= v_~a$r_buff0_thd2~0_239 v_~a$r_buff1_thd2~0_240) (= v_~a$r_buff0_thd3~0_174 v_~a$r_buff1_thd3~0_185) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_90 0) (= v_~y~0_121 2) (= v_~__unbuffered_p3_EAX~0_98 1) (= v_~__unbuffered_p3_EBX~0_122 0) (= 2 v_~x~0_113))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_84) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_76| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_76|) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_74| |v_P0Thread1of1ForFork3_~arg#1.base_74|) (= v_~a$r_buff0_thd1~0_266 v_~a$r_buff1_thd1~0_184))))) InVars {P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_74|, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_74|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_239, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_174, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_711, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_266, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_220, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_122, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_289, ~a~0=v_~a~0_572, ~a$w_buff1~0=v_~a$w_buff1~0_332, ~a$w_buff0~0=v_~a$w_buff0~0_399, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_230, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_311, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_636, ~y~0=v_~y~0_121, ~x~0=v_~x~0_113} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_74|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_297, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_240, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_76|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_239, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_219, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_289, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_85|, ~a~0=v_~a~0_571, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_76|, ~a$w_buff1~0=v_~a$w_buff1~0_331, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_115|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ~y~0=v_~y~0_121, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_97|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_184, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_74|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_185, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_174, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_709, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_265, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_122, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_88, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_74|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_74|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_61|, ~a$w_buff0~0=v_~a$w_buff0~0_398, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_228, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_311, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_634, ~x~0=v_~x~0_112, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_113|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~a$r_buff1_thd4~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~a$w_buff1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre11#1, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, P0Thread1of1ForFork3_~arg#1.base, P0Thread1of1ForFork3_~arg#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [531] $Ultimate##0-->L784: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~y~0_113 1) (= 2 v_~x~0_106) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~y~0=v_~y~0_113, ~x~0=v_~x~0_106} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] [2022-12-06 06:20:52,460 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [537] L764-->L764: Formula: (let ((.cse7 (not (= (mod v_~a$r_buff0_thd1~0_271 256) 0)))) (let ((.cse5 (and .cse7 (not (= (mod v_~a$w_buff0_used~0_717 256) 0))))) (let ((.cse6 (ite .cse5 0 v_~a$w_buff0_used~0_717))) (let ((.cse0 (not (= (mod v_~a$r_buff0_thd0~0_224 256) 0))) (.cse8 (not (= (mod .cse6 256) 0)))) (let ((.cse2 (and .cse0 .cse8))) (let ((.cse4 (and .cse7 .cse8)) (.cse1 (ite .cse2 0 .cse6))) (and (= v_~a$r_buff0_thd2~0_241 v_~a$r_buff1_thd2~0_242) (= (mod v_~main$tmp_guard1~0_86 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_117| 0)) (= (ite (and .cse0 (not (= 0 (mod .cse1 256)))) 0 v_~a$r_buff0_thd0~0_224) v_~a$r_buff0_thd0~0_223) (= v_~a~0_575 (ite .cse2 v_~a$w_buff0~0_403 (let ((.cse3 (and (not (= (mod v_~a$w_buff1_used~0_642 256) 0)) (not (= (mod v_~a$r_buff1_thd1~0_188 256) 0))))) (ite (and (not (= (mod (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_642) 256) 0)) (not (= (mod v_~a$r_buff1_thd0~0_236 256) 0))) v_~a$w_buff1~0_336 (ite .cse5 v_~a$w_buff0~0_403 (ite .cse3 v_~a$w_buff1~0_336 v_~a~0_576)))))) (= v_~x~0_116 1) (= v_~a$r_buff0_thd4~0_291 v_~a$r_buff1_thd4~0_299) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75| 0) (= v_~a$w_buff0~0_403 v_~a$w_buff1~0_335) (= v_~main$tmp_guard1~0_86 (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_100 1) (= 2 v_~x~0_117) (= v_~__unbuffered_p2_EAX~0_92 0) (= v_~__unbuffered_p3_EBX~0_124 0) (= v_~y~0_123 2))) 1 0) 0) 0 1)) (not (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_78| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_115| (mod v_~main$tmp_guard0~0_90 256)) (= |v_P0Thread1of1ForFork3_#in~arg#1.offset_76| |v_P0Thread1of1ForFork3_~arg#1.offset_76|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|) (= v_~main$tmp_guard0~0_90 (ite (= (ite (= v_~__unbuffered_cnt~0_313 4) 1 0) 0) 0 1)) (= |v_P0Thread1of1ForFork3_#in~arg#1.base_76| |v_P0Thread1of1ForFork3_~arg#1.base_76|) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_78| (ite (not (and (not (= (mod v_~a$w_buff1_used~0_640 256) 0)) (not (= (mod v_~a$w_buff0_used~0_715 256) 0)))) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_115| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_117|) (= v_~a$r_buff0_thd0~0_223 v_~a$r_buff1_thd0~0_234) (= v_~a$w_buff0~0_402 1) (= v_~a$r_buff0_thd3~0_176 v_~a$r_buff1_thd3~0_187) (= v_~a$r_buff0_thd1~0_269 1) (= |v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_78| |v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_78|) (= (ite .cse4 0 v_~a$r_buff0_thd1~0_271) v_~a$r_buff1_thd1~0_186) (= v_~a$w_buff0_used~0_715 1) (= .cse1 v_~a$w_buff1_used~0_640)))))))) InVars {P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_76|, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_76|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_188, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_241, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_176, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_717, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_271, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_224, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_124, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_291, ~a~0=v_~a~0_576, ~a$w_buff1~0=v_~a$w_buff1~0_336, ~a$w_buff0~0=v_~a$w_buff0~0_403, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_236, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_642, ~y~0=v_~y~0_123, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_75|, P0Thread1of1ForFork3_#in~arg#1.offset=|v_P0Thread1of1ForFork3_#in~arg#1.offset_76|, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_299, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_242, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1_78|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_241, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_86, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_223, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_291, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_87|, ~a~0=v_~a~0_575, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork3___VERIFIER_assert_~expression#1_78|, ~a$w_buff1~0=v_~a$w_buff1~0_335, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_117|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_99|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_186, P0Thread1of1ForFork3_#in~arg#1.base=|v_P0Thread1of1ForFork3_#in~arg#1.base_76|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_187, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_176, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_715, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_269, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_124, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_90, P0Thread1of1ForFork3_~arg#1.base=|v_P0Thread1of1ForFork3_~arg#1.base_76|, P0Thread1of1ForFork3_~arg#1.offset=|v_P0Thread1of1ForFork3_~arg#1.offset_76|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_63|, ~a$w_buff0~0=v_~a$w_buff0~0_402, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_234, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_313, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_640, ~x~0=v_~x~0_116, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_115|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~a$r_buff1_thd4~0, ~a$r_buff1_thd2~0, P0Thread1of1ForFork3___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~a~0, P0Thread1of1ForFork3___VERIFIER_assert_~expression#1, ~a$w_buff1~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~pre11#1, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, P0Thread1of1ForFork3_~arg#1.base, P0Thread1of1ForFork3_~arg#1.offset, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~a$w_buff1_used~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [531] $Ultimate##0-->L784: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_23 |v_P1Thread1of1ForFork1_#in~arg.base_23|) (= v_~y~0_113 1) (= 2 v_~x~0_106) (= |v_P1Thread1of1ForFork1_#in~arg.offset_23| v_P1Thread1of1ForFork1_~arg.offset_23)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_23, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_23|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_23|, ~y~0=v_~y~0_113, ~x~0=v_~x~0_106} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] [2022-12-06 06:20:52,919 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 06:20:52,920 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2970 [2022-12-06 06:20:52,920 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 302 flow [2022-12-06 06:20:52,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:20:52,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:20:52,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:52,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:20:52,921 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:20:52,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:20:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash 800186504, now seen corresponding path program 2 times [2022-12-06 06:20:52,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:20:52,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521604041] [2022-12-06 06:20:52,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:20:52,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:20:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:20:52,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:20:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:20:53,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:20:53,139 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:20:53,140 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:20:53,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:20:53,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:20:53,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:20:53,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:20:53,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:20:53,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:20:53,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:20:53,143 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:20:53,148 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:20:53,148 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:20:53,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:20:53 BasicIcfg [2022-12-06 06:20:53,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:20:53,306 INFO L158 Benchmark]: Toolchain (without parser) took 58549.04ms. Allocated memory was 181.4MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 138.6MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-12-06 06:20:53,306 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 181.4MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:20:53,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.26ms. Allocated memory is still 181.4MB. Free memory was 138.6MB in the beginning and 110.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:20:53,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.26ms. Allocated memory is still 181.4MB. Free memory was 110.2MB in the beginning and 107.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:20:53,306 INFO L158 Benchmark]: Boogie Preprocessor took 57.48ms. Allocated memory is still 181.4MB. Free memory was 107.6MB in the beginning and 106.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:20:53,307 INFO L158 Benchmark]: RCFGBuilder took 786.67ms. Allocated memory is still 181.4MB. Free memory was 105.5MB in the beginning and 66.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 06:20:53,307 INFO L158 Benchmark]: TraceAbstraction took 56985.46ms. Allocated memory was 181.4MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 66.2MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 06:20:53,310 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.26ms. Allocated memory is still 181.4MB. Free memory was 158.2MB in the beginning and 158.1MB in the end (delta: 62.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 636.26ms. Allocated memory is still 181.4MB. Free memory was 138.6MB in the beginning and 110.2MB in the end (delta: 28.3MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.26ms. Allocated memory is still 181.4MB. Free memory was 110.2MB in the beginning and 107.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.48ms. Allocated memory is still 181.4MB. Free memory was 107.6MB in the beginning and 106.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 786.67ms. Allocated memory is still 181.4MB. Free memory was 105.5MB in the beginning and 66.7MB in the end (delta: 38.8MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 56985.46ms. Allocated memory was 181.4MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 66.2MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 137 PlacesBefore, 48 PlacesAfterwards, 126 TransitionsBefore, 36 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2308, independent: 2234, independent conditional: 2234, independent unconditional: 0, dependent: 74, dependent conditional: 74, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2308, independent: 2234, independent conditional: 0, independent unconditional: 2234, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2308, independent: 2234, independent conditional: 0, independent unconditional: 2234, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2308, independent: 2234, independent conditional: 0, independent unconditional: 2234, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1954, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1954, independent: 1870, independent conditional: 0, independent unconditional: 1870, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 361, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2308, independent: 336, independent conditional: 0, independent unconditional: 336, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1954, unknown conditional: 0, unknown unconditional: 1954] , Statistics on independence cache: Total cache size (in pairs): 2761, Positive cache size: 2705, Positive conditional cache size: 0, Positive unconditional cache size: 2705, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, 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.3s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 157, independent conditional: 22, independent unconditional: 135, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 157, independent conditional: 22, independent unconditional: 135, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 157, independent conditional: 22, independent unconditional: 135, dependent: 30, dependent conditional: 11, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 175, independent: 150, independent conditional: 21, independent unconditional: 129, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 175, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 10, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 240, dependent conditional: 112, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 187, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 175, unknown conditional: 31, unknown unconditional: 144] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 150, Positive conditional cache size: 21, Positive unconditional cache size: 129, Negative cache size: 25, Negative conditional cache size: 10, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 147, independent conditional: 23, independent unconditional: 124, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 171, Positive conditional cache size: 21, Positive unconditional cache size: 150, Negative cache size: 31, Negative conditional cache size: 10, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 159, independent: 138, independent conditional: 20, independent unconditional: 118, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 159, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 173, Positive conditional cache size: 21, Positive unconditional cache size: 152, Negative cache size: 36, Negative conditional cache size: 10, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 676 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 178, independent conditional: 178, 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: 204, independent: 178, independent conditional: 70, independent unconditional: 108, 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: 204, independent: 178, independent conditional: 0, independent unconditional: 178, 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: 204, independent: 178, independent conditional: 0, independent unconditional: 178, 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, independent: 178, independent conditional: 0, independent unconditional: 178, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 173, Positive conditional cache size: 21, Positive unconditional cache size: 152, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 70, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 266, independent: 236, independent conditional: 236, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 266, independent: 236, independent conditional: 105, independent unconditional: 131, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 266, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 266, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 266, independent: 236, independent conditional: 0, independent unconditional: 236, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 173, Positive conditional cache size: 21, Positive unconditional cache size: 152, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 808 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 259, independent: 224, independent conditional: 224, 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: 259, independent: 224, independent conditional: 85, independent unconditional: 139, 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: 259, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 259, independent: 224, independent conditional: 0, independent unconditional: 224, 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: 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: 259, independent: 224, independent conditional: 0, independent unconditional: 224, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 173, Positive conditional cache size: 21, Positive unconditional cache size: 152, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 85, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 64 PlacesBefore, 63 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 1240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 782, independent: 702, independent conditional: 702, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 782, independent: 702, independent conditional: 440, independent unconditional: 262, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 782, independent: 702, independent conditional: 278, independent unconditional: 424, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 782, independent: 702, independent conditional: 278, independent unconditional: 424, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 19, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 782, independent: 678, independent conditional: 259, independent unconditional: 419, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 24, unknown conditional: 19, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 209, Positive conditional cache size: 40, Positive unconditional cache size: 169, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 162, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 67 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 425, independent: 353, independent conditional: 353, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 425, independent: 353, independent conditional: 107, independent unconditional: 246, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 425, independent: 353, independent conditional: 6, independent unconditional: 347, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 425, independent: 353, independent conditional: 6, independent unconditional: 347, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 425, independent: 345, independent conditional: 5, independent unconditional: 340, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 230, Positive conditional cache size: 42, Positive unconditional cache size: 188, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 101, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 71 PlacesBefore, 71 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272, independent: 218, independent conditional: 218, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272, independent: 218, independent conditional: 79, independent unconditional: 139, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 272, independent: 218, independent conditional: 3, independent unconditional: 215, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 272, independent: 218, independent conditional: 3, independent unconditional: 215, dependent: 54, dependent conditional: 0, dependent unconditional: 54, 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: 272, independent: 218, independent conditional: 3, independent unconditional: 215, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 281, Positive cache size: 243, Positive conditional cache size: 43, Positive unconditional cache size: 200, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 76, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 78 PlacesBefore, 78 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 1348 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 368, independent: 300, independent conditional: 300, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 368, independent: 300, independent conditional: 154, independent unconditional: 146, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 368, independent: 300, independent conditional: 98, independent unconditional: 202, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 368, independent: 300, independent conditional: 98, independent unconditional: 202, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 8, independent unconditional: 7, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 368, independent: 285, independent conditional: 90, independent unconditional: 195, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 15, unknown conditional: 8, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 258, Positive conditional cache size: 51, Positive unconditional cache size: 207, Negative cache size: 38, Negative conditional cache size: 10, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 81 PlacesBefore, 81 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 378, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 66, dependent conditional: 66, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 378, independent: 312, independent conditional: 96, independent unconditional: 216, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 378, independent: 312, independent conditional: 21, independent unconditional: 291, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 378, independent: 312, independent conditional: 21, independent unconditional: 291, dependent: 66, dependent conditional: 0, dependent unconditional: 66, 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: 378, independent: 309, independent conditional: 18, independent unconditional: 291, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 261, Positive conditional cache size: 54, Positive unconditional cache size: 207, Negative cache size: 38, Negative conditional cache size: 10, 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: 0.2s, 78 PlacesBefore, 78 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 950 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 35, independent conditional: 27, independent unconditional: 8, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 35, independent conditional: 16, independent unconditional: 19, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, independent: 35, independent conditional: 16, independent unconditional: 19, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 32, independent conditional: 15, independent unconditional: 17, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 269, Positive conditional cache size: 55, Positive unconditional cache size: 214, Negative cache size: 41, Negative conditional cache size: 13, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 81 PlacesBefore, 74 PlacesAfterwards, 42 TransitionsBefore, 35 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 186, independent conditional: 157, independent unconditional: 29, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 206, independent: 186, independent conditional: 134, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 206, independent: 186, independent conditional: 134, independent unconditional: 52, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, independent: 36, independent conditional: 19, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 272, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 206, independent: 150, independent conditional: 115, independent unconditional: 35, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 42, unknown conditional: 19, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 358, Positive conditional cache size: 78, Positive unconditional cache size: 280, Negative cache size: 47, Negative conditional cache size: 13, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 54 PlacesBefore, 57 PlacesAfterwards, 35 TransitionsBefore, 39 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 331, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 331, independent: 297, independent conditional: 221, independent unconditional: 76, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 331, independent: 297, independent conditional: 180, independent unconditional: 117, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 331, independent: 297, independent conditional: 180, independent unconditional: 117, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 19, independent unconditional: 10, 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: 29, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 189, independent: 189, independent conditional: 189, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 331, independent: 268, independent conditional: 161, independent unconditional: 107, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 29, unknown conditional: 19, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 439, Positive cache size: 392, Positive conditional cache size: 97, Positive unconditional cache size: 295, Negative cache size: 47, Negative conditional cache size: 13, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=-3, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=-2, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=-1, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=0, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L820] 4 z = 1 [L823] 4 __unbuffered_p3_EAX = z [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, 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: 871]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 37.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1679 IncrementalHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 33 mSDtfsCounter, 1679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:20:53,363 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...