/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:18:06,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:18:06,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:18:06,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:18:06,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:18:06,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:18:06,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:18:06,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:18:06,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:18:06,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:18:06,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:18:06,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:18:06,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:18:06,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:18:06,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:18:06,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:18:06,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:18:06,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:18:06,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:18:06,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:18:06,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:18:06,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:18:06,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:18:06,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:18:06,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:18:06,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:18:06,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:18:06,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:18:06,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:18:06,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:18:06,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:18:06,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:18:06,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:18:06,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:18:06,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:18:06,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:18:06,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:18:06,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:18:06,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:18:06,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:18:06,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:18:06,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:18:06,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:18:06,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:18:06,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:18:06,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:18:06,602 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:18:06,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:18:06,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:18:06,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:18:06,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:18:06,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:18:06,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:18:06,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:18:06,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:18:06,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:06,605 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:18:06,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:18:06,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:18:06,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:18:06,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:18:06,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:18:06,900 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:18:06,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2022-12-06 06:18:07,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:18:08,230 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:18:08,231 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_tso.oepc.i [2022-12-06 06:18:08,252 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cf5b2e3/d426b7661d314d32b51a74566e1d0039/FLAG1e4e066c7 [2022-12-06 06:18:08,263 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cf5b2e3/d426b7661d314d32b51a74566e1d0039 [2022-12-06 06:18:08,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:18:08,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:18:08,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:08,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:18:08,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:18:08,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f02a8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08, skipping insertion in model container [2022-12-06 06:18:08,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:18:08,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:18:08,481 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/mix011_tso.oepc.i[949,962] [2022-12-06 06:18:08,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:08,691 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:18:08,701 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/mix011_tso.oepc.i[949,962] [2022-12-06 06:18:08,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:18:08,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:18:08,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:18:08,787 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:18:08,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08 WrapperNode [2022-12-06 06:18:08,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:18:08,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:08,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:18:08,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:18:08,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,845 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-06 06:18:08,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:18:08,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:18:08,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:18:08,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:18:08,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,880 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:18:08,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:18:08,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:18:08,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:18:08,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (1/1) ... [2022-12-06 06:18:08,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:18:08,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:18:08,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:18:08,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:18:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:18:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:18:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:18:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:18:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:18:08,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:18:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:18:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:18:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:18:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:18:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:18:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:18:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:18:08,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:18:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:18:08,962 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:18:09,112 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:18:09,114 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:18:09,443 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:18:09,603 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:18:09,603 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:18:09,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:09 BoogieIcfgContainer [2022-12-06 06:18:09,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:18:09,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:18:09,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:18:09,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:18:09,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:18:08" (1/3) ... [2022-12-06 06:18:09,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da36a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:09, skipping insertion in model container [2022-12-06 06:18:09,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:18:08" (2/3) ... [2022-12-06 06:18:09,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da36a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:18:09, skipping insertion in model container [2022-12-06 06:18:09,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:18:09" (3/3) ... [2022-12-06 06:18:09,611 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_tso.oepc.i [2022-12-06 06:18:09,625 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:18:09,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:18:09,625 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:18:09,702 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:18:09,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 06:18:09,783 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 06:18:09,783 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:09,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 06:18:09,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-12-06 06:18:09,791 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-12-06 06:18:09,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:09,807 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 06:18:09,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-12-06 06:18:09,830 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-12-06 06:18:09,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:09,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-06 06:18:09,834 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-12-06 06:18:09,835 INFO L188 LiptonReduction]: Number of co-enabled transitions 2198 [2022-12-06 06:18:14,414 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-06 06:18:14,432 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:18:14,439 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;@5c47e646, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:18:14,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:18:14,443 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:18:14,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:14,444 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:14,447 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:18:14,452 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-06 06:18:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash 468412760, now seen corresponding path program 1 times [2022-12-06 06:18:14,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:14,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364694274] [2022-12-06 06:18:14,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:14,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364694274] [2022-12-06 06:18:14,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364694274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:14,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:14,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936872434] [2022-12-06 06:18:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:14,842 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 06:18:14,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:14,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:14,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 06:18:14,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:15,117 INFO L130 PetriNetUnfolder]: 879/1545 cut-off events. [2022-12-06 06:18:15,117 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:18:15,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2912 conditions, 1545 events. 879/1545 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8876 event pairs, 144 based on Foata normal form. 0/1380 useless extension candidates. Maximal degree in co-relation 2901. Up to 1060 conditions per place. [2022-12-06 06:18:15,130 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 27 selfloop transitions, 2 changer transitions 6/40 dead transitions. [2022-12-06 06:18:15,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 162 flow [2022-12-06 06:18:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 06:18:15,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-06 06:18:15,140 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 55 transitions. [2022-12-06 06:18:15,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 162 flow [2022-12-06 06:18:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:18:15,145 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2022-12-06 06:18:15,147 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2022-12-06 06:18:15,151 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:18:15,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:15,152 INFO L89 Accepts]: Start accepts. Operand has 35 places, 23 transitions, 56 flow [2022-12-06 06:18:15,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:15,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:15,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 56 flow [2022-12-06 06:18:15,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2022-12-06 06:18:15,159 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:18:15,159 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:15,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:18:15,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2022-12-06 06:18:15,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-06 06:18:15,233 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:15,236 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 06:18:15,236 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2022-12-06 06:18:15,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:15,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:15,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:15,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:18:15,240 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-06 06:18:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash -52176206, now seen corresponding path program 1 times [2022-12-06 06:18:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:15,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97205367] [2022-12-06 06:18:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:15,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97205367] [2022-12-06 06:18:15,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97205367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:15,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:15,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:18:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768076428] [2022-12-06 06:18:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:15,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:15,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:15,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:15,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-06 06:18:15,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:15,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:15,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-06 06:18:15,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:15,625 INFO L130 PetriNetUnfolder]: 631/1021 cut-off events. [2022-12-06 06:18:15,625 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2022-12-06 06:18:15,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2107 conditions, 1021 events. 631/1021 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4741 event pairs, 247 based on Foata normal form. 32/1040 useless extension candidates. Maximal degree in co-relation 2097. Up to 609 conditions per place. [2022-12-06 06:18:15,630 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 25 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 06:18:15,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 128 flow [2022-12-06 06:18:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-06 06:18:15,632 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5797101449275363 [2022-12-06 06:18:15,632 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 40 transitions. [2022-12-06 06:18:15,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 128 flow [2022-12-06 06:18:15,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:15,634 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 60 flow [2022-12-06 06:18:15,635 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-06 06:18:15,635 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-06 06:18:15,635 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:15,635 INFO L89 Accepts]: Start accepts. Operand has 33 places, 23 transitions, 60 flow [2022-12-06 06:18:15,636 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:15,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:15,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 60 flow [2022-12-06 06:18:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2022-12-06 06:18:15,647 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2022-12-06 06:18:15,648 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:18:15,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 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-06 06:18:15,648 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 60 flow [2022-12-06 06:18:15,648 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 06:18:15,684 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:15,685 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 06:18:15,686 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-06 06:18:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:15,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:15,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:15,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:18:15,687 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-06 06:18:15,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1616476750, now seen corresponding path program 1 times [2022-12-06 06:18:15,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:15,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414420098] [2022-12-06 06:18:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:15,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:15,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414420098] [2022-12-06 06:18:15,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414420098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:15,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:15,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175845467] [2022-12-06 06:18:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:15,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:15,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 06:18:15,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:15,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:15,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 06:18:15,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:16,199 INFO L130 PetriNetUnfolder]: 1236/1837 cut-off events. [2022-12-06 06:18:16,199 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-06 06:18:16,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4011 conditions, 1837 events. 1236/1837 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7721 event pairs, 360 based on Foata normal form. 40/1877 useless extension candidates. Maximal degree in co-relation 4000. Up to 1357 conditions per place. [2022-12-06 06:18:16,209 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2022-12-06 06:18:16,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 155 flow [2022-12-06 06:18:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:18:16,211 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2022-12-06 06:18:16,211 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:18:16,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 155 flow [2022-12-06 06:18:16,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 149 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:16,213 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2022-12-06 06:18:16,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-06 06:18:16,214 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2022-12-06 06:18:16,214 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:16,214 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 62 flow [2022-12-06 06:18:16,215 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:16,215 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:16,215 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 62 flow [2022-12-06 06:18:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 62 flow [2022-12-06 06:18:16,218 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-06 06:18:16,219 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:18:16,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 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-06 06:18:16,219 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 62 flow [2022-12-06 06:18:16,219 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:18:16,347 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:16,348 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 06:18:16,348 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2022-12-06 06:18:16,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:16,348 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:16,348 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:16,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:18:16,348 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-06 06:18:16,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1646371409, now seen corresponding path program 1 times [2022-12-06 06:18:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:16,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505975445] [2022-12-06 06:18:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:16,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505975445] [2022-12-06 06:18:16,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505975445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:16,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:16,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:16,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414775218] [2022-12-06 06:18:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:16,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:16,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:18:16,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:16,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:16,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:18:16,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:17,036 INFO L130 PetriNetUnfolder]: 659/1077 cut-off events. [2022-12-06 06:18:17,039 INFO L131 PetriNetUnfolder]: For 185/185 co-relation queries the response was YES. [2022-12-06 06:18:17,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2426 conditions, 1077 events. 659/1077 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5047 event pairs, 155 based on Foata normal form. 6/1081 useless extension candidates. Maximal degree in co-relation 2414. Up to 872 conditions per place. [2022-12-06 06:18:17,046 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2022-12-06 06:18:17,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 197 flow [2022-12-06 06:18:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 06:18:17,049 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 06:18:17,049 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 4 states and 50 transitions. [2022-12-06 06:18:17,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 197 flow [2022-12-06 06:18:17,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:17,051 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 96 flow [2022-12-06 06:18:17,051 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 06:18:17,053 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 06:18:17,053 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:17,053 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 96 flow [2022-12-06 06:18:17,055 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:17,055 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:17,055 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 96 flow [2022-12-06 06:18:17,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 96 flow [2022-12-06 06:18:17,063 INFO L130 PetriNetUnfolder]: 15/58 cut-off events. [2022-12-06 06:18:17,063 INFO L131 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2022-12-06 06:18:17,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 58 events. 15/58 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 187 event pairs, 7 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 121. Up to 27 conditions per place. [2022-12-06 06:18:17,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 96 flow [2022-12-06 06:18:17,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 06:18:17,083 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:17,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 06:18:17,084 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 96 flow [2022-12-06 06:18:17,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:17,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:17,084 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:17,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:18:17,085 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-06 06:18:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1659196055, now seen corresponding path program 1 times [2022-12-06 06:18:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:17,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250538446] [2022-12-06 06:18:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:17,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:17,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250538446] [2022-12-06 06:18:17,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250538446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:17,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:17,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890463491] [2022-12-06 06:18:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:17,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:17,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:17,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:17,397 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:18:17,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:17,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:17,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:18:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:17,585 INFO L130 PetriNetUnfolder]: 709/1151 cut-off events. [2022-12-06 06:18:17,585 INFO L131 PetriNetUnfolder]: For 470/477 co-relation queries the response was YES. [2022-12-06 06:18:17,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 1151 events. 709/1151 cut-off events. For 470/477 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5418 event pairs, 109 based on Foata normal form. 8/1155 useless extension candidates. Maximal degree in co-relation 2975. Up to 864 conditions per place. [2022-12-06 06:18:17,592 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 42 selfloop transitions, 12 changer transitions 0/56 dead transitions. [2022-12-06 06:18:17,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 286 flow [2022-12-06 06:18:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-12-06 06:18:17,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2022-12-06 06:18:17,593 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 96 flow. Second operand 5 states and 61 transitions. [2022-12-06 06:18:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 286 flow [2022-12-06 06:18:17,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:18:17,595 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 171 flow [2022-12-06 06:18:17,596 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 06:18:17,596 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 06:18:17,596 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:17,596 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 171 flow [2022-12-06 06:18:17,597 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:17,597 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:17,597 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 171 flow [2022-12-06 06:18:17,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 171 flow [2022-12-06 06:18:17,621 INFO L130 PetriNetUnfolder]: 64/154 cut-off events. [2022-12-06 06:18:17,621 INFO L131 PetriNetUnfolder]: For 166/182 co-relation queries the response was YES. [2022-12-06 06:18:17,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 154 events. 64/154 cut-off events. For 166/182 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 694 event pairs, 22 based on Foata normal form. 3/149 useless extension candidates. Maximal degree in co-relation 460. Up to 84 conditions per place. [2022-12-06 06:18:17,622 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 171 flow [2022-12-06 06:18:17,622 INFO L188 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-06 06:18:17,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L750-->L753: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [430] L2-1-->L851: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_201 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd0~0_95 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_102 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_202 256) 0)))) (.cse2 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_175 256) 0)))) (.cse3 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd0~0_94 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_174 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd0~0_101 256) 0)))) 0 v_~x$r_buff1_thd0~0_95)) (= (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_175) v_~x$w_buff1_used~0_174) (= (ite .cse4 0 v_~x$w_buff0_used~0_202) v_~x$w_buff0_used~0_201) (= (ite .cse4 v_~x$w_buff0~0_119 (ite .cse2 v_~x$w_buff1~0_98 v_~x~0_135)) v_~x~0_134) (= v_~x$r_buff0_thd0~0_101 (ite .cse3 0 v_~x$r_buff0_thd0~0_102))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_119, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_175, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_95, ~x~0=v_~x~0_135, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_202} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_119, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_101, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_174, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_94, ~x~0=v_~x~0_134, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_201} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:18:17,815 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L750-->L753: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [356] L811-->L818: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_61 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_32 v_~x~0_62))) (= v_~x$w_buff1_used~0_90 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_91)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20) v_~x$r_buff1_thd3~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:18:17,874 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L750-->L753: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [467] $Ultimate##0-->L785: Formula: (and (= v_~y~0_54 1) (= v_~x$r_buff0_thd1~0_115 v_~x$r_buff1_thd1~0_110) (= v_~y~0_54 v_~__unbuffered_p1_EAX~0_88) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_37| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_37|) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_23| |v_P1Thread1of1ForFork2_~arg#1.offset_23|) (= 2 v_~x$w_buff0~0_282) (= v_~x$r_buff1_thd3~0_89 v_~x$r_buff0_thd3~0_87) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_37| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_432 256) 0)) (not (= (mod v_~x$w_buff1_used~0_395 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_433 v_~x$w_buff1_used~0_395) (= v_~x$w_buff0~0_283 v_~x$w_buff1~0_251) (= v_~x$w_buff0_used~0_432 1) (= v_~x$r_buff0_thd2~0_140 1) (= v_~x$r_buff0_thd2~0_141 v_~x$r_buff1_thd2~0_105) (= v_~x$r_buff0_thd0~0_247 v_~x$r_buff1_thd0~0_243) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_23| |v_P1Thread1of1ForFork2_~arg#1.base_23|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_37| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_283, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_247, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_141, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_433, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_282, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_247, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ~x$w_buff1~0=v_~x$w_buff1~0_251, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_89, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_395, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_432, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_37|, ~y~0=v_~y~0_54, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_23|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y~0, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:18:17,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] L750-->L785: Formula: (and (= v_~y~0_60 v_~__unbuffered_p1_EAX~0_96) (= 2 v_~x$w_buff0~0_320) (= v_~x$w_buff0_used~0_498 1) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_29| |v_P1Thread1of1ForFork2_~arg#1.base_29|) (= v_~x$w_buff0~0_321 v_~x$w_buff1~0_285) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_43| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_498 256) 0)) (not (= (mod v_~x$w_buff1_used~0_455 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd2~0_161 v_~x$r_buff1_thd2~0_119) (= v_~x~0_408 1) (= v_~x$r_buff0_thd0~0_275 v_~x$r_buff1_thd0~0_269) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_29| |v_P1Thread1of1ForFork2_~arg#1.offset_29|) (= v_~x$r_buff0_thd3~0_105 v_~x$r_buff1_thd3~0_107) (= v_~x$w_buff0_used~0_499 v_~x$w_buff1_used~0_455) (= v_~x$r_buff0_thd2~0_160 1) (= v_~y~0_60 1) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_43| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_43|) (= v_~x$r_buff0_thd1~0_137 v_~x$r_buff1_thd1~0_134)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_321, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_275, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_105, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_161, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_499, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_29|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_320, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_29|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_275, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_137, ~x$w_buff1~0=v_~x$w_buff1~0_285, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_107, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_119, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_455, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_134, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_105, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_160, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_269, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_498, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_43|, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_29|, ~x~0=v_~x~0_408, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_29|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~x~0] and [338] L753-->L760: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= v_~x$w_buff1_used~0_104 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_104 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_73 (ite .cse4 v_~x$w_buff0~0_45 (ite .cse0 v_~x$w_buff1~0_40 v_~x~0_74))) (= (ite .cse4 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:18:18,179 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:18:18,179 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 583 [2022-12-06 06:18:18,180 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 192 flow [2022-12-06 06:18:18,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:18,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:18,180 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:18,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:18:18,180 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-06 06:18:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1747550606, now seen corresponding path program 1 times [2022-12-06 06:18:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:18,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220091458] [2022-12-06 06:18:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:18,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:18,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220091458] [2022-12-06 06:18:18,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220091458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:18,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:18,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742330626] [2022-12-06 06:18:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:18,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:18,669 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:18:18,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:18,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:18,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:18:18,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:18,884 INFO L130 PetriNetUnfolder]: 757/1234 cut-off events. [2022-12-06 06:18:18,884 INFO L131 PetriNetUnfolder]: For 1866/1899 co-relation queries the response was YES. [2022-12-06 06:18:18,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1234 events. 757/1234 cut-off events. For 1866/1899 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6111 event pairs, 135 based on Foata normal form. 18/1233 useless extension candidates. Maximal degree in co-relation 4082. Up to 769 conditions per place. [2022-12-06 06:18:18,894 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 40 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2022-12-06 06:18:18,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 376 flow [2022-12-06 06:18:18,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:18,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:18:18,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-06 06:18:18,897 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 192 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:18:18,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 376 flow [2022-12-06 06:18:18,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 359 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:18:18,904 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 237 flow [2022-12-06 06:18:18,904 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-06 06:18:18,906 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 06:18:18,907 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:18,907 INFO L89 Accepts]: Start accepts. Operand has 43 places, 36 transitions, 237 flow [2022-12-06 06:18:18,907 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:18,907 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:18,907 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 237 flow [2022-12-06 06:18:18,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 237 flow [2022-12-06 06:18:18,937 INFO L130 PetriNetUnfolder]: 73/168 cut-off events. [2022-12-06 06:18:18,938 INFO L131 PetriNetUnfolder]: For 464/582 co-relation queries the response was YES. [2022-12-06 06:18:18,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 168 events. 73/168 cut-off events. For 464/582 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 742 event pairs, 24 based on Foata normal form. 9/167 useless extension candidates. Maximal degree in co-relation 627. Up to 98 conditions per place. [2022-12-06 06:18:18,939 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 237 flow [2022-12-06 06:18:18,939 INFO L188 LiptonReduction]: Number of co-enabled transitions 340 [2022-12-06 06:18:18,943 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:18,943 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 06:18:18,943 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 237 flow [2022-12-06 06:18:18,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:18,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:18,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:18,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:18:18,944 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-06 06:18:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1747588705, now seen corresponding path program 1 times [2022-12-06 06:18:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:18,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717613937] [2022-12-06 06:18:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:18,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:19,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717613937] [2022-12-06 06:18:19,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717613937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:19,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:19,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:19,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311869355] [2022-12-06 06:18:19,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:19,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:19,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:19,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:19,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:19,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:18:19,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:19,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:19,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:18:19,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:19,633 INFO L130 PetriNetUnfolder]: 809/1314 cut-off events. [2022-12-06 06:18:19,633 INFO L131 PetriNetUnfolder]: For 3429/3497 co-relation queries the response was YES. [2022-12-06 06:18:19,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4792 conditions, 1314 events. 809/1314 cut-off events. For 3429/3497 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6511 event pairs, 94 based on Foata normal form. 24/1333 useless extension candidates. Maximal degree in co-relation 4772. Up to 987 conditions per place. [2022-12-06 06:18:19,643 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 42 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2022-12-06 06:18:19,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 423 flow [2022-12-06 06:18:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-12-06 06:18:19,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:18:19,645 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 237 flow. Second operand 4 states and 52 transitions. [2022-12-06 06:18:19,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 423 flow [2022-12-06 06:18:19,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 404 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:18:19,648 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 280 flow [2022-12-06 06:18:19,648 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-06 06:18:19,649 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-06 06:18:19,649 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:19,649 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 280 flow [2022-12-06 06:18:19,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:19,649 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:19,649 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 280 flow [2022-12-06 06:18:19,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 280 flow [2022-12-06 06:18:19,668 INFO L130 PetriNetUnfolder]: 77/180 cut-off events. [2022-12-06 06:18:19,668 INFO L131 PetriNetUnfolder]: For 541/728 co-relation queries the response was YES. [2022-12-06 06:18:19,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 180 events. 77/180 cut-off events. For 541/728 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 788 event pairs, 20 based on Foata normal form. 9/180 useless extension candidates. Maximal degree in co-relation 728. Up to 106 conditions per place. [2022-12-06 06:18:19,670 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 280 flow [2022-12-06 06:18:19,670 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 06:18:19,674 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:19,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:18:19,674 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 280 flow [2022-12-06 06:18:19,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:19,675 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:19,675 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:19,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:18:19,675 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-06 06:18:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1747549645, now seen corresponding path program 2 times [2022-12-06 06:18:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:19,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736410102] [2022-12-06 06:18:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:19,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:20,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:20,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736410102] [2022-12-06 06:18:20,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736410102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:20,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:20,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284695886] [2022-12-06 06:18:20,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:20,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:20,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:20,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:20,073 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:18:20,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:20,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:20,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:18:20,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:20,299 INFO L130 PetriNetUnfolder]: 819/1332 cut-off events. [2022-12-06 06:18:20,299 INFO L131 PetriNetUnfolder]: For 4014/4101 co-relation queries the response was YES. [2022-12-06 06:18:20,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5213 conditions, 1332 events. 819/1332 cut-off events. For 4014/4101 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6593 event pairs, 99 based on Foata normal form. 21/1348 useless extension candidates. Maximal degree in co-relation 5193. Up to 799 conditions per place. [2022-12-06 06:18:20,309 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 41 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2022-12-06 06:18:20,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 486 flow [2022-12-06 06:18:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 06:18:20,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2022-12-06 06:18:20,312 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 280 flow. Second operand 4 states and 55 transitions. [2022-12-06 06:18:20,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 486 flow [2022-12-06 06:18:20,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 464 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:20,316 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 333 flow [2022-12-06 06:18:20,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-12-06 06:18:20,319 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2022-12-06 06:18:20,319 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:20,319 INFO L89 Accepts]: Start accepts. Operand has 46 places, 41 transitions, 333 flow [2022-12-06 06:18:20,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:20,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:20,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 333 flow [2022-12-06 06:18:20,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 333 flow [2022-12-06 06:18:20,346 INFO L130 PetriNetUnfolder]: 78/185 cut-off events. [2022-12-06 06:18:20,347 INFO L131 PetriNetUnfolder]: For 842/1142 co-relation queries the response was YES. [2022-12-06 06:18:20,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 185 events. 78/185 cut-off events. For 842/1142 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 840 event pairs, 20 based on Foata normal form. 15/191 useless extension candidates. Maximal degree in co-relation 846. Up to 109 conditions per place. [2022-12-06 06:18:20,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 333 flow [2022-12-06 06:18:20,349 INFO L188 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-06 06:18:20,354 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:20,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:18:20,356 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 333 flow [2022-12-06 06:18:20,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:20,356 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:20,356 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:20,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:18:20,357 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-06 06:18:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1660502860, now seen corresponding path program 1 times [2022-12-06 06:18:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:20,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587685362] [2022-12-06 06:18:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:21,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587685362] [2022-12-06 06:18:21,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587685362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:21,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:21,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:21,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787780766] [2022-12-06 06:18:21,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:21,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:18:21,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:21,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:18:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:18:21,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:18:21,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:21,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:21,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:18:21,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:21,255 INFO L130 PetriNetUnfolder]: 836/1365 cut-off events. [2022-12-06 06:18:21,255 INFO L131 PetriNetUnfolder]: For 5647/5769 co-relation queries the response was YES. [2022-12-06 06:18:21,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5775 conditions, 1365 events. 836/1365 cut-off events. For 5647/5769 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6867 event pairs, 99 based on Foata normal form. 36/1396 useless extension candidates. Maximal degree in co-relation 5754. Up to 1000 conditions per place. [2022-12-06 06:18:21,265 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 45 selfloop transitions, 15 changer transitions 0/62 dead transitions. [2022-12-06 06:18:21,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 576 flow [2022-12-06 06:18:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 06:18:21,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5096153846153846 [2022-12-06 06:18:21,267 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 333 flow. Second operand 4 states and 53 transitions. [2022-12-06 06:18:21,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 576 flow [2022-12-06 06:18:21,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:21,271 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 416 flow [2022-12-06 06:18:21,271 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=416, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2022-12-06 06:18:21,272 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 06:18:21,272 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:21,272 INFO L89 Accepts]: Start accepts. Operand has 48 places, 45 transitions, 416 flow [2022-12-06 06:18:21,272 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:21,273 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:21,273 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 416 flow [2022-12-06 06:18:21,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 416 flow [2022-12-06 06:18:21,294 INFO L130 PetriNetUnfolder]: 81/194 cut-off events. [2022-12-06 06:18:21,294 INFO L131 PetriNetUnfolder]: For 1127/1465 co-relation queries the response was YES. [2022-12-06 06:18:21,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 194 events. 81/194 cut-off events. For 1127/1465 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 898 event pairs, 20 based on Foata normal form. 12/197 useless extension candidates. Maximal degree in co-relation 956. Up to 115 conditions per place. [2022-12-06 06:18:21,296 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 416 flow [2022-12-06 06:18:21,296 INFO L188 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-06 06:18:21,300 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:21,301 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 06:18:21,301 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 416 flow [2022-12-06 06:18:21,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:21,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:21,301 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:21,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:18:21,301 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-06 06:18:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1660478835, now seen corresponding path program 1 times [2022-12-06 06:18:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:21,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429927540] [2022-12-06 06:18:21,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:21,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:21,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:21,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429927540] [2022-12-06 06:18:21,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429927540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:21,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:21,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440874852] [2022-12-06 06:18:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:21,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:18:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:18:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:18:21,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:18:21,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:21,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:21,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:18:21,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:21,999 INFO L130 PetriNetUnfolder]: 856/1401 cut-off events. [2022-12-06 06:18:22,000 INFO L131 PetriNetUnfolder]: For 7296/7446 co-relation queries the response was YES. [2022-12-06 06:18:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6256 conditions, 1401 events. 856/1401 cut-off events. For 7296/7446 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7079 event pairs, 94 based on Foata normal form. 36/1432 useless extension candidates. Maximal degree in co-relation 6234. Up to 841 conditions per place. [2022-12-06 06:18:22,017 INFO L137 encePairwiseOnDemand]: 16/26 looper letters, 48 selfloop transitions, 29 changer transitions 0/79 dead transitions. [2022-12-06 06:18:22,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 765 flow [2022-12-06 06:18:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:18:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:18:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-12-06 06:18:22,018 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2022-12-06 06:18:22,018 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 416 flow. Second operand 6 states and 74 transitions. [2022-12-06 06:18:22,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 765 flow [2022-12-06 06:18:22,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 733 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:22,025 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 573 flow [2022-12-06 06:18:22,025 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-06 06:18:22,026 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-06 06:18:22,026 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:22,026 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 573 flow [2022-12-06 06:18:22,027 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:22,027 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:22,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 573 flow [2022-12-06 06:18:22,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 573 flow [2022-12-06 06:18:22,051 INFO L130 PetriNetUnfolder]: 84/203 cut-off events. [2022-12-06 06:18:22,051 INFO L131 PetriNetUnfolder]: For 1724/2202 co-relation queries the response was YES. [2022-12-06 06:18:22,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 203 events. 84/203 cut-off events. For 1724/2202 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 974 event pairs, 22 based on Foata normal form. 19/213 useless extension candidates. Maximal degree in co-relation 1136. Up to 121 conditions per place. [2022-12-06 06:18:22,053 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 573 flow [2022-12-06 06:18:22,053 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 06:18:22,114 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L750-->L851: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_490 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_272 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_266 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_448 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_491 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_316 (ite .cse1 v_~x$w_buff1~0_281 1)) v_~x~0_400) (= v_~x$w_buff1_used~0_447 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_448)) (= v_~x$r_buff0_thd0~0_271 (ite .cse2 0 v_~x$r_buff0_thd0~0_272)) (= v_~x$w_buff0_used~0_490 (ite .cse0 0 v_~x$w_buff0_used~0_491)) (= v_~x$r_buff1_thd0~0_265 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_447 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_271 256) 0)))) 0 v_~x$r_buff1_thd0~0_266))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_272, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_266, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_491} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_271, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, ~x~0=v_~x~0_400, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_490} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [338] L753-->L760: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= v_~x$w_buff1_used~0_104 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_104 256) 0))) (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)))) 0 v_~x$r_buff1_thd1~0_22)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_73 (ite .cse4 v_~x$w_buff0~0_45 (ite .cse0 v_~x$w_buff1~0_40 v_~x~0_74))) (= (ite .cse4 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_45, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:18:22,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L750-->L851: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_490 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_272 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_266 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_448 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_491 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_316 (ite .cse1 v_~x$w_buff1~0_281 1)) v_~x~0_400) (= v_~x$w_buff1_used~0_447 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_448)) (= v_~x$r_buff0_thd0~0_271 (ite .cse2 0 v_~x$r_buff0_thd0~0_272)) (= v_~x$w_buff0_used~0_490 (ite .cse0 0 v_~x$w_buff0_used~0_491)) (= v_~x$r_buff1_thd0~0_265 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_447 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_271 256) 0)))) 0 v_~x$r_buff1_thd0~0_266))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_272, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_266, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_491} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_271, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, ~x~0=v_~x~0_400, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_490} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [356] L811-->L818: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256))))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_91 256) 0)))) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_61 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_32 v_~x~0_62))) (= v_~x$w_buff1_used~0_90 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_91)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_90 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20) v_~x$r_buff1_thd3~0_19)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_91, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_90, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:18:22,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [469] L750-->L851: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_490 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_272 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_266 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_448 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_491 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_316 (ite .cse1 v_~x$w_buff1~0_281 1)) v_~x~0_400) (= v_~x$w_buff1_used~0_447 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_448)) (= v_~x$r_buff0_thd0~0_271 (ite .cse2 0 v_~x$r_buff0_thd0~0_272)) (= v_~x$w_buff0_used~0_490 (ite .cse0 0 v_~x$w_buff0_used~0_491)) (= v_~x$r_buff1_thd0~0_265 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_447 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd0~0_271 256) 0)))) 0 v_~x$r_buff1_thd0~0_266))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_272, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_448, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_266, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_491} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_316, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_271, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_265, ~x~0=v_~x~0_400, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_490} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [467] $Ultimate##0-->L785: Formula: (and (= v_~y~0_54 1) (= v_~x$r_buff0_thd1~0_115 v_~x$r_buff1_thd1~0_110) (= v_~y~0_54 v_~__unbuffered_p1_EAX~0_88) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_37| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_37|) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_23| |v_P1Thread1of1ForFork2_~arg#1.offset_23|) (= 2 v_~x$w_buff0~0_282) (= v_~x$r_buff1_thd3~0_89 v_~x$r_buff0_thd3~0_87) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_37| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_432 256) 0)) (not (= (mod v_~x$w_buff1_used~0_395 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_433 v_~x$w_buff1_used~0_395) (= v_~x$w_buff0~0_283 v_~x$w_buff1~0_251) (= v_~x$w_buff0_used~0_432 1) (= v_~x$r_buff0_thd2~0_140 1) (= v_~x$r_buff0_thd2~0_141 v_~x$r_buff1_thd2~0_105) (= v_~x$r_buff0_thd0~0_247 v_~x$r_buff1_thd0~0_243) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_23| |v_P1Thread1of1ForFork2_~arg#1.base_23|) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_37| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_283, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_247, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_141, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_433, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_282, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_247, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ~x$w_buff1~0=v_~x$w_buff1~0_251, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_89, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_105, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_395, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_87, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_140, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_23|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_432, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_37|, ~y~0=v_~y~0_54, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_23|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_23|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y~0, P1Thread1of1ForFork2_~arg#1.offset] [2022-12-06 06:18:22,591 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:18:22,592 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 566 [2022-12-06 06:18:22,592 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 583 flow [2022-12-06 06:18:22,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:22,592 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:22,592 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:22,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:18:22,593 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-06 06:18:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1284864086, now seen corresponding path program 1 times [2022-12-06 06:18:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:22,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252364370] [2022-12-06 06:18:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:22,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:22,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252364370] [2022-12-06 06:18:22,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252364370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:22,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:22,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:22,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956844403] [2022-12-06 06:18:22,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:22,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:22,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:22,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 06:18:22,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 583 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:22,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:22,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 06:18:22,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:23,278 INFO L130 PetriNetUnfolder]: 2000/3045 cut-off events. [2022-12-06 06:18:23,279 INFO L131 PetriNetUnfolder]: For 19961/19961 co-relation queries the response was YES. [2022-12-06 06:18:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13607 conditions, 3045 events. 2000/3045 cut-off events. For 19961/19961 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 15326 event pairs, 167 based on Foata normal form. 54/3099 useless extension candidates. Maximal degree in co-relation 13583. Up to 1505 conditions per place. [2022-12-06 06:18:23,298 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 92 selfloop transitions, 11 changer transitions 25/128 dead transitions. [2022-12-06 06:18:23,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 128 transitions, 1647 flow [2022-12-06 06:18:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 06:18:23,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2022-12-06 06:18:23,299 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 583 flow. Second operand 5 states and 67 transitions. [2022-12-06 06:18:23,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 128 transitions, 1647 flow [2022-12-06 06:18:23,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 128 transitions, 1557 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 06:18:23,320 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 703 flow [2022-12-06 06:18:23,320 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=703, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2022-12-06 06:18:23,321 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-06 06:18:23,321 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:23,321 INFO L89 Accepts]: Start accepts. Operand has 57 places, 61 transitions, 703 flow [2022-12-06 06:18:23,324 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:23,324 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:23,324 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 61 transitions, 703 flow [2022-12-06 06:18:23,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 61 transitions, 703 flow [2022-12-06 06:18:23,364 INFO L130 PetriNetUnfolder]: 150/369 cut-off events. [2022-12-06 06:18:23,365 INFO L131 PetriNetUnfolder]: For 3194/3473 co-relation queries the response was YES. [2022-12-06 06:18:23,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 369 events. 150/369 cut-off events. For 3194/3473 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2136 event pairs, 11 based on Foata normal form. 22/371 useless extension candidates. Maximal degree in co-relation 1981. Up to 204 conditions per place. [2022-12-06 06:18:23,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 61 transitions, 703 flow [2022-12-06 06:18:23,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 460 [2022-12-06 06:18:23,379 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:23,381 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-06 06:18:23,381 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 703 flow [2022-12-06 06:18:23,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:23,382 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:23,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:23,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:18:23,382 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-06 06:18:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 750759841, now seen corresponding path program 1 times [2022-12-06 06:18:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:23,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749125910] [2022-12-06 06:18:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:23,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749125910] [2022-12-06 06:18:23,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749125910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:23,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:23,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:18:23,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465690227] [2022-12-06 06:18:23,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:23,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:18:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:18:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:18:23,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 06:18:23,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:23,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:23,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 06:18:23,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:23,667 INFO L130 PetriNetUnfolder]: 627/1124 cut-off events. [2022-12-06 06:18:23,667 INFO L131 PetriNetUnfolder]: For 9113/9118 co-relation queries the response was YES. [2022-12-06 06:18:23,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5616 conditions, 1124 events. 627/1124 cut-off events. For 9113/9118 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5940 event pairs, 113 based on Foata normal form. 63/1172 useless extension candidates. Maximal degree in co-relation 5589. Up to 865 conditions per place. [2022-12-06 06:18:23,673 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 56 selfloop transitions, 4 changer transitions 12/77 dead transitions. [2022-12-06 06:18:23,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 962 flow [2022-12-06 06:18:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:18:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:18:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 06:18:23,675 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-06 06:18:23,675 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 703 flow. Second operand 3 states and 50 transitions. [2022-12-06 06:18:23,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 962 flow [2022-12-06 06:18:23,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 941 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:18:23,682 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 479 flow [2022-12-06 06:18:23,682 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-06 06:18:23,683 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 06:18:23,683 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:23,683 INFO L89 Accepts]: Start accepts. Operand has 59 places, 48 transitions, 479 flow [2022-12-06 06:18:23,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:23,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:23,684 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 479 flow [2022-12-06 06:18:23,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 479 flow [2022-12-06 06:18:23,727 INFO L130 PetriNetUnfolder]: 179/444 cut-off events. [2022-12-06 06:18:23,727 INFO L131 PetriNetUnfolder]: For 2844/2931 co-relation queries the response was YES. [2022-12-06 06:18:23,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 444 events. 179/444 cut-off events. For 2844/2931 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2677 event pairs, 43 based on Foata normal form. 14/427 useless extension candidates. Maximal degree in co-relation 2173. Up to 216 conditions per place. [2022-12-06 06:18:23,731 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 479 flow [2022-12-06 06:18:23,732 INFO L188 LiptonReduction]: Number of co-enabled transitions 402 [2022-12-06 06:18:23,733 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:23,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 06:18:23,734 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 479 flow [2022-12-06 06:18:23,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:23,734 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:23,734 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:23,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:18:23,734 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:23,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash -831235627, now seen corresponding path program 1 times [2022-12-06 06:18:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:23,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841881251] [2022-12-06 06:18:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:23,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:23,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841881251] [2022-12-06 06:18:23,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841881251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:23,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:23,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:18:23,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693808153] [2022-12-06 06:18:23,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:23,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:18:23,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:23,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:18:23,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:18:23,837 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:18:23,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 479 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:23,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:23,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:18:23,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:23,960 INFO L130 PetriNetUnfolder]: 313/620 cut-off events. [2022-12-06 06:18:23,961 INFO L131 PetriNetUnfolder]: For 4531/4536 co-relation queries the response was YES. [2022-12-06 06:18:23,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3231 conditions, 620 events. 313/620 cut-off events. For 4531/4536 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3056 event pairs, 57 based on Foata normal form. 68/679 useless extension candidates. Maximal degree in co-relation 3202. Up to 207 conditions per place. [2022-12-06 06:18:23,963 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 60 selfloop transitions, 7 changer transitions 9/81 dead transitions. [2022-12-06 06:18:23,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 954 flow [2022-12-06 06:18:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:18:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:18:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 06:18:23,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 06:18:23,965 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 479 flow. Second operand 4 states and 62 transitions. [2022-12-06 06:18:23,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 954 flow [2022-12-06 06:18:23,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 856 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-06 06:18:23,972 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 430 flow [2022-12-06 06:18:23,972 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-06 06:18:23,973 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 06:18:23,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:23,973 INFO L89 Accepts]: Start accepts. Operand has 59 places, 48 transitions, 430 flow [2022-12-06 06:18:23,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:23,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:23,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 48 transitions, 430 flow [2022-12-06 06:18:23,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 48 transitions, 430 flow [2022-12-06 06:18:23,998 INFO L130 PetriNetUnfolder]: 77/234 cut-off events. [2022-12-06 06:18:23,998 INFO L131 PetriNetUnfolder]: For 903/975 co-relation queries the response was YES. [2022-12-06 06:18:23,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 234 events. 77/234 cut-off events. For 903/975 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1188 event pairs, 7 based on Foata normal form. 17/243 useless extension candidates. Maximal degree in co-relation 1015. Up to 87 conditions per place. [2022-12-06 06:18:24,000 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 48 transitions, 430 flow [2022-12-06 06:18:24,000 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 06:18:24,001 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:18:24,003 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 06:18:24,003 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 430 flow [2022-12-06 06:18:24,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:24,003 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:18:24,003 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:18:24,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:18:24,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:18:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:18:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash -961989581, now seen corresponding path program 1 times [2022-12-06 06:18:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:18:24,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438144853] [2022-12-06 06:18:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:18:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:18:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:18:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:18:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:18:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438144853] [2022-12-06 06:18:24,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438144853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:18:24,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:18:24,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:18:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814034362] [2022-12-06 06:18:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:18:24,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:18:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:18:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:18:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:18:24,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-06 06:18:24,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 430 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:18:24,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:18:24,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-06 06:18:24,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:18:24,298 INFO L130 PetriNetUnfolder]: 270/525 cut-off events. [2022-12-06 06:18:24,298 INFO L131 PetriNetUnfolder]: For 2858/2863 co-relation queries the response was YES. [2022-12-06 06:18:24,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 525 events. 270/525 cut-off events. For 2858/2863 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2536 event pairs, 52 based on Foata normal form. 21/537 useless extension candidates. Maximal degree in co-relation 2546. Up to 207 conditions per place. [2022-12-06 06:18:24,302 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 48 selfloop transitions, 10 changer transitions 17/79 dead transitions. [2022-12-06 06:18:24,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 861 flow [2022-12-06 06:18:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:18:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:18:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-12-06 06:18:24,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 06:18:24,304 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 430 flow. Second operand 5 states and 65 transitions. [2022-12-06 06:18:24,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 861 flow [2022-12-06 06:18:24,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 727 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-06 06:18:24,314 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 295 flow [2022-12-06 06:18:24,314 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2022-12-06 06:18:24,315 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-06 06:18:24,315 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:18:24,315 INFO L89 Accepts]: Start accepts. Operand has 57 places, 41 transitions, 295 flow [2022-12-06 06:18:24,317 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:18:24,317 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:18:24,317 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 295 flow [2022-12-06 06:18:24,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 41 transitions, 295 flow [2022-12-06 06:18:24,332 INFO L130 PetriNetUnfolder]: 29/105 cut-off events. [2022-12-06 06:18:24,332 INFO L131 PetriNetUnfolder]: For 278/294 co-relation queries the response was YES. [2022-12-06 06:18:24,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 105 events. 29/105 cut-off events. For 278/294 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 410 event pairs, 0 based on Foata normal form. 2/102 useless extension candidates. Maximal degree in co-relation 376. Up to 31 conditions per place. [2022-12-06 06:18:24,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 295 flow [2022-12-06 06:18:24,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-06 06:18:24,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [472] L750-->L760: Formula: (let ((.cse4 (= (mod v_~x$w_buff0_used~0_504 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_502 256) 0))) (.cse1 (not (= (mod v_~x$r_buff0_thd1~0_140 256) 0)))) (let ((.cse2 (and .cse0 .cse1)) (.cse3 (and (not .cse4) .cse1))) (and (= v_~x$w_buff0~0_325 v_~x$w_buff1~0_287) (= v_~x$r_buff1_thd1~0_136 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_139 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_457 256) 0)) .cse1)) 0 v_~x$r_buff0_thd1~0_140)) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45| 0)) (= v_~x$r_buff0_thd1~0_139 (ite .cse2 0 v_~x$r_buff0_thd1~0_140)) (= v_~y~0_62 1) (= v_~x$r_buff0_thd2~0_164 1) (= (ite .cse1 v_~x$w_buff0~0_324 (ite .cse3 v_~x$w_buff1~0_287 1)) v_~x~0_410) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_31| |v_P1Thread1of1ForFork2_~arg#1.offset_31|) (= 2 v_~x$w_buff0~0_324) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45|) (= v_~x$r_buff0_thd3~0_107 v_~x$r_buff1_thd3~0_109) (= v_~x$r_buff0_thd0~0_277 v_~x$r_buff1_thd0~0_271) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_502) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_31| |v_P1Thread1of1ForFork2_~arg#1.base_31|) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45|) (= v_~x$w_buff1_used~0_457 (ite (or .cse2 .cse3) 0 v_~x$w_buff0_used~0_504)) (= v_~y~0_62 v_~__unbuffered_p1_EAX~0_98) (= v_~x$r_buff0_thd2~0_165 v_~x$r_buff1_thd2~0_121)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_325, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_277, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_140, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_504, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_324, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_277, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_139, ~x$w_buff1~0=v_~x$w_buff1~0_287, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_457, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_109, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_121, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_136, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_164, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_271, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_502, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_45|, ~y~0=v_~y~0_62, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_31|, ~x~0=v_~x~0_410, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_31|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~x$r_buff0_thd1~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y~0, P1Thread1of1ForFork2_~arg#1.offset, ~x~0] and [347] L785-->L788: Formula: (= v_~__unbuffered_p1_EBX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0] [2022-12-06 06:19:00,084 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:19:00,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35770 [2022-12-06 06:19:00,085 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 315 flow [2022-12-06 06:19:00,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:00,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:00,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:00,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:19:00,085 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:00,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1561586883, now seen corresponding path program 1 times [2022-12-06 06:19:00,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:00,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624436346] [2022-12-06 06:19:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:00,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624436346] [2022-12-06 06:19:00,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624436346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:00,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:00,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:19:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17201418] [2022-12-06 06:19:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:00,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:19:00,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:19:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:19:00,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 06:19:00,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:00,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:00,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 06:19:00,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:00,309 INFO L130 PetriNetUnfolder]: 205/394 cut-off events. [2022-12-06 06:19:00,309 INFO L131 PetriNetUnfolder]: For 1641/1641 co-relation queries the response was YES. [2022-12-06 06:19:00,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 394 events. 205/394 cut-off events. For 1641/1641 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1737 event pairs, 17 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1857. Up to 214 conditions per place. [2022-12-06 06:19:00,311 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 33 selfloop transitions, 1 changer transitions 34/70 dead transitions. [2022-12-06 06:19:00,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 709 flow [2022-12-06 06:19:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:19:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:19:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-06 06:19:00,313 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-12-06 06:19:00,313 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 315 flow. Second operand 4 states and 49 transitions. [2022-12-06 06:19:00,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 709 flow [2022-12-06 06:19:00,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 535 flow, removed 58 selfloop flow, removed 9 redundant places. [2022-12-06 06:19:00,317 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 162 flow [2022-12-06 06:19:00,317 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2022-12-06 06:19:00,317 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2022-12-06 06:19:00,317 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:00,317 INFO L89 Accepts]: Start accepts. Operand has 49 places, 29 transitions, 162 flow [2022-12-06 06:19:00,318 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:00,318 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:00,318 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 29 transitions, 162 flow [2022-12-06 06:19:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 29 transitions, 162 flow [2022-12-06 06:19:00,325 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2022-12-06 06:19:00,325 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-12-06 06:19:00,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 66 events. 19/66 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 186 event pairs, 1 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 185. Up to 20 conditions per place. [2022-12-06 06:19:00,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 29 transitions, 162 flow [2022-12-06 06:19:00,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 112 [2022-12-06 06:19:00,456 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] $Ultimate##0-->L788: Formula: (and (= v_~x$w_buff0_used~0_531 v_~x$w_buff1_used~0_483) (= v_~y~0_66 1) (= v_~x$r_buff0_thd2~0_173 v_~x$r_buff1_thd2~0_125) (= v_~x$r_buff0_thd3~0_115 v_~x$r_buff1_thd3~0_117) (= v_~__unbuffered_p1_EBX~0_99 v_~z~0_72) (= v_~x$w_buff0_used~0_530 1) (= v_~x$w_buff0~0_341 v_~x$w_buff1~0_301) (= |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49| |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|) (= v_~x$r_buff0_thd0~0_295 v_~x$r_buff1_thd0~0_291) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_483 256) 0)) (not (= (mod v_~x$w_buff0_used~0_530 256) 0)))) 1 0) |v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|) (= |v_P1Thread1of1ForFork2_#in~arg#1.base_35| |v_P1Thread1of1ForFork2_~arg#1.base_35|) (= v_~x$r_buff0_thd1~0_149 v_~x$r_buff1_thd1~0_146) (not (= |v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49| 0)) (= 2 v_~x$w_buff0~0_340) (= |v_P1Thread1of1ForFork2_#in~arg#1.offset_35| |v_P1Thread1of1ForFork2_~arg#1.offset_35|) (= v_~x$r_buff0_thd2~0_172 1) (= v_~y~0_66 v_~__unbuffered_p1_EAX~0_104)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_341, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_149, ~z~0=v_~z~0_72, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_173, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_531, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, P1Thread1of1ForFork2_~arg#1.base=|v_P1Thread1of1ForFork2_~arg#1.base_35|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_99, ~x$w_buff1~0=v_~x$w_buff1~0_301, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_117, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_483, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_146, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_115, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_172, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_291, P1Thread1of1ForFork2_#in~arg#1.base=|v_P1Thread1of1ForFork2_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_530, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_~expression#1_49|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_49|, ~z~0=v_~z~0_72, ~y~0=v_~y~0_66, P1Thread1of1ForFork2_~arg#1.offset=|v_P1Thread1of1ForFork2_~arg#1.offset_35|, P1Thread1of1ForFork2_#in~arg#1.offset=|v_P1Thread1of1ForFork2_#in~arg#1.offset_35|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork2_~arg#1.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y~0, P1Thread1of1ForFork2_~arg#1.offset] and [486] $Ultimate##0-->L818: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_128 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_564 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_126 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_565 256) 0)) .cse5)) (.cse0 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_508 256) 0))))) (and (= v_~z~0_86 1) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_508) v_~x$w_buff1_used~0_507) (= v_~z~0_86 v_~__unbuffered_p2_EAX~0_106) (= v_~x$w_buff0_used~0_564 (ite .cse2 0 v_~x$w_buff0_used~0_565)) (= v_~a~0_54 v_~__unbuffered_p2_EBX~0_104) (= v_~x$r_buff1_thd3~0_127 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_125 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_507 256) 0)))) 0 v_~x$r_buff1_thd3~0_128)) (= v_~x$r_buff0_thd3~0_125 (ite .cse1 0 v_~x$r_buff0_thd3~0_126)) (= (ite .cse2 v_~x$w_buff0~0_368 (ite .cse0 v_~x$w_buff1~0_319 v_~x~0_455)) v_~x~0_454) (= |v_P2Thread1of1ForFork0_#in~arg.base_27| v_P2Thread1of1ForFork0_~arg.base_27) (= |v_P2Thread1of1ForFork0_#in~arg.offset_27| v_P2Thread1of1ForFork0_~arg.offset_27)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_368, ~a~0=v_~a~0_54, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_319, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_128, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_508, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_126, ~x~0=v_~x~0_455, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_565} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_368, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_104, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_319, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_27, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_125, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_564, ~a~0=v_~a~0_54, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ~z~0=v_~z~0_86, ~x~0=v_~x~0_454, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_27|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork0_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~z~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:19:00,682 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:19:00,683 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 366 [2022-12-06 06:19:00,683 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 172 flow [2022-12-06 06:19:00,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:00,683 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:00,683 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:00,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:19:00,683 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2078283107, now seen corresponding path program 1 times [2022-12-06 06:19:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:00,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083149179] [2022-12-06 06:19:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:19:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:19:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:19:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083149179] [2022-12-06 06:19:01,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083149179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:19:01,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:19:01,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:19:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392832745] [2022-12-06 06:19:01,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:19:01,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:19:01,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:19:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:19:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:19:01,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:19:01,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 172 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:01,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:19:01,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:19:01,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:19:01,297 INFO L130 PetriNetUnfolder]: 120/241 cut-off events. [2022-12-06 06:19:01,297 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-06 06:19:01,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 241 events. 120/241 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 967 event pairs, 4 based on Foata normal form. 1/242 useless extension candidates. Maximal degree in co-relation 910. Up to 136 conditions per place. [2022-12-06 06:19:01,299 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 29 selfloop transitions, 10 changer transitions 5/44 dead transitions. [2022-12-06 06:19:01,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 336 flow [2022-12-06 06:19:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:19:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:19:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-12-06 06:19:01,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3157894736842105 [2022-12-06 06:19:01,300 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 172 flow. Second operand 5 states and 30 transitions. [2022-12-06 06:19:01,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 336 flow [2022-12-06 06:19:01,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 302 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 06:19:01,302 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 182 flow [2022-12-06 06:19:01,302 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-06 06:19:01,302 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-06 06:19:01,302 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:19:01,302 INFO L89 Accepts]: Start accepts. Operand has 43 places, 30 transitions, 182 flow [2022-12-06 06:19:01,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:19:01,303 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:19:01,303 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 30 transitions, 182 flow [2022-12-06 06:19:01,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 182 flow [2022-12-06 06:19:01,310 INFO L130 PetriNetUnfolder]: 27/91 cut-off events. [2022-12-06 06:19:01,310 INFO L131 PetriNetUnfolder]: For 111/116 co-relation queries the response was YES. [2022-12-06 06:19:01,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 91 events. 27/91 cut-off events. For 111/116 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 368 event pairs, 1 based on Foata normal form. 3/91 useless extension candidates. Maximal degree in co-relation 275. Up to 27 conditions per place. [2022-12-06 06:19:01,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 182 flow [2022-12-06 06:19:01,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 98 [2022-12-06 06:19:01,311 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:19:01,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:19:01,312 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 182 flow [2022-12-06 06:19:01,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:19:01,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:19:01,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:01,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:19:01,312 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:19:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:19:01,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1522188075, now seen corresponding path program 1 times [2022-12-06 06:19:01,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:19:01,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535322615] [2022-12-06 06:19:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:19:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:19:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:01,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:19:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:19:01,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:19:01,401 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:19:01,401 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:19:01,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:19:01,403 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:19:01,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:19:01,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:19:01,404 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:19:01,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 06:19:01,405 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:19:01,409 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:19:01,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:19:01,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:19:01 BasicIcfg [2022-12-06 06:19:01,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:19:01,465 INFO L158 Benchmark]: Toolchain (without parser) took 53199.15ms. Allocated memory was 188.7MB in the beginning and 873.5MB in the end (delta: 684.7MB). Free memory was 164.6MB in the beginning and 660.8MB in the end (delta: -496.2MB). Peak memory consumption was 189.3MB. Max. memory is 8.0GB. [2022-12-06 06:19:01,465 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:19:01,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.66ms. Allocated memory is still 188.7MB. Free memory was 164.3MB in the beginning and 137.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:19:01,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.60ms. Allocated memory is still 188.7MB. Free memory was 137.0MB in the beginning and 134.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:19:01,465 INFO L158 Benchmark]: Boogie Preprocessor took 52.05ms. Allocated memory is still 188.7MB. Free memory was 134.4MB in the beginning and 132.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:19:01,465 INFO L158 Benchmark]: RCFGBuilder took 706.51ms. Allocated memory is still 188.7MB. Free memory was 132.3MB in the beginning and 98.2MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 06:19:01,466 INFO L158 Benchmark]: TraceAbstraction took 51857.71ms. Allocated memory was 188.7MB in the beginning and 873.5MB in the end (delta: 684.7MB). Free memory was 97.7MB in the beginning and 660.8MB in the end (delta: -563.1MB). Peak memory consumption was 122.2MB. Max. memory is 8.0GB. [2022-12-06 06:19:01,466 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.13ms. Allocated memory is still 188.7MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 521.66ms. Allocated memory is still 188.7MB. Free memory was 164.3MB in the beginning and 137.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.60ms. Allocated memory is still 188.7MB. Free memory was 137.0MB in the beginning and 134.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.05ms. Allocated memory is still 188.7MB. Free memory was 134.4MB in the beginning and 132.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 706.51ms. Allocated memory is still 188.7MB. Free memory was 132.3MB in the beginning and 98.2MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 51857.71ms. Allocated memory was 188.7MB in the beginning and 873.5MB in the end (delta: 684.7MB). Free memory was 97.7MB in the beginning and 660.8MB in the end (delta: -563.1MB). Peak memory consumption was 122.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 119 PlacesBefore, 38 PlacesAfterwards, 111 TransitionsBefore, 29 TransitionsAfterwards, 2198 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1570, independent: 1505, independent conditional: 1505, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1570, independent: 1505, independent conditional: 0, independent unconditional: 1505, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1570, independent: 1505, independent conditional: 0, independent unconditional: 1505, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1570, independent: 1505, independent conditional: 0, independent unconditional: 1505, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1306, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1306, independent: 1250, independent conditional: 0, independent unconditional: 1250, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 206, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1570, independent: 246, independent conditional: 0, independent unconditional: 246, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 1306, unknown conditional: 0, unknown unconditional: 1306] , Statistics on independence cache: Total cache size (in pairs): 1925, Positive cache size: 1878, Positive conditional cache size: 0, Positive unconditional cache size: 1878, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 9, independent unconditional: 115, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 150, independent: 124, independent conditional: 9, independent unconditional: 115, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 124, independent conditional: 9, independent unconditional: 115, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, independent: 106, independent conditional: 8, independent unconditional: 98, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 63, dependent conditional: 11, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 126, unknown conditional: 10, unknown unconditional: 116] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 106, Positive conditional cache size: 8, Positive unconditional cache size: 98, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 241, independent conditional: 241, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 241, independent conditional: 16, independent unconditional: 225, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 286, independent: 210, independent conditional: 0, independent unconditional: 210, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 145, Positive conditional cache size: 8, Positive unconditional cache size: 137, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 163, independent conditional: 163, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 163, independent conditional: 16, independent unconditional: 147, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 202, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 202, independent: 163, independent conditional: 0, independent unconditional: 163, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 202, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 165, Positive conditional cache size: 8, Positive unconditional cache size: 157, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 97, independent conditional: 97, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 97, independent conditional: 18, independent unconditional: 79, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 97, independent conditional: 9, independent unconditional: 88, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 97, independent conditional: 9, independent unconditional: 88, dependent: 19, dependent conditional: 2, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 97, independent conditional: 9, independent unconditional: 88, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 165, Positive conditional cache size: 8, Positive unconditional cache size: 157, Negative cache size: 35, Negative conditional cache size: 4, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 41 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 399, independent: 351, independent conditional: 351, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 399, independent: 351, independent conditional: 121, independent unconditional: 230, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 399, independent: 351, independent conditional: 83, independent unconditional: 268, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 399, independent: 351, independent conditional: 83, independent unconditional: 268, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 399, independent: 345, independent conditional: 81, independent unconditional: 264, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 214, Positive conditional cache size: 10, Positive unconditional cache size: 204, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 175, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 175, independent: 150, independent conditional: 41, independent unconditional: 109, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 175, independent: 150, independent conditional: 38, independent unconditional: 112, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 175, independent: 150, independent conditional: 38, independent unconditional: 112, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, independent: 150, independent conditional: 38, independent unconditional: 112, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 214, Positive conditional cache size: 10, Positive unconditional cache size: 204, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 275, independent: 242, independent conditional: 242, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 275, independent: 242, independent conditional: 94, independent unconditional: 148, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 275, independent: 242, independent conditional: 91, independent unconditional: 151, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 275, independent: 242, independent conditional: 91, independent unconditional: 151, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 275, independent: 239, independent conditional: 90, independent unconditional: 149, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 217, Positive conditional cache size: 11, Positive unconditional cache size: 206, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 242, independent conditional: 242, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 276, independent: 242, independent conditional: 83, independent unconditional: 159, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 242, independent conditional: 81, independent unconditional: 161, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 242, independent conditional: 81, independent unconditional: 161, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, independent: 239, independent conditional: 80, independent unconditional: 159, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 257, Positive cache size: 220, Positive conditional cache size: 12, Positive unconditional cache size: 208, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, independent: 355, independent conditional: 355, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398, independent: 355, independent conditional: 150, independent unconditional: 205, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 398, independent: 355, independent conditional: 145, independent unconditional: 210, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 398, independent: 355, independent conditional: 145, independent unconditional: 210, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 398, independent: 354, independent conditional: 144, independent unconditional: 210, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 221, Positive conditional cache size: 13, Positive unconditional cache size: 208, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 53 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 838, independent: 717, independent conditional: 717, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 838, independent: 717, independent conditional: 205, independent unconditional: 512, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 838, independent: 717, independent conditional: 161, independent unconditional: 556, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 838, independent: 717, independent conditional: 161, independent unconditional: 556, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 838, independent: 715, independent conditional: 160, independent unconditional: 555, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 239, Positive conditional cache size: 14, Positive unconditional cache size: 225, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 475, independent: 423, independent conditional: 423, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 475, independent: 423, independent conditional: 152, independent unconditional: 271, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 475, independent: 423, independent conditional: 133, independent unconditional: 290, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 475, independent: 423, independent conditional: 133, independent unconditional: 290, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 475, independent: 423, independent conditional: 133, independent unconditional: 290, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 239, Positive conditional cache size: 14, Positive unconditional cache size: 225, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 162, independent conditional: 162, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 162, independent conditional: 63, independent unconditional: 99, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 162, independent conditional: 54, independent unconditional: 108, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 162, independent conditional: 54, independent unconditional: 108, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 162, independent conditional: 54, independent unconditional: 108, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 239, Positive conditional cache size: 14, Positive unconditional cache size: 225, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 185, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 185, independent: 169, independent conditional: 79, independent unconditional: 90, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 185, independent: 169, independent conditional: 70, independent unconditional: 99, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 185, independent: 169, independent conditional: 70, independent unconditional: 99, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 185, independent: 167, independent conditional: 68, independent unconditional: 99, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 241, Positive conditional cache size: 16, Positive unconditional cache size: 225, Negative cache size: 37, Negative conditional cache size: 4, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.8s, 56 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 38 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 140, independent: 108, independent conditional: 43, independent unconditional: 65, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 140, independent: 108, independent conditional: 39, independent unconditional: 69, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, independent: 108, independent conditional: 39, independent unconditional: 69, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 7, independent unconditional: 2, 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: 11, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 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] ], Cache Queries: [ total: 140, independent: 99, independent conditional: 32, independent unconditional: 67, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 284, Positive conditional cache size: 23, Positive unconditional cache size: 261, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 45 PlacesBefore, 44 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 112 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 17, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 341, Positive conditional cache size: 30, Positive unconditional cache size: 311, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 98 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 341, Positive conditional cache size: 30, Positive unconditional cache size: 311, Negative cache size: 39, Negative conditional cache size: 4, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299; [L836] FCALL, FORK 0 pthread_create(&t299, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299, ((void *)0), P0, ((void *)0))=-2, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t300; [L838] FCALL, FORK 0 pthread_create(&t300, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300, ((void *)0), P1, ((void *)0))=-1, t299={5:0}, t300={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L839] 0 pthread_t t301; [L840] FCALL, FORK 0 pthread_create(&t301, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t301, ((void *)0), P2, ((void *)0))=0, t299={5:0}, t300={6:0}, t301={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L769] 2 x$w_buff1 = x$w_buff0 [L770] 2 x$w_buff0 = 2 [L771] 2 x$w_buff1_used = x$w_buff0_used [L772] 2 x$w_buff0_used = (_Bool)1 [L773] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L773] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y [L787] 2 __unbuffered_p1_EBX = z [L804] 2 z = 1 [L807] 2 __unbuffered_p2_EAX = z [L810] 2 __unbuffered_p2_EBX = a [L813] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 a = 1 [L752] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L847] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L848] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L849] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L850] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 x$flush_delayed = weak$$choice2 [L856] 0 x$mem_tmp = x [L857] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L858] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L859] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L860] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L861] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L863] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 0 x = x$flush_delayed ? x$mem_tmp : x [L866] 0 x$flush_delayed = (_Bool)0 [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 840]: 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, 144 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: 51.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1233 IncrementalHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 19 mSDtfsCounter, 1233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=11, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1840 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:19:01,510 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...