/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 09:30:44,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 09:30:44,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 09:30:44,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 09:30:44,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 09:30:44,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 09:30:44,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 09:30:44,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 09:30:44,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 09:30:44,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 09:30:44,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 09:30:44,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 09:30:44,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 09:30:44,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 09:30:44,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 09:30:44,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 09:30:44,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 09:30:44,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 09:30:44,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 09:30:44,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 09:30:44,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 09:30:44,529 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 09:30:44,530 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 09:30:44,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 09:30:44,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 09:30:44,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 09:30:44,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 09:30:44,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 09:30:44,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 09:30:44,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 09:30:44,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 09:30:44,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 09:30:44,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 09:30:44,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 09:30:44,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 09:30:44,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 09:30:44,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 09:30:44,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 09:30:44,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 09:30:44,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 09:30:44,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 09:30:44,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 09:30:44,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 09:30:44,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 09:30:44,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 09:30:44,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 09:30:44,576 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 09:30:44,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 09:30:44,577 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 09:30:44,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 09:30:44,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 09:30:44,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 09:30:44,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 09:30:44,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 09:30:44,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 09:30:44,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 09:30:44,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 09:30:44,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 09:30:44,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 09:30:44,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 09:30:44,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 09:30:44,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 09:30:44,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 09:30:44,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:44,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 09:30:44,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 09:30:44,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 09:30:44,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 09:30:44,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 09:30:44,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 09:30:44,879 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 09:30:44,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:30:45,884 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 09:30:46,109 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 09:30:46,110 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:30:46,127 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0e9d56d/5a34aba59bab4d0b8c018031eb50f5e2/FLAG0c98edaf0 [2022-12-13 09:30:46,154 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c0e9d56d/5a34aba59bab4d0b8c018031eb50f5e2 [2022-12-13 09:30:46,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 09:30:46,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 09:30:46,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:46,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 09:30:46,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 09:30:46,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c684196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46, skipping insertion in model container [2022-12-13 09:30:46,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 09:30:46,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 09:30:46,346 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2022-12-13 09:30:46,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,524 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:46,548 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 09:30:46,558 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/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i[974,987] [2022-12-13 09:30:46,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 09:30:46,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 09:30:46,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 09:30:46,642 INFO L208 MainTranslator]: Completed translation [2022-12-13 09:30:46,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46 WrapperNode [2022-12-13 09:30:46,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 09:30:46,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:46,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 09:30:46,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 09:30:46,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,683 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-13 09:30:46,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 09:30:46,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 09:30:46,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 09:30:46,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 09:30:46,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,703 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 09:30:46,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 09:30:46,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 09:30:46,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 09:30:46,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (1/1) ... [2022-12-13 09:30:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 09:30:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 09:30:46,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 09:30:46,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 09:30:46,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 09:30:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 09:30:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 09:30:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 09:30:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 09:30:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 09:30:46,763 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 09:30:46,920 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 09:30:46,921 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 09:30:47,221 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 09:30:47,341 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 09:30:47,341 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 09:30:47,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:47 BoogieIcfgContainer [2022-12-13 09:30:47,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 09:30:47,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 09:30:47,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 09:30:47,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 09:30:47,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:30:46" (1/3) ... [2022-12-13 09:30:47,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a7e186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:47, skipping insertion in model container [2022-12-13 09:30:47,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:30:46" (2/3) ... [2022-12-13 09:30:47,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a7e186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:30:47, skipping insertion in model container [2022-12-13 09:30:47,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:30:47" (3/3) ... [2022-12-13 09:30:47,382 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-13 09:30:47,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 09:30:47,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 09:30:47,405 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 09:30:47,441 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 09:30:47,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 09:30:47,519 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 09:30:47,519 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:47,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 09:30:47,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2022-12-13 09:30:47,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2022-12-13 09:30:47,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:47,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 09:30:47,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2022-12-13 09:30:47,575 INFO L130 PetriNetUnfolder]: 2/105 cut-off events. [2022-12-13 09:30:47,576 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:47,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 09:30:47,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2022-12-13 09:30:47,579 INFO L226 LiptonReduction]: Number of co-enabled transitions 1916 [2022-12-13 09:30:52,200 INFO L241 LiptonReduction]: Total number of compositions: 82 [2022-12-13 09:30:52,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 09:30:52,219 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;@5c3541b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 09:30:52,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 09:30:52,222 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 09:30:52,222 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:52,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:52,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 09:30:52,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:52,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:52,226 INFO L85 PathProgramCache]: Analyzing trace with hash 481830542, now seen corresponding path program 1 times [2022-12-13 09:30:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:52,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231771059] [2022-12-13 09:30:52,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:52,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231771059] [2022-12-13 09:30:52,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231771059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:52,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:52,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:52,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788607345] [2022-12-13 09:30:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:52,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:52,572 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 61 [2022-12-13 09:30:52,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:52,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:52,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 61 [2022-12-13 09:30:52,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:53,782 INFO L130 PetriNetUnfolder]: 9278/14613 cut-off events. [2022-12-13 09:30:53,782 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 09:30:53,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27909 conditions, 14613 events. 9278/14613 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 106215 event pairs, 1008 based on Foata normal form. 0/9299 useless extension candidates. Maximal degree in co-relation 27898. Up to 11546 conditions per place. [2022-12-13 09:30:53,823 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 33 selfloop transitions, 2 changer transitions 51/96 dead transitions. [2022-12-13 09:30:53,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 374 flow [2022-12-13 09:30:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-12-13 09:30:53,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6721311475409836 [2022-12-13 09:30:53,832 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 3 states and 123 transitions. [2022-12-13 09:30:53,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 374 flow [2022-12-13 09:30:53,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 09:30:53,836 INFO L231 Difference]: Finished difference. Result has 67 places, 32 transitions, 74 flow [2022-12-13 09:30:53,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=67, PETRI_TRANSITIONS=32} [2022-12-13 09:30:53,840 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 09:30:53,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:53,841 INFO L89 Accepts]: Start accepts. Operand has 67 places, 32 transitions, 74 flow [2022-12-13 09:30:53,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:53,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:53,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 32 transitions, 74 flow [2022-12-13 09:30:53,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 09:30:53,847 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:30:53,847 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:53,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 80 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 09:30:53,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 09:30:53,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-13 09:30:53,969 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:53,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 09:30:53,970 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 09:30:53,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:53,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:53,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:53,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 09:30:53,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 631212072, now seen corresponding path program 1 times [2022-12-13 09:30:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:53,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030705686] [2022-12-13 09:30:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:54,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:54,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:54,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030705686] [2022-12-13 09:30:54,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030705686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:54,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:54,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 09:30:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118961853] [2022-12-13 09:30:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:54,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:54,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 09:30:54,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:54,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 09:30:54,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:54,406 INFO L130 PetriNetUnfolder]: 1338/2180 cut-off events. [2022-12-13 09:30:54,407 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-13 09:30:54,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4340 conditions, 2180 events. 1338/2180 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11626 event pairs, 431 based on Foata normal form. 30/1856 useless extension candidates. Maximal degree in co-relation 4330. Up to 1747 conditions per place. [2022-12-13 09:30:54,416 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-12-13 09:30:54,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 184 flow [2022-12-13 09:30:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 09:30:54,417 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 09:30:54,417 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 68 transitions. [2022-12-13 09:30:54,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 184 flow [2022-12-13 09:30:54,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:54,418 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 78 flow [2022-12-13 09:30:54,418 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 09:30:54,419 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -28 predicate places. [2022-12-13 09:30:54,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:54,419 INFO L89 Accepts]: Start accepts. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 09:30:54,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:54,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:54,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 09:30:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 78 flow [2022-12-13 09:30:54,423 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 09:30:54,424 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 09:30:54,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:30:54,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 78 flow [2022-12-13 09:30:54,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 09:30:54,435 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:54,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 09:30:54,436 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 78 flow [2022-12-13 09:30:54,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:54,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:54,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 09:30:54,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1907262926, now seen corresponding path program 1 times [2022-12-13 09:30:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:54,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769718086] [2022-12-13 09:30:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:54,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769718086] [2022-12-13 09:30:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769718086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:54,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:54,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222787519] [2022-12-13 09:30:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:54,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:54,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 09:30:54,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:54,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 09:30:54,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:54,831 INFO L130 PetriNetUnfolder]: 2184/3560 cut-off events. [2022-12-13 09:30:54,831 INFO L131 PetriNetUnfolder]: For 324/324 co-relation queries the response was YES. [2022-12-13 09:30:54,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7239 conditions, 3560 events. 2184/3560 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20350 event pairs, 348 based on Foata normal form. 140/3100 useless extension candidates. Maximal degree in co-relation 7228. Up to 1477 conditions per place. [2022-12-13 09:30:54,846 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 39 selfloop transitions, 3 changer transitions 8/58 dead transitions. [2022-12-13 09:30:54,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 231 flow [2022-12-13 09:30:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 09:30:54,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 09:30:54,850 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 78 flow. Second operand 4 states and 87 transitions. [2022-12-13 09:30:54,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 231 flow [2022-12-13 09:30:54,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:54,852 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 86 flow [2022-12-13 09:30:54,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2022-12-13 09:30:54,853 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2022-12-13 09:30:54,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:54,853 INFO L89 Accepts]: Start accepts. Operand has 45 places, 31 transitions, 86 flow [2022-12-13 09:30:54,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:54,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:54,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 86 flow [2022-12-13 09:30:54,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 31 transitions, 86 flow [2022-12-13 09:30:54,858 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-13 09:30:54,858 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 09:30:54,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 31 events. 0/31 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 70 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 09:30:54,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 86 flow [2022-12-13 09:30:54,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 468 [2022-12-13 09:30:54,863 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:54,867 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 09:30:54,867 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 86 flow [2022-12-13 09:30:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:54,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:54,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 09:30:54,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1004409980, now seen corresponding path program 1 times [2022-12-13 09:30:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:54,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046381887] [2022-12-13 09:30:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:55,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046381887] [2022-12-13 09:30:55,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046381887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:55,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:55,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506064364] [2022-12-13 09:30:55,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:55,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:55,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:55,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:55,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:30:55,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:55,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:55,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:30:55,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:55,838 INFO L130 PetriNetUnfolder]: 1456/2270 cut-off events. [2022-12-13 09:30:55,838 INFO L131 PetriNetUnfolder]: For 999/999 co-relation queries the response was YES. [2022-12-13 09:30:55,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5141 conditions, 2270 events. 1456/2270 cut-off events. For 999/999 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10996 event pairs, 471 based on Foata normal form. 8/1906 useless extension candidates. Maximal degree in co-relation 5128. Up to 2066 conditions per place. [2022-12-13 09:30:55,850 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 35 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2022-12-13 09:30:55,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 216 flow [2022-12-13 09:30:55,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-13 09:30:55,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-13 09:30:55,851 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 86 flow. Second operand 4 states and 72 transitions. [2022-12-13 09:30:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 216 flow [2022-12-13 09:30:55,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 199 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 09:30:55,854 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 122 flow [2022-12-13 09:30:55,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-13 09:30:55,854 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2022-12-13 09:30:55,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:55,855 INFO L89 Accepts]: Start accepts. Operand has 45 places, 37 transitions, 122 flow [2022-12-13 09:30:55,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:55,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:55,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 37 transitions, 122 flow [2022-12-13 09:30:55,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 122 flow [2022-12-13 09:30:55,867 INFO L130 PetriNetUnfolder]: 37/140 cut-off events. [2022-12-13 09:30:55,867 INFO L131 PetriNetUnfolder]: For 37/40 co-relation queries the response was YES. [2022-12-13 09:30:55,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 140 events. 37/140 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 673 event pairs, 20 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 255. Up to 60 conditions per place. [2022-12-13 09:30:55,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 37 transitions, 122 flow [2022-12-13 09:30:55,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 09:30:56,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L744-->L747: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] L2-1-->L849: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd0~0_196 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_185 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_391 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_392 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_364 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd0~0_184 (ite .cse0 0 v_~y$r_buff0_thd0~0_185)) (= v_~y$r_buff1_thd0~0_195 (ite (or (and .cse1 (not (= (mod v_~y$r_buff0_thd0~0_184 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_363 256) 0)) .cse2)) 0 v_~y$r_buff1_thd0~0_196)) (= (ite .cse3 0 v_~y$w_buff0_used~0_392) v_~y$w_buff0_used~0_391) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_364) v_~y$w_buff1_used~0_363) (= v_~y~0_300 (ite .cse3 v_~y$w_buff0~0_248 (ite .cse4 v_~y$w_buff1~0_236 v_~y~0_301)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_392, ~y$w_buff1~0=v_~y$w_buff1~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_185, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y~0=v_~y~0_301, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_364} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_391, ~y$w_buff1~0=v_~y$w_buff1~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_184, ~y$w_buff0~0=v_~y$w_buff0~0_248, ~y~0=v_~y~0_300, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_195, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_363} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:30:56,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L744-->L747: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [371] L809-->L816: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_107 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_108 256) 0))))) (and (= v_~y$r_buff0_thd3~0_21 (ite .cse0 0 v_~y$r_buff0_thd3~0_22)) (= v_~y~0_57 (ite .cse1 v_~y$w_buff0~0_30 (ite .cse2 v_~y$w_buff1~0_35 v_~y~0_58))) (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_93)) (= (ite .cse1 0 v_~y$w_buff0_used~0_108) v_~y$w_buff0_used~0_107) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_107, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 09:30:56,120 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [355] L744-->L747: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [395] $Ultimate##0-->L773: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_213 256) 0)) (not (= (mod v_~y$w_buff1_used~0_186 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd2~0_93 v_~y$r_buff1_thd2~0_73) (= 2 v_~y$w_buff0~0_108) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|) (= v_~y$r_buff0_thd1~0_33 v_~y$r_buff1_thd1~0_33) (= v_~y$w_buff0_used~0_213 1) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_85) (= v_~y$w_buff1~0_97 v_~y$w_buff0~0_109) (= v_~y$w_buff0_used~0_214 v_~y$w_buff1_used~0_186) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9| 0)) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd2~0_92 1)) InVars {P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_214, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_109, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_93, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|} OutVars{P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_9|, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_213, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_9|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_33, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$w_buff1~0=v_~y$w_buff1~0_97, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_108, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_92, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_186} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 09:30:56,592 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:30:56,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 738 [2022-12-13 09:30:56,593 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 138 flow [2022-12-13 09:30:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:56,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:56,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:56,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 09:30:56,594 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:56,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:56,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1047805773, now seen corresponding path program 1 times [2022-12-13 09:30:56,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:56,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846353150] [2022-12-13 09:30:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:57,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846353150] [2022-12-13 09:30:57,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846353150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:57,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:57,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647359732] [2022-12-13 09:30:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:57,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:57,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-13 09:30:57,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:57,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:57,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-13 09:30:57,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:57,242 INFO L130 PetriNetUnfolder]: 1355/2105 cut-off events. [2022-12-13 09:30:57,242 INFO L131 PetriNetUnfolder]: For 1507/1507 co-relation queries the response was YES. [2022-12-13 09:30:57,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5294 conditions, 2105 events. 1355/2105 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10590 event pairs, 283 based on Foata normal form. 36/1789 useless extension candidates. Maximal degree in co-relation 5281. Up to 1566 conditions per place. [2022-12-13 09:30:57,254 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-12-13 09:30:57,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 261 flow [2022-12-13 09:30:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 09:30:57,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 09:30:57,256 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 138 flow. Second operand 3 states and 63 transitions. [2022-12-13 09:30:57,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 261 flow [2022-12-13 09:30:57,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 261 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 09:30:57,257 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 146 flow [2022-12-13 09:30:57,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-12-13 09:30:57,258 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-12-13 09:30:57,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:57,258 INFO L89 Accepts]: Start accepts. Operand has 47 places, 36 transitions, 146 flow [2022-12-13 09:30:57,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:57,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:57,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 36 transitions, 146 flow [2022-12-13 09:30:57,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 146 flow [2022-12-13 09:30:57,269 INFO L130 PetriNetUnfolder]: 34/144 cut-off events. [2022-12-13 09:30:57,270 INFO L131 PetriNetUnfolder]: For 93/95 co-relation queries the response was YES. [2022-12-13 09:30:57,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 144 events. 34/144 cut-off events. For 93/95 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 743 event pairs, 19 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 280. Up to 49 conditions per place. [2022-12-13 09:30:57,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 36 transitions, 146 flow [2022-12-13 09:30:57,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 496 [2022-12-13 09:30:57,286 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:57,286 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-13 09:30:57,286 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 146 flow [2022-12-13 09:30:57,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:57,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:57,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:57,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 09:30:57,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:57,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1047865324, now seen corresponding path program 1 times [2022-12-13 09:30:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:57,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480505521] [2022-12-13 09:30:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:57,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480505521] [2022-12-13 09:30:57,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480505521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:57,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:57,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 09:30:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337015083] [2022-12-13 09:30:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:57,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 09:30:57,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 09:30:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 09:30:57,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 09:30:57,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:57,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:57,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 09:30:57,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:57,644 INFO L130 PetriNetUnfolder]: 1546/2398 cut-off events. [2022-12-13 09:30:57,644 INFO L131 PetriNetUnfolder]: For 1081/1081 co-relation queries the response was YES. [2022-12-13 09:30:57,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6346 conditions, 2398 events. 1546/2398 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 11998 event pairs, 465 based on Foata normal form. 35/1702 useless extension candidates. Maximal degree in co-relation 6330. Up to 2275 conditions per place. [2022-12-13 09:30:57,654 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 41 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2022-12-13 09:30:57,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 323 flow [2022-12-13 09:30:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 09:30:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 09:30:57,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-13 09:30:57,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2022-12-13 09:30:57,656 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 146 flow. Second operand 3 states and 68 transitions. [2022-12-13 09:30:57,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 323 flow [2022-12-13 09:30:57,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 09:30:57,660 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 210 flow [2022-12-13 09:30:57,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-13 09:30:57,662 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2022-12-13 09:30:57,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:57,662 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 210 flow [2022-12-13 09:30:57,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:57,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:57,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 210 flow [2022-12-13 09:30:57,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 210 flow [2022-12-13 09:30:57,716 INFO L130 PetriNetUnfolder]: 530/1007 cut-off events. [2022-12-13 09:30:57,716 INFO L131 PetriNetUnfolder]: For 291/300 co-relation queries the response was YES. [2022-12-13 09:30:57,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2240 conditions, 1007 events. 530/1007 cut-off events. For 291/300 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 7098 event pairs, 306 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 2226. Up to 685 conditions per place. [2022-12-13 09:30:57,723 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 210 flow [2022-12-13 09:30:57,723 INFO L226 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-13 09:30:57,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L838-3-->L2-1: Formula: (and (= v_~main$tmp_guard0~0_Out_2 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_In_1) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| (mod v_~main$tmp_guard0~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_Out_2|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_Out_2|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_In_1, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_Out_2, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [493] $Ultimate##0-->L849: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_317 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_641 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_302 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_642 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_598 256) 0))))) (and (= v_~y$r_buff0_thd0~0_301 (ite .cse0 0 v_~y$r_buff0_thd0~0_302)) (= v_P0Thread1of1ForFork2_~arg.base_22 |v_P0Thread1of1ForFork2_#in~arg.base_22|) (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_598) v_~y$w_buff1_used~0_597) (= v_~y$w_buff0_used~0_641 (ite .cse2 0 v_~y$w_buff0_used~0_642)) (= v_~y$r_buff1_thd0~0_316 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_597 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_301 256) 0)))) 0 v_~y$r_buff1_thd0~0_317)) (= v_~x~0_72 v_~__unbuffered_p0_EAX~0_101) (= v_~y~0_533 (ite .cse2 v_~y$w_buff0~0_434 (ite .cse1 v_~y$w_buff1~0_408 1))) (= |v_P0Thread1of1ForFork2_#in~arg.offset_22| v_P0Thread1of1ForFork2_~arg.offset_22)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_642, ~y$w_buff1~0=v_~y$w_buff1~0_408, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_302, ~y$w_buff0~0=v_~y$w_buff0~0_434, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_22|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_317, ~x~0=v_~x~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_598} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_641, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_22|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_101, ~y$w_buff1~0=v_~y$w_buff1~0_408, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_301, ~y$w_buff0~0=v_~y$w_buff0~0_434, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_22, ~y~0=v_~y~0_533, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_316, ~x~0=v_~x~0_72, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_597} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, ~y$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] [2022-12-13 09:30:57,910 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 09:30:57,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 249 [2022-12-13 09:30:57,911 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 212 flow [2022-12-13 09:30:57,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:57,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:57,911 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 09:30:57,911 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1761169221, now seen corresponding path program 1 times [2022-12-13 09:30:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346409858] [2022-12-13 09:30:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:58,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:58,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346409858] [2022-12-13 09:30:58,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346409858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:58,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:58,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:30:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088328775] [2022-12-13 09:30:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:58,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:30:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:58,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:30:58,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:30:58,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-13 09:30:58,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:58,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:58,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-13 09:30:58,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:58,202 INFO L130 PetriNetUnfolder]: 757/1363 cut-off events. [2022-12-13 09:30:58,202 INFO L131 PetriNetUnfolder]: For 845/845 co-relation queries the response was YES. [2022-12-13 09:30:58,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 1363 events. 757/1363 cut-off events. For 845/845 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7455 event pairs, 114 based on Foata normal form. 102/1058 useless extension candidates. Maximal degree in co-relation 4402. Up to 1018 conditions per place. [2022-12-13 09:30:58,209 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 46 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2022-12-13 09:30:58,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 441 flow [2022-12-13 09:30:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:30:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:30:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-12-13 09:30:58,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6357142857142857 [2022-12-13 09:30:58,211 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 212 flow. Second operand 4 states and 89 transitions. [2022-12-13 09:30:58,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 441 flow [2022-12-13 09:30:58,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 09:30:58,215 INFO L231 Difference]: Finished difference. Result has 51 places, 53 transitions, 301 flow [2022-12-13 09:30:58,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=51, PETRI_TRANSITIONS=53} [2022-12-13 09:30:58,215 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2022-12-13 09:30:58,215 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:58,215 INFO L89 Accepts]: Start accepts. Operand has 51 places, 53 transitions, 301 flow [2022-12-13 09:30:58,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:58,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:58,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 53 transitions, 301 flow [2022-12-13 09:30:58,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 53 transitions, 301 flow [2022-12-13 09:30:58,264 INFO L130 PetriNetUnfolder]: 269/659 cut-off events. [2022-12-13 09:30:58,264 INFO L131 PetriNetUnfolder]: For 339/393 co-relation queries the response was YES. [2022-12-13 09:30:58,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 659 events. 269/659 cut-off events. For 339/393 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4701 event pairs, 66 based on Foata normal form. 3/427 useless extension candidates. Maximal degree in co-relation 2079. Up to 406 conditions per place. [2022-12-13 09:30:58,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 53 transitions, 301 flow [2022-12-13 09:30:58,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-13 09:30:58,277 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:30:58,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 09:30:58,278 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 53 transitions, 301 flow [2022-12-13 09:30:58,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:58,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:30:58,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:30:58,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 09:30:58,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:30:58,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:30:58,279 INFO L85 PathProgramCache]: Analyzing trace with hash -295827256, now seen corresponding path program 1 times [2022-12-13 09:30:58,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:30:58,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692160265] [2022-12-13 09:30:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:30:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:30:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:30:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:30:58,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:30:58,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692160265] [2022-12-13 09:30:58,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692160265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:30:58,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:30:58,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:30:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926593760] [2022-12-13 09:30:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:30:58,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 09:30:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:30:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 09:30:58,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 09:30:58,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2022-12-13 09:30:58,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 53 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:30:58,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:30:58,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2022-12-13 09:30:58,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:30:58,572 INFO L130 PetriNetUnfolder]: 370/733 cut-off events. [2022-12-13 09:30:58,572 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2022-12-13 09:30:58,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 733 events. 370/733 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3672 event pairs, 33 based on Foata normal form. 90/578 useless extension candidates. Maximal degree in co-relation 2827. Up to 394 conditions per place. [2022-12-13 09:30:58,576 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 37 selfloop transitions, 28 changer transitions 0/71 dead transitions. [2022-12-13 09:30:58,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 507 flow [2022-12-13 09:30:58,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 09:30:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 09:30:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 09:30:58,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2022-12-13 09:30:58,577 INFO L175 Difference]: Start difference. First operand has 51 places, 53 transitions, 301 flow. Second operand 5 states and 94 transitions. [2022-12-13 09:30:58,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 507 flow [2022-12-13 09:30:58,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 446 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 09:30:58,580 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 322 flow [2022-12-13 09:30:58,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2022-12-13 09:30:58,581 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2022-12-13 09:30:58,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:30:58,581 INFO L89 Accepts]: Start accepts. Operand has 52 places, 53 transitions, 322 flow [2022-12-13 09:30:58,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:30:58,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:30:58,582 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 53 transitions, 322 flow [2022-12-13 09:30:58,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 322 flow [2022-12-13 09:30:58,600 INFO L130 PetriNetUnfolder]: 116/335 cut-off events. [2022-12-13 09:30:58,600 INFO L131 PetriNetUnfolder]: For 135/177 co-relation queries the response was YES. [2022-12-13 09:30:58,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 335 events. 116/335 cut-off events. For 135/177 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2163 event pairs, 3 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 1071. Up to 217 conditions per place. [2022-12-13 09:30:58,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 322 flow [2022-12-13 09:30:58,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 478 [2022-12-13 09:31:00,799 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:00,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2218 [2022-12-13 09:31:00,799 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 316 flow [2022-12-13 09:31:00,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:00,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:00,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:00,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 09:31:00,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1904961912, now seen corresponding path program 1 times [2022-12-13 09:31:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:00,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965282212] [2022-12-13 09:31:00,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965282212] [2022-12-13 09:31:00,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965282212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:00,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:00,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 09:31:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628785918] [2022-12-13 09:31:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:00,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 09:31:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 09:31:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 09:31:00,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 09:31:00,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:00,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:00,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 09:31:00,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:01,061 INFO L130 PetriNetUnfolder]: 510/932 cut-off events. [2022-12-13 09:31:01,061 INFO L131 PetriNetUnfolder]: For 1307/1386 co-relation queries the response was YES. [2022-12-13 09:31:01,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 932 events. 510/932 cut-off events. For 1307/1386 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4799 event pairs, 89 based on Foata normal form. 68/785 useless extension candidates. Maximal degree in co-relation 3652. Up to 486 conditions per place. [2022-12-13 09:31:01,066 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 35 selfloop transitions, 1 changer transitions 30/78 dead transitions. [2022-12-13 09:31:01,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 632 flow [2022-12-13 09:31:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 09:31:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 09:31:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-13 09:31:01,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2022-12-13 09:31:01,068 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 316 flow. Second operand 4 states and 69 transitions. [2022-12-13 09:31:01,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 632 flow [2022-12-13 09:31:01,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 506 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 09:31:01,075 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 215 flow [2022-12-13 09:31:01,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 09:31:01,076 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2022-12-13 09:31:01,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:01,076 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 215 flow [2022-12-13 09:31:01,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:01,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:01,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 215 flow [2022-12-13 09:31:01,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 215 flow [2022-12-13 09:31:01,092 INFO L130 PetriNetUnfolder]: 101/244 cut-off events. [2022-12-13 09:31:01,092 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-13 09:31:01,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 244 events. 101/244 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1243 event pairs, 2 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 674. Up to 118 conditions per place. [2022-12-13 09:31:01,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 45 transitions, 215 flow [2022-12-13 09:31:01,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 316 [2022-12-13 09:31:01,101 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 09:31:01,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 09:31:01,102 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 215 flow [2022-12-13 09:31:01,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:01,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 09:31:01,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1613759228, now seen corresponding path program 1 times [2022-12-13 09:31:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:01,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030167965] [2022-12-13 09:31:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 09:31:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030167965] [2022-12-13 09:31:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030167965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:01,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:01,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 09:31:01,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837898745] [2022-12-13 09:31:01,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 09:31:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 09:31:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 09:31:01,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2022-12-13 09:31:01,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:01,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:01,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2022-12-13 09:31:01,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:01,744 INFO L130 PetriNetUnfolder]: 444/856 cut-off events. [2022-12-13 09:31:01,744 INFO L131 PetriNetUnfolder]: For 1065/1119 co-relation queries the response was YES. [2022-12-13 09:31:01,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 856 events. 444/856 cut-off events. For 1065/1119 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 4911 event pairs, 26 based on Foata normal form. 69/714 useless extension candidates. Maximal degree in co-relation 2811. Up to 415 conditions per place. [2022-12-13 09:31:01,748 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 48 selfloop transitions, 9 changer transitions 19/88 dead transitions. [2022-12-13 09:31:01,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 574 flow [2022-12-13 09:31:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 09:31:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 09:31:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-13 09:31:01,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 09:31:01,750 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 215 flow. Second operand 6 states and 90 transitions. [2022-12-13 09:31:01,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 574 flow [2022-12-13 09:31:01,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 565 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 09:31:01,755 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 257 flow [2022-12-13 09:31:01,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-12-13 09:31:01,756 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -18 predicate places. [2022-12-13 09:31:01,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:01,756 INFO L89 Accepts]: Start accepts. Operand has 52 places, 49 transitions, 257 flow [2022-12-13 09:31:01,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:01,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:01,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 257 flow [2022-12-13 09:31:01,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 257 flow [2022-12-13 09:31:01,780 INFO L130 PetriNetUnfolder]: 228/514 cut-off events. [2022-12-13 09:31:01,780 INFO L131 PetriNetUnfolder]: For 317/323 co-relation queries the response was YES. [2022-12-13 09:31:01,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 514 events. 228/514 cut-off events. For 317/323 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 3445 event pairs, 4 based on Foata normal form. 2/207 useless extension candidates. Maximal degree in co-relation 1429. Up to 244 conditions per place. [2022-12-13 09:31:01,784 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 257 flow [2022-12-13 09:31:01,784 INFO L226 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-13 09:31:01,958 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L747: Formula: (and (= v_~x~0_86 v_~__unbuffered_p0_EAX~0_115) (= v_P0Thread1of1ForFork2_~arg.base_32 |v_P0Thread1of1ForFork2_#in~arg.base_32|) (= v_~y~0_597 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_32| v_P0Thread1of1ForFork2_~arg.offset_32)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_32|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_32|, ~x~0=v_~x~0_86} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_32|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_32, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_32|, ~y~0=v_~y~0_597, ~x~0=v_~x~0_86, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_32} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [371] L809-->L816: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_107 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_108 256) 0))))) (and (= v_~y$r_buff0_thd3~0_21 (ite .cse0 0 v_~y$r_buff0_thd3~0_22)) (= v_~y~0_57 (ite .cse1 v_~y$w_buff0~0_30 (ite .cse2 v_~y$w_buff1~0_35 v_~y~0_58))) (= v_~y$w_buff1_used~0_92 (ite (or .cse0 .cse2) 0 v_~y$w_buff1_used~0_93)) (= (ite .cse1 0 v_~y$w_buff0_used~0_108) v_~y$w_buff0_used~0_107) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_21 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_18) v_~y$r_buff1_thd3~0_17)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_22, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_58, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_107, ~y$w_buff1~0=v_~y$w_buff1~0_35, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_57, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 09:31:02,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L747: Formula: (and (= v_~x~0_86 v_~__unbuffered_p0_EAX~0_115) (= v_P0Thread1of1ForFork2_~arg.base_32 |v_P0Thread1of1ForFork2_#in~arg.base_32|) (= v_~y~0_597 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_32| v_P0Thread1of1ForFork2_~arg.offset_32)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_32|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_32|, ~x~0=v_~x~0_86} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_115, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_32|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_32, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_32|, ~y~0=v_~y~0_597, ~x~0=v_~x~0_86, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_32} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [365] L792-->L799: Formula: (let ((.cse5 (not (= 0 (mod v_~y$r_buff0_thd2~0_65 256)))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_169 256) 0))) (.cse3 (not (= 0 (mod v_~y$r_buff1_thd2~0_54 256))))) (let ((.cse1 (and (not (= 0 (mod v_~y$w_buff1_used~0_155 256))) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_170 256) 0))))) (and (= v_~y~0_107 (ite .cse0 v_~y$w_buff0~0_66 (ite .cse1 v_~y$w_buff1~0_67 v_~y~0_108))) (= v_~y$w_buff1_used~0_154 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_155)) (= v_~y$r_buff0_thd2~0_64 (ite .cse2 0 v_~y$r_buff0_thd2~0_65)) (= v_~y$w_buff0_used~0_169 (ite .cse0 0 v_~y$w_buff0_used~0_170)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_154 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd2~0_64 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_54) v_~y$r_buff1_thd2~0_53)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_170, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_66, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_65, ~y~0=v_~y~0_108, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_155} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_169, ~y$w_buff1~0=v_~y$w_buff1~0_67, ~y$w_buff0~0=v_~y$w_buff0~0_66, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_64, ~y~0=v_~y~0_107, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_154} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 09:31:02,184 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 09:31:02,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 429 [2022-12-13 09:31:02,185 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 263 flow [2022-12-13 09:31:02,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:02,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:02,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 09:31:02,185 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:02,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1575701439, now seen corresponding path program 1 times [2022-12-13 09:31:02,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:02,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827144176] [2022-12-13 09:31:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:02,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 09:31:02,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-13 09:31:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 09:31:02,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827144176] [2022-12-13 09:31:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827144176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 09:31:02,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 09:31:02,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 09:31:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935228811] [2022-12-13 09:31:02,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 09:31:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 09:31:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 09:31:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 09:31:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 09:31:02,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 09:31:02,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:02,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 09:31:02,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 09:31:02,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 09:31:03,360 INFO L130 PetriNetUnfolder]: 441/824 cut-off events. [2022-12-13 09:31:03,360 INFO L131 PetriNetUnfolder]: For 1433/1465 co-relation queries the response was YES. [2022-12-13 09:31:03,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 824 events. 441/824 cut-off events. For 1433/1465 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 4588 event pairs, 39 based on Foata normal form. 44/639 useless extension candidates. Maximal degree in co-relation 2925. Up to 340 conditions per place. [2022-12-13 09:31:03,363 INFO L137 encePairwiseOnDemand]: 18/27 looper letters, 41 selfloop transitions, 11 changer transitions 20/83 dead transitions. [2022-12-13 09:31:03,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 611 flow [2022-12-13 09:31:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 09:31:03,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 09:31:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-12-13 09:31:03,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43915343915343913 [2022-12-13 09:31:03,364 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 263 flow. Second operand 7 states and 83 transitions. [2022-12-13 09:31:03,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 611 flow [2022-12-13 09:31:03,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 83 transitions, 570 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 09:31:03,368 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 299 flow [2022-12-13 09:31:03,369 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2022-12-13 09:31:03,369 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-13 09:31:03,369 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 09:31:03,369 INFO L89 Accepts]: Start accepts. Operand has 53 places, 50 transitions, 299 flow [2022-12-13 09:31:03,369 INFO L95 Accepts]: Finished accepts. [2022-12-13 09:31:03,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 09:31:03,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 50 transitions, 299 flow [2022-12-13 09:31:03,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 299 flow [2022-12-13 09:31:03,386 INFO L130 PetriNetUnfolder]: 114/270 cut-off events. [2022-12-13 09:31:03,386 INFO L131 PetriNetUnfolder]: For 501/505 co-relation queries the response was YES. [2022-12-13 09:31:03,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 270 events. 114/270 cut-off events. For 501/505 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1579 event pairs, 0 based on Foata normal form. 2/123 useless extension candidates. Maximal degree in co-relation 813. Up to 136 conditions per place. [2022-12-13 09:31:03,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 50 transitions, 299 flow [2022-12-13 09:31:03,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 232 [2022-12-13 09:31:03,389 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_23 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x~0] and [504] $Ultimate##0-->L799: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_272 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_747 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_313 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_748 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_702 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd2~0_313) v_~y$r_buff0_thd2~0_312) (= (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_702) v_~y$w_buff1_used~0_701) (= v_P0Thread1of1ForFork2_~arg.base_41 |v_P0Thread1of1ForFork2_#in~arg.base_41|) (= (ite .cse2 0 v_~y$w_buff0_used~0_748) v_~y$w_buff0_used~0_747) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_701 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd2~0_312 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_272) v_~y$r_buff1_thd2~0_271) (= v_~y~0_633 (ite .cse2 v_~y$w_buff0~0_506 (ite .cse1 v_~y$w_buff1~0_478 1))) (= |v_P0Thread1of1ForFork2_#in~arg.offset_41| v_P0Thread1of1ForFork2_~arg.offset_41) (= v_~x~0_97 v_~__unbuffered_p0_EAX~0_130)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_272, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_748, ~y$w_buff1~0=v_~y$w_buff1~0_478, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_41|, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_313, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_41|, ~x~0=v_~x~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_702} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_747, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_41|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_41, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_271, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_130, ~y$w_buff1~0=v_~y$w_buff1~0_478, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_41|, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_312, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_41, ~y~0=v_~y~0_633, ~x~0=v_~x~0_97, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_701} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] [2022-12-13 09:31:03,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_23 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x~0] and [503] $Ultimate##0-->L754: Formula: (let ((.cse5 (not (= (mod v_~y$r_buff0_thd1~0_152 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_743 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd1~0_165 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_698 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_744 256) 0))))) (and (= v_~x~0_95 v_~__unbuffered_p0_EAX~0_128) (= v_~y~0_629 (ite .cse0 v_~y$w_buff0~0_504 (ite .cse1 v_~y$w_buff1~0_476 1))) (= (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_698) v_~y$w_buff1_used~0_697) (= v_~y$r_buff0_thd1~0_151 (ite .cse2 0 v_~y$r_buff0_thd1~0_152)) (= v_P0Thread1of1ForFork2_~arg.base_39 |v_P0Thread1of1ForFork2_#in~arg.base_39|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_39| v_P0Thread1of1ForFork2_~arg.offset_39) (= (ite .cse0 0 v_~y$w_buff0_used~0_744) v_~y$w_buff0_used~0_743) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_697 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd1~0_151 256) 0)) .cse4)) 0 v_~y$r_buff1_thd1~0_165) v_~y$r_buff1_thd1~0_164)))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_165, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_744, ~y$w_buff1~0=v_~y$w_buff1~0_476, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_39|, ~y$w_buff0~0=v_~y$w_buff0~0_504, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_39|, ~x~0=v_~x~0_95, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_698} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_743, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_39|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_164, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ~y$w_buff1~0=v_~y$w_buff1~0_476, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_39|, ~y$w_buff0~0=v_~y$w_buff0~0_504, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_151, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_39, ~y~0=v_~y~0_629, ~x~0=v_~x~0_95, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_697} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] [2022-12-13 09:31:03,572 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L809: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_23 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x~0] and [502] $Ultimate##0-->L816: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_739 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd3~0_139 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_140 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_740 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_694 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= v_~y~0_625 (ite .cse0 v_~y$w_buff0~0_502 (ite .cse1 v_~y$w_buff1~0_474 1))) (= v_~y$w_buff0_used~0_739 (ite .cse0 0 v_~y$w_buff0_used~0_740)) (= v_~y$w_buff1_used~0_693 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_694)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_693 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_139 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_139) v_~y$r_buff1_thd3~0_138) (= |v_P0Thread1of1ForFork2_#in~arg.offset_37| v_P0Thread1of1ForFork2_~arg.offset_37) (= v_~x~0_93 v_~__unbuffered_p0_EAX~0_126) (= (ite .cse2 0 v_~y$r_buff0_thd3~0_140) v_~y$r_buff0_thd3~0_139) (= v_P0Thread1of1ForFork2_~arg.base_37 |v_P0Thread1of1ForFork2_#in~arg.base_37|)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_139, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_740, ~y$w_buff1~0=v_~y$w_buff1~0_474, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_37|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_502, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_37|, ~x~0=v_~x~0_93, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_694} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_739, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_37|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_37, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_126, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_138, ~y$w_buff1~0=v_~y$w_buff1~0_474, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_37|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_502, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_37, ~y~0=v_~y~0_625, ~x~0=v_~x~0_93, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_693} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] [2022-12-13 09:31:03,980 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [508] $Ultimate##0-->L792: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_260 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_771 256) 0))) (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_43| |v_P1Thread1of1ForFork0_~arg#1.offset_43|) (= v_~y~0_652 (ite .cse0 v_~y$mem_tmp~0_218 2)) (= v_~__unbuffered_p1_EAX~0_145 2) (= v_~y$w_buff1~0_490 v_~y$w_buff0~0_520) (= 2 v_~y$w_buff0~0_518) (= v_~y$flush_delayed~0_244 0) (= v_~weak$$choice2~0_260 |v_P1Thread1of1ForFork0_#t~nondet4#1_110|) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd2~0_326) (= |v_P1Thread1of1ForFork0_~arg#1.base_43| |v_P1Thread1of1ForFork0_#in~arg#1.base_43|) (= (ite .cse0 v_~y$w_buff0_used~0_773 (ite .cse1 v_~y$w_buff0_used~0_773 0)) v_~y$w_buff1_used~0_725) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~y$r_buff0_thd0~0_335 v_~y$r_buff1_thd0~0_350) (= v_~y$w_buff0_used~0_771 (ite .cse0 1 0)) (= v_~y~0_653 v_~y$mem_tmp~0_218) (= v_~y$r_buff0_thd1~0_166 v_~y$r_buff1_thd1~0_178) (= v_~y$r_buff0_thd3~0_149 v_~y$r_buff1_thd3~0_146) (= |v_P1Thread1of1ForFork0_#t~nondet3#1_110| v_~weak$$choice0~0_206) (= (ite (= (mod v_~y$w_buff0_used~0_773 256) 0) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|) (= v_~__unbuffered_p1_EBX~0_108 v_~x~0_105) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45| 0)) (= (ite .cse0 v_~y$r_buff0_thd2~0_328 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_326 256) 0))) (or (and .cse2 (= (mod v_~y$w_buff1_used~0_725 256) 0)) (and .cse2 (= (mod v_~y$r_buff0_thd2~0_328 256) 0)) .cse1)) v_~y$r_buff0_thd2~0_328 0)) v_~y$r_buff1_thd2~0_285))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_773, P1Thread1of1ForFork0_#t~nondet3#1=|v_P1Thread1of1ForFork0_#t~nondet3#1_110|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_43|, P1Thread1of1ForFork0_#t~nondet4#1=|v_P1Thread1of1ForFork0_#t~nondet4#1_110|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_43|, ~y$w_buff0~0=v_~y$w_buff0~0_520, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_149, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_335, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_328, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_166, ~y~0=v_~y~0_653, ~x~0=v_~x~0_105} OutVars{P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_43|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_771, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_45|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_43|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_43|, ~y$mem_tmp~0=v_~y$mem_tmp~0_218, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_518, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_149, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_166, ~y$flush_delayed~0=v_~y$flush_delayed~0_244, ~y~0=v_~y~0_652, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_45|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_108, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_285, ~weak$$choice0~0=v_~weak$$choice0~0_206, ~y$w_buff1~0=v_~y$w_buff1~0_490, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_335, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_260, ~x~0=v_~x~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_350, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_725} AuxVars[] AssignedVars[P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork0_#t~nondet3#1, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~nondet4#1, ~y$r_buff1_thd1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [505] $Ultimate##0-->L799: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd2~0_276 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_751 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_317 256) 0)))) (let ((.cse0 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_752 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_706 256) 0)) .cse2))) (and (= v_~x~0_99 1) (= v_P0Thread1of1ForFork2_~arg.base_43 |v_P0Thread1of1ForFork2_#in~arg.base_43|) (= (ite .cse0 0 v_~y$r_buff0_thd2~0_317) v_~y$r_buff0_thd2~0_316) (= v_~x~0_99 v_~__unbuffered_p0_EAX~0_132) (= |v_P0Thread1of1ForFork2_#in~arg.offset_43| v_P0Thread1of1ForFork2_~arg.offset_43) (= v_~y$r_buff1_thd2~0_275 (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_316 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_705 256) 0)) .cse2)) 0 v_~y$r_buff1_thd2~0_276)) (= v_P2Thread1of1ForFork1_~arg.base_26 |v_P2Thread1of1ForFork1_#in~arg.base_26|) (= (ite .cse3 0 v_~y$w_buff0_used~0_752) v_~y$w_buff0_used~0_751) (= v_P2Thread1of1ForFork1_~arg.offset_26 |v_P2Thread1of1ForFork1_#in~arg.offset_26|) (= v_~y$w_buff1_used~0_705 (ite (or .cse0 .cse4) 0 v_~y$w_buff1_used~0_706)) (= v_~y~0_637 (ite .cse3 v_~y$w_buff0~0_508 (ite .cse4 v_~y$w_buff1~0_480 1)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_276, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_26|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_752, ~y$w_buff1~0=v_~y$w_buff1~0_480, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_43|, ~y$w_buff0~0=v_~y$w_buff0~0_508, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_317, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_43|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_706} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_26|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_751, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_26, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_43|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_43, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_275, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_480, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_43|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_26, ~y$w_buff0~0=v_~y$w_buff0~0_508, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_316, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_43, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_26|, ~y~0=v_~y~0_637, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_705} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_p0_EAX~0, ~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~y$r_buff0_thd2~0, P0Thread1of1ForFork2_~arg.offset, ~y~0, ~x~0, P0Thread1of1ForFork2_~arg.base, ~y$w_buff1_used~0] [2022-12-13 09:31:04,359 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 09:31:04,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 990 [2022-12-13 09:31:04,360 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 304 flow [2022-12-13 09:31:04,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 09:31:04,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 09:31:04,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:04,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 09:31:04,360 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 09:31:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 09:31:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash -192099790, now seen corresponding path program 1 times [2022-12-13 09:31:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 09:31:04,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695800406] [2022-12-13 09:31:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 09:31:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 09:31:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:04,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 09:31:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 09:31:04,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 09:31:04,460 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 09:31:04,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 09:31:04,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 09:31:04,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 09:31:04,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 09:31:04,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 09:31:04,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 09:31:04,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 09:31:04,463 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 09:31:04,468 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 09:31:04,468 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 09:31:04,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:31:04 BasicIcfg [2022-12-13 09:31:04,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 09:31:04,528 INFO L158 Benchmark]: Toolchain (without parser) took 18371.33ms. Allocated memory was 175.1MB in the beginning and 703.6MB in the end (delta: 528.5MB). Free memory was 131.6MB in the beginning and 344.5MB in the end (delta: -212.9MB). Peak memory consumption was 317.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:04,530 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 09:31:04,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.38ms. Allocated memory is still 175.1MB. Free memory was 131.1MB in the beginning and 103.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 09:31:04,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.85ms. Allocated memory is still 175.1MB. Free memory was 103.7MB in the beginning and 100.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:04,531 INFO L158 Benchmark]: Boogie Preprocessor took 22.19ms. Allocated memory is still 175.1MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 09:31:04,531 INFO L158 Benchmark]: RCFGBuilder took 636.95ms. Allocated memory is still 175.1MB. Free memory was 98.6MB in the beginning and 57.1MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2022-12-13 09:31:04,531 INFO L158 Benchmark]: TraceAbstraction took 17182.35ms. Allocated memory was 175.1MB in the beginning and 703.6MB in the end (delta: 528.5MB). Free memory was 56.1MB in the beginning and 344.5MB in the end (delta: -288.4MB). Peak memory consumption was 241.6MB. Max. memory is 8.0GB. [2022-12-13 09:31:04,532 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.12ms. Allocated memory is still 175.1MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 482.38ms. Allocated memory is still 175.1MB. Free memory was 131.1MB in the beginning and 103.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.85ms. Allocated memory is still 175.1MB. Free memory was 103.7MB in the beginning and 100.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.19ms. Allocated memory is still 175.1MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 636.95ms. Allocated memory is still 175.1MB. Free memory was 98.6MB in the beginning and 57.1MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 17182.35ms. Allocated memory was 175.1MB in the beginning and 703.6MB in the end (delta: 528.5MB). Free memory was 56.1MB in the beginning and 344.5MB in the end (delta: -288.4MB). Peak memory consumption was 241.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 113 PlacesBefore, 70 PlacesAfterwards, 105 TransitionsBefore, 61 TransitionsAfterwards, 1916 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3060, independent: 2905, independent conditional: 2905, independent unconditional: 0, dependent: 155, dependent conditional: 155, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1713, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1713, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1713, independent: 1584, independent conditional: 0, independent unconditional: 1584, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 129, independent: 76, independent conditional: 0, independent unconditional: 76, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3060, independent: 1245, independent conditional: 1245, independent unconditional: 0, dependent: 102, dependent conditional: 102, dependent unconditional: 0, unknown: 1713, unknown conditional: 1713, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1714, Positive cache size: 1661, Positive conditional cache size: 1661, Positive unconditional cache size: 0, Negative cache size: 53, Negative conditional cache size: 53, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 176, independent conditional: 12, independent unconditional: 164, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 200, independent: 176, independent conditional: 12, independent unconditional: 164, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 200, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 103, dependent conditional: 9, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 230, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 200, unknown conditional: 200, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 176, Positive conditional cache size: 176, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 211, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 18, independent unconditional: 10, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 18, independent unconditional: 10, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 1, 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: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 204, Positive conditional cache size: 204, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 148, independent conditional: 148, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 224, Positive conditional cache size: 224, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 45 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 270, independent: 238, independent conditional: 238, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 34, independent conditional: 14, independent unconditional: 20, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, independent: 34, independent conditional: 14, independent unconditional: 20, 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: 40, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 270, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 258, Positive conditional cache size: 258, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 1, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 3, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 275, Positive conditional cache size: 275, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 151, independent conditional: 151, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 7, independent unconditional: 21, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 28, independent conditional: 7, independent unconditional: 21, 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: 30, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 123, independent conditional: 123, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 303, Positive conditional cache size: 303, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 9, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 9, independent unconditional: 5, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 112, independent: 83, independent conditional: 83, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 317, Positive conditional cache size: 317, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 52 PlacesBefore, 49 PlacesAfterwards, 53 TransitionsBefore, 50 TransitionsAfterwards, 478 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 411, independent: 379, independent conditional: 379, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 56, independent conditional: 51, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, independent: 56, independent conditional: 51, independent unconditional: 5, 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: 58, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 411, independent: 323, independent conditional: 323, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 58, unknown conditional: 58, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 373, Positive conditional cache size: 373, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 380, Positive conditional cache size: 380, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 51 PlacesBefore, 49 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 56, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 30, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 410, Positive conditional cache size: 410, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 53 PlacesBefore, 51 PlacesAfterwards, 50 TransitionsBefore, 49 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 16, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 428, Positive conditional cache size: 428, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1687, ((void *)0), P0, ((void *)0))=-3, t1687={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1688, ((void *)0), P1, ((void *)0))=-2, t1687={5:0}, t1688={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1689; [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1689, ((void *)0), P2, ((void *)0))=-1, t1687={5:0}, t1688={6:0}, t1689={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 [L791] 2 __unbuffered_p1_EBX = x [L808] 2 x = 1 [L743] 2 __unbuffered_p0_EAX = x [L746] 2 y = 1 [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 [L866] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 834]: 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: 836]: 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: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 305 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 801 IncrementalHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 5 mSDtfsCounter, 801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 1201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 09:31:04,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...