/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:20:34,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:20:34,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:20:34,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:20:34,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:20:34,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:20:34,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:20:34,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:20:34,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:20:34,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:20:34,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:20:34,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:20:34,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:20:34,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:20:34,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:20:34,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:20:34,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:20:34,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:20:34,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:20:34,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:20:34,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:20:34,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:20:34,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:20:34,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:20:34,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:20:34,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:20:34,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:20:34,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:20:34,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:20:34,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:20:34,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:20:34,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:20:34,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:20:34,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:20:34,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:20:34,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:20:34,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:20:34,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:20:34,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:20:34,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:20:34,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:20:34,616 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-RepeatedSemanticLbe.epf [2022-12-05 23:20:34,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:20:34,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:20:34,648 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:20:34,648 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:20:34,648 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:20:34,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:20:34,649 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:20:34,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:20:34,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:20:34,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:20:34,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:20:34,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:20:34,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:20:34,651 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:20:34,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:20:34,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:20:34,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:20:34,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:20:34,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:20:34,652 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:20:34,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:20:34,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:34,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:20:34,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:20:34,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:20:34,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:20:34,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:20:34,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:20:34,653 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-05 23:20:34,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:20:35,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:20:35,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:20:35,015 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:20:35,015 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:20:35,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:20:36,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:20:36,326 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:20:36,326 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:20:36,339 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6accedd1/bc561990a6f74ab78424cc1c209b1d02/FLAG6b4a41d56 [2022-12-05 23:20:36,352 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6accedd1/bc561990a6f74ab78424cc1c209b1d02 [2022-12-05 23:20:36,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:20:36,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:20:36,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:36,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:20:36,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:20:36,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f11e070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36, skipping insertion in model container [2022-12-05 23:20:36,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:20:36,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:20:36,515 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 23:20:36,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:36,732 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:20:36,744 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/safe031_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-05 23:20:36,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:20:36,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:20:36,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:20:36,837 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:20:36,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36 WrapperNode [2022-12-05 23:20:36,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:20:36,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:36,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:20:36,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:20:36,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,916 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 23:20:36,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:20:36,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:20:36,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:20:36,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:20:36,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,966 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:20:36,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:20:36,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:20:36,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:20:36,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (1/1) ... [2022-12-05 23:20:36,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:20:36,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:20:37,013 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-05 23:20:37,023 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-05 23:20:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:20:37,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:20:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:20:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:20:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:20:37,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:20:37,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:20:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:20:37,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:20:37,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:20:37,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:20:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:20:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:20:37,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:20:37,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:20:37,061 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:20:37,242 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:20:37,247 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:20:37,544 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:20:37,686 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:20:37,686 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:20:37,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:37 BoogieIcfgContainer [2022-12-05 23:20:37,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:20:37,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:20:37,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:20:37,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:20:37,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:20:36" (1/3) ... [2022-12-05 23:20:37,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11585eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:37, skipping insertion in model container [2022-12-05 23:20:37,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:20:36" (2/3) ... [2022-12-05 23:20:37,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11585eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:20:37, skipping insertion in model container [2022-12-05 23:20:37,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:20:37" (3/3) ... [2022-12-05 23:20:37,695 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i [2022-12-05 23:20:37,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:20:37,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:20:37,711 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:20:37,763 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:20:37,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:20:37,862 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:20:37,862 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:37,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:20:37,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2022-12-05 23:20:37,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:37,874 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:37,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:37,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:37,951 INFO L130 PetriNetUnfolder]: 2/103 cut-off events. [2022-12-05 23:20:37,951 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:37,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-05 23:20:37,955 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2022-12-05 23:20:37,955 INFO L188 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-05 23:20:43,861 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 23:20:43,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:20:43,880 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;@4b73dce7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:20:43,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:20:43,884 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 23:20:43,884 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:43,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:43,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:43,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -129563323, now seen corresponding path program 1 times [2022-12-05 23:20:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:43,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243653784] [2022-12-05 23:20:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:44,312 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-05 23:20:44,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243653784] [2022-12-05 23:20:44,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243653784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:44,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:44,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316597662] [2022-12-05 23:20:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:44,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:44,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:44,341 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:20:44,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-05 23:20:44,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:44,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:20:44,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:44,569 INFO L130 PetriNetUnfolder]: 615/1011 cut-off events. [2022-12-05 23:20:44,570 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 23:20:44,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 1011 events. 615/1011 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4958 event pairs, 129 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1971. Up to 703 conditions per place. [2022-12-05 23:20:44,578 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-05 23:20:44,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 131 flow [2022-12-05 23:20:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 23:20:44,588 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2022-12-05 23:20:44,589 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 43 transitions. [2022-12-05 23:20:44,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 131 flow [2022-12-05 23:20:44,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:44,593 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-05 23:20:44,595 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-05 23:20:44,598 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-05 23:20:44,598 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:44,599 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-05 23:20:44,601 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:44,601 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:44,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-05 23:20:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-05 23:20:44,607 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-05 23:20:44,607 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:44,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:20:44,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-05 23:20:44,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-05 23:20:44,719 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:44,721 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-05 23:20:44,721 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-05 23:20:44,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-05 23:20:44,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:44,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:44,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:20:44,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash 43753441, now seen corresponding path program 1 times [2022-12-05 23:20:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:44,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661443410] [2022-12-05 23:20:44,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:44,972 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-05 23:20:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:44,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661443410] [2022-12-05 23:20:44,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661443410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:44,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:44,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887550029] [2022-12-05 23:20:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:44,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:44,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:44,976 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:20:44,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:44,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:44,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:20:44,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:45,125 INFO L130 PetriNetUnfolder]: 489/787 cut-off events. [2022-12-05 23:20:45,125 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-05 23:20:45,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 787 events. 489/787 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3519 event pairs, 117 based on Foata normal form. 8/794 useless extension candidates. Maximal degree in co-relation 1609. Up to 689 conditions per place. [2022-12-05 23:20:45,130 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 27 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-05 23:20:45,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 140 flow [2022-12-05 23:20:45,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:45,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-05 23:20:45,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-05 23:20:45,132 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 37 transitions. [2022-12-05 23:20:45,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 140 flow [2022-12-05 23:20:45,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:45,133 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 65 flow [2022-12-05 23:20:45,133 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-05 23:20:45,134 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-05 23:20:45,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:45,134 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 65 flow [2022-12-05 23:20:45,135 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:45,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:45,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-05 23:20:45,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 65 flow [2022-12-05 23:20:45,140 INFO L130 PetriNetUnfolder]: 3/30 cut-off events. [2022-12-05 23:20:45,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:20:45,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 43. Up to 10 conditions per place. [2022-12-05 23:20:45,141 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 65 flow [2022-12-05 23:20:45,141 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-05 23:20:45,165 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:45,166 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-05 23:20:45,167 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 65 flow [2022-12-05 23:20:45,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:45,167 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:45,167 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:45,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:20:45,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:45,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1356355945, now seen corresponding path program 1 times [2022-12-05 23:20:45,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:45,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062875771] [2022-12-05 23:20:45,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:45,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:45,437 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-05 23:20:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:45,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062875771] [2022-12-05 23:20:45,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062875771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:45,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:45,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:20:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575908129] [2022-12-05 23:20:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:45,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:20:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:20:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:20:45,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:20:45,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-05 23:20:45,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:45,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:20:45,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:45,610 INFO L130 PetriNetUnfolder]: 535/860 cut-off events. [2022-12-05 23:20:45,611 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-05 23:20:45,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1981 conditions, 860 events. 535/860 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3686 event pairs, 160 based on Foata normal form. 4/863 useless extension candidates. Maximal degree in co-relation 1970. Up to 733 conditions per place. [2022-12-05 23:20:45,617 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 25 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-05 23:20:45,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 144 flow [2022-12-05 23:20:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 23:20:45,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2022-12-05 23:20:45,619 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 65 flow. Second operand 3 states and 34 transitions. [2022-12-05 23:20:45,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 144 flow [2022-12-05 23:20:45,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:45,620 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 81 flow [2022-12-05 23:20:45,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-05 23:20:45,622 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-05 23:20:45,622 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:45,622 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 81 flow [2022-12-05 23:20:45,623 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:45,623 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:45,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 81 flow [2022-12-05 23:20:45,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 81 flow [2022-12-05 23:20:45,633 INFO L130 PetriNetUnfolder]: 10/50 cut-off events. [2022-12-05 23:20:45,633 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-05 23:20:45,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 50 events. 10/50 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 145 event pairs, 3 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 86. Up to 19 conditions per place. [2022-12-05 23:20:45,635 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 81 flow [2022-12-05 23:20:45,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-05 23:20:45,647 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:45,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-05 23:20:45,648 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 81 flow [2022-12-05 23:20:45,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-05 23:20:45,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:45,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:45,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:20:45,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:45,649 INFO L85 PathProgramCache]: Analyzing trace with hash -463684250, now seen corresponding path program 1 times [2022-12-05 23:20:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532819130] [2022-12-05 23:20:45,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:45,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:46,149 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-05 23:20:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:46,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532819130] [2022-12-05 23:20:46,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532819130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:46,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:46,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715381916] [2022-12-05 23:20:46,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:46,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:46,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:46,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:46,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:46,151 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:20:46,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 81 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-05 23:20:46,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:46,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:20:46,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:46,317 INFO L130 PetriNetUnfolder]: 509/824 cut-off events. [2022-12-05 23:20:46,317 INFO L131 PetriNetUnfolder]: For 305/305 co-relation queries the response was YES. [2022-12-05 23:20:46,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 824 events. 509/824 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3533 event pairs, 150 based on Foata normal form. 10/833 useless extension candidates. Maximal degree in co-relation 2012. Up to 644 conditions per place. [2022-12-05 23:20:46,323 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 31 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-05 23:20:46,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 193 flow [2022-12-05 23:20:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:20:46,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5375 [2022-12-05 23:20:46,325 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 81 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:20:46,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 193 flow [2022-12-05 23:20:46,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:46,326 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 103 flow [2022-12-05 23:20:46,326 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-05 23:20:46,327 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-05 23:20:46,327 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:46,327 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 103 flow [2022-12-05 23:20:46,328 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:46,328 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:46,328 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 103 flow [2022-12-05 23:20:46,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 103 flow [2022-12-05 23:20:46,336 INFO L130 PetriNetUnfolder]: 14/52 cut-off events. [2022-12-05 23:20:46,336 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-05 23:20:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 52 events. 14/52 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 151 event pairs, 4 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 114. Up to 20 conditions per place. [2022-12-05 23:20:46,337 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 103 flow [2022-12-05 23:20:46,337 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-05 23:20:46,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:46,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-05 23:20:46,374 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 103 flow [2022-12-05 23:20:46,374 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-05 23:20:46,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:46,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:46,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:20:46,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2117032307, now seen corresponding path program 1 times [2022-12-05 23:20:46,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:46,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110620309] [2022-12-05 23:20:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:46,601 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-05 23:20:46,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:46,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110620309] [2022-12-05 23:20:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110620309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:46,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:46,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:46,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505917129] [2022-12-05 23:20:46,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:46,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:46,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:46,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 23:20:46,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 103 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-05 23:20:46,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:46,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 23:20:46,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:46,776 INFO L130 PetriNetUnfolder]: 510/828 cut-off events. [2022-12-05 23:20:46,776 INFO L131 PetriNetUnfolder]: For 550/550 co-relation queries the response was YES. [2022-12-05 23:20:46,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 828 events. 510/828 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3566 event pairs, 103 based on Foata normal form. 2/829 useless extension candidates. Maximal degree in co-relation 2189. Up to 576 conditions per place. [2022-12-05 23:20:46,781 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2022-12-05 23:20:46,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 227 flow [2022-12-05 23:20:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 23:20:46,783 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-05 23:20:46,783 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 103 flow. Second operand 4 states and 44 transitions. [2022-12-05 23:20:46,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 227 flow [2022-12-05 23:20:46,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 218 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:46,786 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 126 flow [2022-12-05 23:20:46,786 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-05 23:20:46,787 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-05 23:20:46,787 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:46,787 INFO L89 Accepts]: Start accepts. Operand has 37 places, 29 transitions, 126 flow [2022-12-05 23:20:46,788 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:46,788 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:46,788 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 126 flow [2022-12-05 23:20:46,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 126 flow [2022-12-05 23:20:46,805 INFO L130 PetriNetUnfolder]: 34/102 cut-off events. [2022-12-05 23:20:46,805 INFO L131 PetriNetUnfolder]: For 104/108 co-relation queries the response was YES. [2022-12-05 23:20:46,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 102 events. 34/102 cut-off events. For 104/108 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 378 event pairs, 9 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 246. Up to 38 conditions per place. [2022-12-05 23:20:46,807 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 126 flow [2022-12-05 23:20:46,807 INFO L188 LiptonReduction]: Number of co-enabled transitions 250 [2022-12-05 23:20:46,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L759-->L762: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [406] L823-->L831: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_163 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_237 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_158 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_238 256) 0)))) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_213 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~y$r_buff0_thd0~0_157 (ite .cse0 0 v_~y$r_buff0_thd0~0_158)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_213) v_~y$w_buff1_used~0_212) (= v_~y$r_buff1_thd0~0_162 (ite (or (and .cse2 (not (= 0 (mod v_~y$r_buff0_thd0~0_157 256)))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_212 256) 0)))) 0 v_~y$r_buff1_thd0~0_163)) (= v_~y$w_buff0_used~0_237 (ite .cse4 0 v_~y$w_buff0_used~0_238)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= v_~y~0_178 (ite .cse4 v_~y$w_buff0~0_148 (ite .cse1 v_~y$w_buff1~0_141 v_~y~0_179)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_238, ~y$w_buff1~0=v_~y$w_buff1~0_141, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_158, ~y$w_buff0~0=v_~y$w_buff0~0_148, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ~y~0=v_~y~0_179, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_213} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_237, ~y$w_buff1~0=v_~y$w_buff1~0_141, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_157, ~y$w_buff0~0=v_~y$w_buff0~0_148, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ~y~0=v_~y~0_178, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_162, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:20:46,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] L759-->L762: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [357] $Ultimate##0-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_141) (= v_~y$r_buff0_thd1~0_11 v_~y$r_buff1_thd1~0_13) (= v_~y$w_buff0_used~0_163 1) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_39) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_141 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_91) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_80) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_39)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_81, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_76, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_80, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-05 23:20:47,182 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:47,185 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 398 [2022-12-05 23:20:47,185 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 130 flow [2022-12-05 23:20:47,186 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-05 23:20:47,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:47,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:47,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:20:47,186 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1869405910, now seen corresponding path program 1 times [2022-12-05 23:20:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:47,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450117069] [2022-12-05 23:20:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:47,517 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-05 23:20:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:47,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450117069] [2022-12-05 23:20:47,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450117069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:47,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:47,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22396474] [2022-12-05 23:20:47,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:47,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:47,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-05 23:20:47,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 23:20:47,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:47,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-05 23:20:47,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:47,731 INFO L130 PetriNetUnfolder]: 486/787 cut-off events. [2022-12-05 23:20:47,731 INFO L131 PetriNetUnfolder]: For 895/895 co-relation queries the response was YES. [2022-12-05 23:20:47,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 787 events. 486/787 cut-off events. For 895/895 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3452 event pairs, 56 based on Foata normal form. 2/788 useless extension candidates. Maximal degree in co-relation 2296. Up to 574 conditions per place. [2022-12-05 23:20:47,737 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 33 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2022-12-05 23:20:47,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 264 flow [2022-12-05 23:20:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 23:20:47,739 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4891304347826087 [2022-12-05 23:20:47,740 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 130 flow. Second operand 4 states and 45 transitions. [2022-12-05 23:20:47,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 264 flow [2022-12-05 23:20:47,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 255 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:20:47,746 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 155 flow [2022-12-05 23:20:47,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-05 23:20:47,748 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-05 23:20:47,748 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:47,748 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 155 flow [2022-12-05 23:20:47,749 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:47,749 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:47,749 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 155 flow [2022-12-05 23:20:47,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 155 flow [2022-12-05 23:20:47,762 INFO L130 PetriNetUnfolder]: 33/98 cut-off events. [2022-12-05 23:20:47,763 INFO L131 PetriNetUnfolder]: For 171/177 co-relation queries the response was YES. [2022-12-05 23:20:47,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 98 events. 33/98 cut-off events. For 171/177 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 338 event pairs, 9 based on Foata normal form. 2/99 useless extension candidates. Maximal degree in co-relation 265. Up to 37 conditions per place. [2022-12-05 23:20:47,764 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 155 flow [2022-12-05 23:20:47,764 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-05 23:20:47,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:47,779 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 23:20:47,779 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 155 flow [2022-12-05 23:20:47,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 23:20:47,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:47,779 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:47,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:20:47,779 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:47,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2117028804, now seen corresponding path program 1 times [2022-12-05 23:20:47,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:47,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557186397] [2022-12-05 23:20:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:48,028 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-05 23:20:48,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557186397] [2022-12-05 23:20:48,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557186397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:48,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:48,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:20:48,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585090176] [2022-12-05 23:20:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:48,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:48,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:48,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-05 23:20:48,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 155 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-05 23:20:48,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:48,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-05 23:20:48,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:48,161 INFO L130 PetriNetUnfolder]: 482/779 cut-off events. [2022-12-05 23:20:48,162 INFO L131 PetriNetUnfolder]: For 1289/1289 co-relation queries the response was YES. [2022-12-05 23:20:48,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 779 events. 482/779 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3324 event pairs, 110 based on Foata normal form. 4/782 useless extension candidates. Maximal degree in co-relation 2387. Up to 574 conditions per place. [2022-12-05 23:20:48,167 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-05 23:20:48,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 237 flow [2022-12-05 23:20:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:20:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:20:48,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 23:20:48,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2022-12-05 23:20:48,169 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 155 flow. Second operand 3 states and 35 transitions. [2022-12-05 23:20:48,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 237 flow [2022-12-05 23:20:48,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 225 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:48,171 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 160 flow [2022-12-05 23:20:48,171 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-05 23:20:48,172 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-05 23:20:48,172 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:48,172 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 160 flow [2022-12-05 23:20:48,173 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:48,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:48,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 160 flow [2022-12-05 23:20:48,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 160 flow [2022-12-05 23:20:48,186 INFO L130 PetriNetUnfolder]: 32/96 cut-off events. [2022-12-05 23:20:48,187 INFO L131 PetriNetUnfolder]: For 223/229 co-relation queries the response was YES. [2022-12-05 23:20:48,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 96 events. 32/96 cut-off events. For 223/229 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 332 event pairs, 8 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 272. Up to 36 conditions per place. [2022-12-05 23:20:48,188 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 160 flow [2022-12-05 23:20:48,188 INFO L188 LiptonReduction]: Number of co-enabled transitions 248 [2022-12-05 23:20:48,195 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:48,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-05 23:20:48,198 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 160 flow [2022-12-05 23:20:48,198 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-05 23:20:48,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:48,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:48,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:20:48,198 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:48,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2117028835, now seen corresponding path program 1 times [2022-12-05 23:20:48,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:48,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793101194] [2022-12-05 23:20:48,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:48,585 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-05 23:20:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:48,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793101194] [2022-12-05 23:20:48,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793101194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:48,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:48,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289220210] [2022-12-05 23:20:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:48,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:48,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:48,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:48,587 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-05 23:20:48,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 160 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-05 23:20:48,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:48,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-05 23:20:48,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:48,745 INFO L130 PetriNetUnfolder]: 518/833 cut-off events. [2022-12-05 23:20:48,745 INFO L131 PetriNetUnfolder]: For 1588/1588 co-relation queries the response was YES. [2022-12-05 23:20:48,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 833 events. 518/833 cut-off events. For 1588/1588 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3618 event pairs, 107 based on Foata normal form. 5/835 useless extension candidates. Maximal degree in co-relation 2631. Up to 604 conditions per place. [2022-12-05 23:20:48,751 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 32 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-12-05 23:20:48,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 282 flow [2022-12-05 23:20:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:20:48,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-05 23:20:48,753 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 160 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:20:48,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 282 flow [2022-12-05 23:20:48,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:48,755 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 192 flow [2022-12-05 23:20:48,756 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-05 23:20:48,756 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-05 23:20:48,756 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:48,756 INFO L89 Accepts]: Start accepts. Operand has 42 places, 33 transitions, 192 flow [2022-12-05 23:20:48,757 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:48,757 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:48,757 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 33 transitions, 192 flow [2022-12-05 23:20:48,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 192 flow [2022-12-05 23:20:48,774 INFO L130 PetriNetUnfolder]: 49/116 cut-off events. [2022-12-05 23:20:48,774 INFO L131 PetriNetUnfolder]: For 386/407 co-relation queries the response was YES. [2022-12-05 23:20:48,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 116 events. 49/116 cut-off events. For 386/407 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 415 event pairs, 9 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 392. Up to 54 conditions per place. [2022-12-05 23:20:48,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 192 flow [2022-12-05 23:20:48,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-05 23:20:48,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [430] L759-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_532 256) 0)) (not (= (mod v_~y$w_buff1_used~0_494 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|) (= v_~y$w_buff0_used~0_533 v_~y$w_buff1_used~0_494) (= v_~y$r_buff0_thd3~0_156 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38| 0)) (= v_~y$r_buff0_thd3~0_157 v_~y$r_buff1_thd3~0_116) (= v_~y$w_buff1~0_341 v_~y$w_buff0~0_363) (= v_~y$r_buff0_thd0~0_374 v_~y$r_buff1_thd0~0_384) (= v_~y$r_buff0_thd2~0_118 v_~y$r_buff1_thd2~0_126) (= |v_P2Thread1of1ForFork1_~arg#1.base_34| |v_P2Thread1of1ForFork1_#in~arg#1.base_34|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_34| |v_P2Thread1of1ForFork1_~arg#1.offset_34|) (= v_~y$w_buff0_used~0_532 1) (= v_~y$r_buff0_thd1~0_42 v_~y$r_buff1_thd1~0_50) (= 2 v_~y$w_buff0~0_362) (= v_~y~0_461 1)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_34|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_157, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, ~y$w_buff0~0=v_~y$w_buff0~0_363, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_42, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_34|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_532, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_34|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_126, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_116, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_34|, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_156, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_374, ~y$w_buff0~0=v_~y$w_buff0~0_362, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_34|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_42, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_38|, ~y~0=v_~y~0_461, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_384, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_494} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [319] L762-->L769: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~y~0_51 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse1 v_~y$w_buff1~0_37 v_~y~0_52))) (= v_~y$w_buff1_used~0_82 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_97 (ite .cse0 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_82 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_23 (ite .cse2 0 v_~y$r_buff0_thd2~0_24))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:20:48,989 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:48,990 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-05 23:20:48,990 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 198 flow [2022-12-05 23:20:48,990 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-05 23:20:48,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:48,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:48,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:20:48,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:48,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2117006515, now seen corresponding path program 2 times [2022-12-05 23:20:48,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:48,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499112104] [2022-12-05 23:20:48,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:20:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:49,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499112104] [2022-12-05 23:20:49,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499112104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:49,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:49,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913296044] [2022-12-05 23:20:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:49,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:49,320 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 23:20:49,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 198 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-05 23:20:49,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:49,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 23:20:49,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:49,497 INFO L130 PetriNetUnfolder]: 534/855 cut-off events. [2022-12-05 23:20:49,498 INFO L131 PetriNetUnfolder]: For 2208/2208 co-relation queries the response was YES. [2022-12-05 23:20:49,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 855 events. 534/855 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3813 event pairs, 136 based on Foata normal form. 5/848 useless extension candidates. Maximal degree in co-relation 2970. Up to 622 conditions per place. [2022-12-05 23:20:49,504 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 33 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2022-12-05 23:20:49,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 326 flow [2022-12-05 23:20:49,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 23:20:49,506 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:20:49,506 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 198 flow. Second operand 4 states and 44 transitions. [2022-12-05 23:20:49,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 326 flow [2022-12-05 23:20:49,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 309 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:49,510 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 223 flow [2022-12-05 23:20:49,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-05 23:20:49,511 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-05 23:20:49,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:49,511 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 223 flow [2022-12-05 23:20:49,512 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:49,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:49,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 223 flow [2022-12-05 23:20:49,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 223 flow [2022-12-05 23:20:49,530 INFO L130 PetriNetUnfolder]: 54/125 cut-off events. [2022-12-05 23:20:49,530 INFO L131 PetriNetUnfolder]: For 548/570 co-relation queries the response was YES. [2022-12-05 23:20:49,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 125 events. 54/125 cut-off events. For 548/570 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 486 event pairs, 10 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 469. Up to 59 conditions per place. [2022-12-05 23:20:49,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 223 flow [2022-12-05 23:20:49,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-05 23:20:49,541 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:49,542 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-05 23:20:49,542 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 223 flow [2022-12-05 23:20:49,542 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-05 23:20:49,542 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:49,542 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:49,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:20:49,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2117028773, now seen corresponding path program 1 times [2022-12-05 23:20:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:49,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265323946] [2022-12-05 23:20:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:49,917 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-05 23:20:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:49,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265323946] [2022-12-05 23:20:49,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265323946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:49,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:49,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419764368] [2022-12-05 23:20:49,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:49,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:49,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-05 23:20:49,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 223 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-05 23:20:49,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:49,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-05 23:20:49,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:50,098 INFO L130 PetriNetUnfolder]: 575/932 cut-off events. [2022-12-05 23:20:50,098 INFO L131 PetriNetUnfolder]: For 3210/3210 co-relation queries the response was YES. [2022-12-05 23:20:50,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3407 conditions, 932 events. 575/932 cut-off events. For 3210/3210 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4346 event pairs, 101 based on Foata normal form. 10/937 useless extension candidates. Maximal degree in co-relation 3386. Up to 645 conditions per place. [2022-12-05 23:20:50,106 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 35 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-12-05 23:20:50,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 359 flow [2022-12-05 23:20:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 23:20:50,108 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:20:50,109 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 223 flow. Second operand 4 states and 44 transitions. [2022-12-05 23:20:50,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 359 flow [2022-12-05 23:20:50,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 339 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:50,114 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 249 flow [2022-12-05 23:20:50,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-05 23:20:50,115 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-05 23:20:50,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:50,115 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 249 flow [2022-12-05 23:20:50,117 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:50,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:50,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 249 flow [2022-12-05 23:20:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 249 flow [2022-12-05 23:20:50,136 INFO L130 PetriNetUnfolder]: 57/133 cut-off events. [2022-12-05 23:20:50,136 INFO L131 PetriNetUnfolder]: For 691/725 co-relation queries the response was YES. [2022-12-05 23:20:50,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557 conditions, 133 events. 57/133 cut-off events. For 691/725 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 526 event pairs, 7 based on Foata normal form. 2/124 useless extension candidates. Maximal degree in co-relation 538. Up to 63 conditions per place. [2022-12-05 23:20:50,138 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 249 flow [2022-12-05 23:20:50,138 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-05 23:20:50,148 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:50,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-05 23:20:50,149 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 249 flow [2022-12-05 23:20:50,149 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-05 23:20:50,149 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:50,149 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:20:50,149 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2117004593, now seen corresponding path program 2 times [2022-12-05 23:20:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:50,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378081032] [2022-12-05 23:20:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:50,844 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-05 23:20:50,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:50,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378081032] [2022-12-05 23:20:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378081032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:50,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368593638] [2022-12-05 23:20:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:50,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:50,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:50,846 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:20:50,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 249 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:50,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:50,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:20:50,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:51,099 INFO L130 PetriNetUnfolder]: 939/1422 cut-off events. [2022-12-05 23:20:51,099 INFO L131 PetriNetUnfolder]: For 4783/4783 co-relation queries the response was YES. [2022-12-05 23:20:51,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 1422 events. 939/1422 cut-off events. For 4783/4783 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5947 event pairs, 118 based on Foata normal form. 21/1443 useless extension candidates. Maximal degree in co-relation 5179. Up to 774 conditions per place. [2022-12-05 23:20:51,109 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 48 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2022-12-05 23:20:51,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 475 flow [2022-12-05 23:20:51,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-05 23:20:51,111 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-05 23:20:51,111 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 249 flow. Second operand 5 states and 52 transitions. [2022-12-05 23:20:51,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 475 flow [2022-12-05 23:20:51,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 457 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:51,118 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 298 flow [2022-12-05 23:20:51,118 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=298, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2022-12-05 23:20:51,119 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-12-05 23:20:51,119 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:51,119 INFO L89 Accepts]: Start accepts. Operand has 49 places, 39 transitions, 298 flow [2022-12-05 23:20:51,121 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:51,121 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:51,121 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 298 flow [2022-12-05 23:20:51,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 298 flow [2022-12-05 23:20:51,138 INFO L130 PetriNetUnfolder]: 49/124 cut-off events. [2022-12-05 23:20:51,139 INFO L131 PetriNetUnfolder]: For 671/690 co-relation queries the response was YES. [2022-12-05 23:20:51,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 124 events. 49/124 cut-off events. For 671/690 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 498 event pairs, 6 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 525. Up to 54 conditions per place. [2022-12-05 23:20:51,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 298 flow [2022-12-05 23:20:51,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 23:20:51,149 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:51,149 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 23:20:51,149 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 298 flow [2022-12-05 23:20:51,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:51,151 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:51,151 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:51,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:20:51,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2083010853, now seen corresponding path program 1 times [2022-12-05 23:20:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:51,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662195116] [2022-12-05 23:20:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:51,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:51,589 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-05 23:20:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662195116] [2022-12-05 23:20:51,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662195116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:51,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:51,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434617525] [2022-12-05 23:20:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:51,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:51,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:51,591 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 23:20:51,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 298 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:51,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:51,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 23:20:51,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:51,867 INFO L130 PetriNetUnfolder]: 1226/1886 cut-off events. [2022-12-05 23:20:51,867 INFO L131 PetriNetUnfolder]: For 8058/8058 co-relation queries the response was YES. [2022-12-05 23:20:51,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7037 conditions, 1886 events. 1226/1886 cut-off events. For 8058/8058 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8970 event pairs, 250 based on Foata normal form. 48/1934 useless extension candidates. Maximal degree in co-relation 7014. Up to 1136 conditions per place. [2022-12-05 23:20:51,879 INFO L137 encePairwiseOnDemand]: 14/24 looper letters, 61 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2022-12-05 23:20:51,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 72 transitions, 678 flow [2022-12-05 23:20:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 23:20:51,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-12-05 23:20:51,881 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 298 flow. Second operand 4 states and 49 transitions. [2022-12-05 23:20:51,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 72 transitions, 678 flow [2022-12-05 23:20:51,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 633 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:51,889 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 396 flow [2022-12-05 23:20:51,889 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2022-12-05 23:20:51,891 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-05 23:20:51,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:51,891 INFO L89 Accepts]: Start accepts. Operand has 51 places, 46 transitions, 396 flow [2022-12-05 23:20:51,892 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:51,892 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:51,892 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 46 transitions, 396 flow [2022-12-05 23:20:51,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 46 transitions, 396 flow [2022-12-05 23:20:51,912 INFO L130 PetriNetUnfolder]: 52/168 cut-off events. [2022-12-05 23:20:51,912 INFO L131 PetriNetUnfolder]: For 823/868 co-relation queries the response was YES. [2022-12-05 23:20:51,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 168 events. 52/168 cut-off events. For 823/868 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 874 event pairs, 4 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 671. Up to 61 conditions per place. [2022-12-05 23:20:51,914 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 46 transitions, 396 flow [2022-12-05 23:20:51,914 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-05 23:20:51,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L788-->L791: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0] and [354] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_28 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_28, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] [2022-12-05 23:20:51,939 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:51,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-05 23:20:51,940 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 399 flow [2022-12-05 23:20:51,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:51,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:51,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:51,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:20:51,941 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:51,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1840070791, now seen corresponding path program 1 times [2022-12-05 23:20:51,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:51,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257937255] [2022-12-05 23:20:51,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:51,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:52,709 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-05 23:20:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:52,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257937255] [2022-12-05 23:20:52,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257937255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:52,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:52,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765518316] [2022-12-05 23:20:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:52,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:20:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:20:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:20:52,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 23:20:52,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 399 flow. Second operand has 6 states, 5 states have (on average 2.6) 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-05 23:20:52,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:52,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 23:20:52,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:53,126 INFO L130 PetriNetUnfolder]: 1324/2043 cut-off events. [2022-12-05 23:20:53,126 INFO L131 PetriNetUnfolder]: For 8136/8136 co-relation queries the response was YES. [2022-12-05 23:20:53,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 2043 events. 1324/2043 cut-off events. For 8136/8136 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9742 event pairs, 193 based on Foata normal form. 12/2055 useless extension candidates. Maximal degree in co-relation 7768. Up to 1274 conditions per place. [2022-12-05 23:20:53,145 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 57 selfloop transitions, 31 changer transitions 5/93 dead transitions. [2022-12-05 23:20:53,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 93 transitions, 863 flow [2022-12-05 23:20:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 23:20:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 23:20:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-12-05 23:20:53,147 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-05 23:20:53,147 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 399 flow. Second operand 7 states and 75 transitions. [2022-12-05 23:20:53,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 93 transitions, 863 flow [2022-12-05 23:20:53,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 815 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-05 23:20:53,156 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 591 flow [2022-12-05 23:20:53,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-12-05 23:20:53,157 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-05 23:20:53,158 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:53,158 INFO L89 Accepts]: Start accepts. Operand has 58 places, 57 transitions, 591 flow [2022-12-05 23:20:53,159 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:53,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:53,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 57 transitions, 591 flow [2022-12-05 23:20:53,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 591 flow [2022-12-05 23:20:53,201 INFO L130 PetriNetUnfolder]: 100/278 cut-off events. [2022-12-05 23:20:53,201 INFO L131 PetriNetUnfolder]: For 1621/1653 co-relation queries the response was YES. [2022-12-05 23:20:53,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 278 events. 100/278 cut-off events. For 1621/1653 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1583 event pairs, 21 based on Foata normal form. 7/267 useless extension candidates. Maximal degree in co-relation 1254. Up to 115 conditions per place. [2022-12-05 23:20:53,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 57 transitions, 591 flow [2022-12-05 23:20:53,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-05 23:20:53,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [319] L762-->L769: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_24 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_83 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5))) (and (= v_~y~0_51 (ite .cse0 v_~y$w_buff0~0_32 (ite .cse1 v_~y$w_buff1~0_37 v_~y~0_52))) (= v_~y$w_buff1_used~0_82 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_83)) (= v_~y$w_buff0_used~0_97 (ite .cse0 0 v_~y$w_buff0_used~0_98)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_82 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_22) v_~y$r_buff1_thd2~0_21) (= v_~y$r_buff0_thd2~0_23 (ite .cse2 0 v_~y$r_buff0_thd2~0_24))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_24, ~y~0=v_~y~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_83} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_37, ~y$w_buff0~0=v_~y$w_buff0~0_32, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_23, ~y~0=v_~y~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_82} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [357] $Ultimate##0-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_141) (= v_~y$r_buff0_thd1~0_11 v_~y$r_buff1_thd1~0_13) (= v_~y$w_buff0_used~0_163 1) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_39) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_141 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_91) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_80) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_39)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_81, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_76, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_80, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-05 23:20:53,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L759-->L769: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_536 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd2~0_129 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_121 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_537 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_497 256) 0)) .cse1)) (.cse3 (and .cse5 .cse0))) (and (= v_~y$r_buff1_thd2~0_128 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd2~0_120 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_496 256) 0)) .cse1)) 0 v_~y$r_buff1_thd2~0_129)) (= v_~y$w_buff0_used~0_536 (ite .cse2 0 v_~y$w_buff0_used~0_537)) (= (ite .cse3 0 v_~y$r_buff0_thd2~0_121) v_~y$r_buff0_thd2~0_120) (= v_~y~0_463 (ite .cse2 v_~y$w_buff0~0_366 (ite .cse4 v_~y$w_buff1~0_343 1))) (= (ite (or .cse4 .cse3) 0 v_~y$w_buff1_used~0_497) v_~y$w_buff1_used~0_496)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_537, ~y$w_buff1~0=v_~y$w_buff1~0_343, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_121, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_128, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_536, ~y$w_buff1~0=v_~y$w_buff1~0_343, ~y$w_buff0~0=v_~y$w_buff0~0_366, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_120, ~y~0=v_~y~0_463, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_496} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [357] $Ultimate##0-->L788: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_141) (= v_~y$r_buff0_thd1~0_11 v_~y$r_buff1_thd1~0_13) (= v_~y$w_buff0_used~0_163 1) (= v_~y$r_buff0_thd3~0_58 1) (= v_~y$r_buff0_thd3~0_59 v_~y$r_buff1_thd3~0_39) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_7| |v_P2Thread1of1ForFork1_~arg#1.offset_7|) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_141 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~y$r_buff0_thd0~0_89 v_~y$r_buff1_thd0~0_91) (= |v_P2Thread1of1ForFork1_#in~arg#1.base_7| |v_P2Thread1of1ForFork1_~arg#1.base_7|) (= 2 v_~y$w_buff0~0_80) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_39)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_59, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_81, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_7|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_39, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_7|, ~y$w_buff1~0=v_~y$w_buff1~0_76, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_58, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_80, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_91, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-05 23:20:53,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:20:53,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 464 [2022-12-05 23:20:53,622 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 599 flow [2022-12-05 23:20:53,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) 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-05 23:20:53,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:53,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:53,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 23:20:53,623 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2040025850, now seen corresponding path program 1 times [2022-12-05 23:20:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:53,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254822646] [2022-12-05 23:20:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:53,746 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-05 23:20:53,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254822646] [2022-12-05 23:20:53,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254822646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:53,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:53,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:20:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421220298] [2022-12-05 23:20:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:53,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:20:53,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:53,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:20:53,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:20:53,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:20:53,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 599 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:53,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:53,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:20:53,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:53,942 INFO L130 PetriNetUnfolder]: 609/1124 cut-off events. [2022-12-05 23:20:53,943 INFO L131 PetriNetUnfolder]: For 7023/7046 co-relation queries the response was YES. [2022-12-05 23:20:53,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4660 conditions, 1124 events. 609/1124 cut-off events. For 7023/7046 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6522 event pairs, 99 based on Foata normal form. 148/1247 useless extension candidates. Maximal degree in co-relation 4632. Up to 475 conditions per place. [2022-12-05 23:20:53,950 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 77 selfloop transitions, 5 changer transitions 6/93 dead transitions. [2022-12-05 23:20:53,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 1070 flow [2022-12-05 23:20:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:20:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:20:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-05 23:20:53,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2022-12-05 23:20:53,951 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 599 flow. Second operand 4 states and 64 transitions. [2022-12-05 23:20:53,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 1070 flow [2022-12-05 23:20:53,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 990 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-12-05 23:20:53,964 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 479 flow [2022-12-05 23:20:53,965 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=479, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2022-12-05 23:20:53,965 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-12-05 23:20:53,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:53,965 INFO L89 Accepts]: Start accepts. Operand has 60 places, 52 transitions, 479 flow [2022-12-05 23:20:53,966 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:53,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:53,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 52 transitions, 479 flow [2022-12-05 23:20:53,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 52 transitions, 479 flow [2022-12-05 23:20:54,014 INFO L130 PetriNetUnfolder]: 188/458 cut-off events. [2022-12-05 23:20:54,014 INFO L131 PetriNetUnfolder]: For 2216/2348 co-relation queries the response was YES. [2022-12-05 23:20:54,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 458 events. 188/458 cut-off events. For 2216/2348 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2928 event pairs, 45 based on Foata normal form. 13/400 useless extension candidates. Maximal degree in co-relation 1913. Up to 283 conditions per place. [2022-12-05 23:20:54,019 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 52 transitions, 479 flow [2022-12-05 23:20:54,019 INFO L188 LiptonReduction]: Number of co-enabled transitions 334 [2022-12-05 23:20:54,022 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:54,023 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:20:54,023 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 479 flow [2022-12-05 23:20:54,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:54,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:54,023 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:54,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 23:20:54,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1388729314, now seen corresponding path program 1 times [2022-12-05 23:20:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:54,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221425754] [2022-12-05 23:20:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:54,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:54,172 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-05 23:20:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:54,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221425754] [2022-12-05 23:20:54,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221425754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:54,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:54,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:20:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802728500] [2022-12-05 23:20:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:54,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:20:54,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:20:54,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:20:54,174 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:20:54,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 479 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:54,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:54,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:20:54,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:54,376 INFO L130 PetriNetUnfolder]: 452/895 cut-off events. [2022-12-05 23:20:54,376 INFO L131 PetriNetUnfolder]: For 5049/5070 co-relation queries the response was YES. [2022-12-05 23:20:54,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 895 events. 452/895 cut-off events. For 5049/5070 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5253 event pairs, 76 based on Foata normal form. 91/973 useless extension candidates. Maximal degree in co-relation 3979. Up to 348 conditions per place. [2022-12-05 23:20:54,383 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 66 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2022-12-05 23:20:54,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 923 flow [2022-12-05 23:20:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:20:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:20:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-12-05 23:20:54,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.568 [2022-12-05 23:20:54,385 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 479 flow. Second operand 5 states and 71 transitions. [2022-12-05 23:20:54,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 923 flow [2022-12-05 23:20:54,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 850 flow, removed 23 selfloop flow, removed 6 redundant places. [2022-12-05 23:20:54,393 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 412 flow [2022-12-05 23:20:54,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2022-12-05 23:20:54,393 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-12-05 23:20:54,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:54,393 INFO L89 Accepts]: Start accepts. Operand has 60 places, 49 transitions, 412 flow [2022-12-05 23:20:54,395 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:54,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:54,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 49 transitions, 412 flow [2022-12-05 23:20:54,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 49 transitions, 412 flow [2022-12-05 23:20:54,431 INFO L130 PetriNetUnfolder]: 128/368 cut-off events. [2022-12-05 23:20:54,432 INFO L131 PetriNetUnfolder]: For 1521/1740 co-relation queries the response was YES. [2022-12-05 23:20:54,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1602 conditions, 368 events. 128/368 cut-off events. For 1521/1740 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2384 event pairs, 7 based on Foata normal form. 28/342 useless extension candidates. Maximal degree in co-relation 1576. Up to 235 conditions per place. [2022-12-05 23:20:54,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 412 flow [2022-12-05 23:20:54,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-05 23:20:54,440 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:20:54,440 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-05 23:20:54,440 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 412 flow [2022-12-05 23:20:54,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:54,441 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:20:54,441 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:20:54,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 23:20:54,441 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:20:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:20:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 307730985, now seen corresponding path program 1 times [2022-12-05 23:20:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:20:54,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286922609] [2022-12-05 23:20:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:20:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:20:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:20:54,598 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-05 23:20:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:20:54,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286922609] [2022-12-05 23:20:54,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286922609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:20:54,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:20:54,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:20:54,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690428298] [2022-12-05 23:20:54,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:20:54,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:20:54,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:20:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:20:54,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:20:54,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-05 23:20:54,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:20:54,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:20:54,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-05 23:20:54,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:20:54,764 INFO L130 PetriNetUnfolder]: 418/831 cut-off events. [2022-12-05 23:20:54,765 INFO L131 PetriNetUnfolder]: For 3707/3728 co-relation queries the response was YES. [2022-12-05 23:20:54,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 831 events. 418/831 cut-off events. For 3707/3728 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4867 event pairs, 73 based on Foata normal form. 35/855 useless extension candidates. Maximal degree in co-relation 3866. Up to 343 conditions per place. [2022-12-05 23:20:54,771 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 45 selfloop transitions, 11 changer transitions 17/76 dead transitions. [2022-12-05 23:20:54,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 745 flow [2022-12-05 23:20:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:20:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:20:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-05 23:20:54,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 23:20:54,773 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 412 flow. Second operand 6 states and 66 transitions. [2022-12-05 23:20:54,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 745 flow [2022-12-05 23:20:54,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 692 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-05 23:20:54,780 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 336 flow [2022-12-05 23:20:54,780 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2022-12-05 23:20:54,781 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2022-12-05 23:20:54,782 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:20:54,782 INFO L89 Accepts]: Start accepts. Operand has 63 places, 41 transitions, 336 flow [2022-12-05 23:20:54,783 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:20:54,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:20:54,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 41 transitions, 336 flow [2022-12-05 23:20:54,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 41 transitions, 336 flow [2022-12-05 23:20:54,800 INFO L130 PetriNetUnfolder]: 57/172 cut-off events. [2022-12-05 23:20:54,800 INFO L131 PetriNetUnfolder]: For 763/847 co-relation queries the response was YES. [2022-12-05 23:20:54,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 172 events. 57/172 cut-off events. For 763/847 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 886 event pairs, 1 based on Foata normal form. 7/154 useless extension candidates. Maximal degree in co-relation 718. Up to 82 conditions per place. [2022-12-05 23:20:54,802 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 41 transitions, 336 flow [2022-12-05 23:20:54,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-05 23:20:54,804 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L747-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [400] L820-3-->L823: Formula: (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0] [2022-12-05 23:20:54,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [410] L798-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P2Thread1of1ForFork1_#res#1.offset=|v_P2Thread1of1ForFork1_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P2Thread1of1ForFork1_#res#1.base=|v_P2Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res#1.base] and [400] L820-3-->L823: Formula: (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0] [2022-12-05 23:20:54,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [370] L769-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.base_11| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P1Thread1of1ForFork0_#res.offset_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_11|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] and [400] L820-3-->L823: Formula: (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_113 3) 1 0) 0) 0 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0] [2022-12-05 23:22:11,164 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [432] L759-->L769: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_574 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_576 256) 0)) (.cse3 (not (= (mod v_~y$r_buff0_thd2~0_140 256) 0)))) (let ((.cse1 (and (not .cse2) .cse3)) (.cse0 (and .cse4 .cse3))) (and (= (ite (or .cse0 .cse1) 0 v_~y$w_buff0_used~0_576) v_~y$w_buff1_used~0_527) (= v_~y$r_buff0_thd1~0_56 v_~y$r_buff1_thd1~0_64) (= v_~y$w_buff1~0_366 v_~y$w_buff0~0_394) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_52| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_48| |v_P2Thread1of1ForFork1_~arg#1.offset_48|) (= (ite .cse2 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|) (= v_~y$w_buff0_used~0_574 (ite .cse3 0 1)) (= |v_P2Thread1of1ForFork1_~arg#1.base_48| |v_P2Thread1of1ForFork1_#in~arg#1.base_48|) (= v_~y$r_buff0_thd3~0_184 1) (= v_~y~0_492 (ite .cse3 v_~y$w_buff0~0_393 (ite .cse1 v_~y$w_buff1~0_366 1))) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_52| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_527 256) 0)) .cse3) (and (not (= 0 (mod v_~y$r_buff0_thd2~0_139 256))) .cse4)) 0 v_~y$r_buff0_thd2~0_140) v_~y$r_buff1_thd2~0_147) (= v_~y$r_buff0_thd0~0_398 v_~y$r_buff1_thd0~0_410) (= (ite .cse0 0 v_~y$r_buff0_thd2~0_140) v_~y$r_buff0_thd2~0_139) (= v_~y$r_buff0_thd3~0_185 v_~y$r_buff1_thd3~0_130) (= 2 v_~y$w_buff0~0_393)))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_48|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_576, ~y$w_buff0~0=v_~y$w_buff0~0_394, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_398, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_48|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_574, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_48|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_48|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_147, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_130, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_48|, ~y$w_buff1~0=v_~y$w_buff1~0_366, ~y$w_buff0~0=v_~y$w_buff0~0_393, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_398, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_48|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_52|, ~y~0=v_~y~0_492, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_527, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_52|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [433] L788-->L742: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13) (= v_~z~0_147 2) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, ~z~0=v_~z~0_147, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] [2022-12-05 23:22:11,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L759-->L742: Formula: (and (= v_~y~0_563 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_77| 0)) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_77| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|) (= v_~y$w_buff0_used~0_672 1) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_612 256) 0)) (not (= (mod v_~y$w_buff0_used~0_672 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|) (= v_~y$r_buff0_thd3~0_234 1) (= |v_P2Thread1of1ForFork1_~arg#1.base_73| |v_P2Thread1of1ForFork1_#in~arg#1.base_73|) (= v_~y$r_buff0_thd3~0_235 v_~y$r_buff1_thd3~0_155) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_73| |v_P2Thread1of1ForFork1_~arg#1.offset_73|) (= v_~y$w_buff0_used~0_673 v_~y$w_buff1_used~0_612) (= v_~y$r_buff0_thd0~0_473 v_~y$r_buff1_thd0~0_486) (= |v_P0Thread1of1ForFork2_#in~arg.offset_19| v_P0Thread1of1ForFork2_~arg.offset_19) (= v_~z~0_169 2) (= v_~y$r_buff0_thd1~0_81 v_~y$r_buff1_thd1~0_89) (= v_P0Thread1of1ForFork2_~arg.base_19 |v_P0Thread1of1ForFork2_#in~arg.base_19|) (= v_~y$r_buff0_thd2~0_173 v_~y$r_buff1_thd2~0_184) (= v_~y$w_buff1~0_433 v_~y$w_buff0~0_475) (= 2 v_~y$w_buff0~0_474)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_73|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_673, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_235, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_473, ~y$w_buff0~0=v_~y$w_buff0~0_475, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_173, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_73|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_672, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_73|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_73|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_19|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_19, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_184, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_89, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_155, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_73|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_19|, ~y$w_buff1~0=v_~y$w_buff1~0_433, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_234, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_473, ~y$w_buff0~0=v_~y$w_buff0~0_474, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_173, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_19, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_77|, ~z~0=v_~z~0_169, ~y~0=v_~y~0_563, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_486, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_77|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_612} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [327] L791-->L798: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_35 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_90 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_105 (ite .cse2 0 v_~y$w_buff0_used~0_106)) (= (ite .cse0 0 v_~y$r_buff0_thd3~0_35) v_~y$r_buff0_thd3~0_34) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_34 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y~0_59 (ite .cse2 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_41 v_~y~0_60)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:22:11,564 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] L759-->L742: Formula: (let ((.cse2 (= (mod v_~y$w_buff0_used~0_677 256) 0)) (.cse0 (not (= (mod v_~y$r_buff0_thd2~0_176 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_676 256) 0)))) (let ((.cse4 (and .cse0 .cse3)) (.cse1 (and (not .cse2) .cse0))) (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= |v_P2Thread1of1ForFork1_~arg#1.base_75| |v_P2Thread1of1ForFork1_#in~arg#1.base_75|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_79| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_75| |v_P2Thread1of1ForFork1_~arg#1.offset_75|) (= v_~y$w_buff1~0_435 v_~y$w_buff0~0_479) (= v_~y$r_buff0_thd1~0_83 v_~y$r_buff1_thd1~0_91) (= v_~z~0_171 2) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_79| 0)) (= v_~y~0_565 (ite .cse0 v_~y$w_buff0~0_478 (ite .cse1 v_~y$w_buff1~0_435 1))) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79| (ite .cse2 1 0)) (= v_~y$r_buff0_thd3~0_238 1) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= v_~y$r_buff0_thd3~0_239 v_~y$r_buff1_thd3~0_157) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_175 256) 0)) .cse3) (and .cse0 (not (= (mod v_~y$w_buff1_used~0_614 256) 0)))) 0 v_~y$r_buff0_thd2~0_176) v_~y$r_buff1_thd2~0_186) (= 2 v_~y$w_buff0~0_478) (= v_~y$r_buff0_thd2~0_175 (ite .cse4 0 v_~y$r_buff0_thd2~0_176)) (= v_~y$w_buff0_used~0_676 (ite .cse0 0 1)) (= v_~y$r_buff0_thd0~0_475 v_~y$r_buff1_thd0~0_488) (= (ite (or .cse4 .cse1) 0 v_~y$w_buff0_used~0_677) v_~y$w_buff1_used~0_614)))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_75|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_677, ~y$w_buff0~0=v_~y$w_buff0~0_479, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_239, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_475, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_176, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_75|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_676, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_75|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_75|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_91, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_157, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_75|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, ~y$w_buff1~0=v_~y$w_buff1~0_435, ~y$w_buff0~0=v_~y$w_buff0~0_478, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_238, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_475, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_75|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_175, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_79|, ~z~0=v_~z~0_171, ~y~0=v_~y~0_565, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_488, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_79|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P0Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [327] L791-->L798: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_35 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_90 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_105 (ite .cse2 0 v_~y$w_buff0_used~0_106)) (= (ite .cse0 0 v_~y$r_buff0_thd3~0_35) v_~y$r_buff0_thd3~0_34) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_34 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y~0_59 (ite .cse2 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_41 v_~y~0_60)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:22:11,835 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [447] $Ultimate##0-->L742: Formula: (and (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_75| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_75|) (= v_~y$r_buff0_thd3~0_231 v_~y$r_buff1_thd3~0_153) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_75| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_668 256) 0)) (not (= (mod v_~y$w_buff1_used~0_610 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_471 v_~y$r_buff1_thd0~0_484) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_71| |v_P2Thread1of1ForFork1_~arg#1.offset_71|) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~y$w_buff1~0_431 v_~y$w_buff0~0_471) (= v_~z~0_167 2) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_75| 0)) (= v_~y$r_buff0_thd2~0_171 v_~y$r_buff1_thd2~0_182) (= v_~y$r_buff0_thd3~0_230 1) (= v_~y$w_buff0_used~0_669 v_~y$w_buff1_used~0_610) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= v_~y$r_buff0_thd1~0_79 v_~y$r_buff1_thd1~0_87) (= |v_P2Thread1of1ForFork1_~arg#1.base_71| |v_P2Thread1of1ForFork1_#in~arg#1.base_71|) (= v_~y$w_buff0_used~0_668 1) (= 2 v_~y$w_buff0~0_470)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_71|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_669, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_231, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_471, ~y$w_buff0~0=v_~y$w_buff0~0_471, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_71|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_668, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_71|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_71|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_182, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_87, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_153, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_71|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~y$w_buff1~0=v_~y$w_buff1~0_431, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_230, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_471, ~y$w_buff0~0=v_~y$w_buff0~0_470, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_71|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_171, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_75|, ~z~0=v_~z~0_167, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_484, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_75|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_610} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [327] L791-->L798: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_35 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_91 256) 0)) .cse3))) (and (= v_~y$w_buff1_used~0_90 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_91)) (= v_~y$w_buff0_used~0_105 (ite .cse2 0 v_~y$w_buff0_used~0_106)) (= (ite .cse0 0 v_~y$r_buff0_thd3~0_35) v_~y$r_buff0_thd3~0_34) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_34 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y~0_59 (ite .cse2 v_~y$w_buff0~0_36 (ite .cse1 v_~y$w_buff1~0_41 v_~y~0_60)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y~0=v_~y~0_60, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_91} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$w_buff0~0=v_~y$w_buff0~0_36, ~y~0=v_~y~0_59, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_90} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-05 23:22:11,994 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-05 23:22:11,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77213 [2022-12-05 23:22:11,995 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 406 flow [2022-12-05 23:22:11,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:22:11,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:11,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:22:11,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 23:22:11,996 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:22:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -152105197, now seen corresponding path program 1 times [2022-12-05 23:22:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871230135] [2022-12-05 23:22:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:12,124 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-05 23:22:12,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871230135] [2022-12-05 23:22:12,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871230135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:12,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:12,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:22:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034034968] [2022-12-05 23:22:12,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:12,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:22:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:22:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:22:12,125 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 27 [2022-12-05 23:22:12,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-05 23:22:12,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:12,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 27 [2022-12-05 23:22:12,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:22:12,234 INFO L130 PetriNetUnfolder]: 74/158 cut-off events. [2022-12-05 23:22:12,234 INFO L131 PetriNetUnfolder]: For 1089/1089 co-relation queries the response was YES. [2022-12-05 23:22:12,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 158 events. 74/158 cut-off events. For 1089/1089 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 597 event pairs, 5 based on Foata normal form. 3/159 useless extension candidates. Maximal degree in co-relation 801. Up to 84 conditions per place. [2022-12-05 23:22:12,235 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 1 changer transitions 23/53 dead transitions. [2022-12-05 23:22:12,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 53 transitions, 623 flow [2022-12-05 23:22:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:22:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:22:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-05 23:22:12,236 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39814814814814814 [2022-12-05 23:22:12,237 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 406 flow. Second operand 4 states and 43 transitions. [2022-12-05 23:22:12,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 53 transitions, 623 flow [2022-12-05 23:22:12,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 397 flow, removed 45 selfloop flow, removed 18 redundant places. [2022-12-05 23:22:12,241 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 143 flow [2022-12-05 23:22:12,241 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2022-12-05 23:22:12,241 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-05 23:22:12,241 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:22:12,241 INFO L89 Accepts]: Start accepts. Operand has 42 places, 25 transitions, 143 flow [2022-12-05 23:22:12,242 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:22:12,242 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:12,242 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 143 flow [2022-12-05 23:22:12,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 143 flow [2022-12-05 23:22:12,249 INFO L130 PetriNetUnfolder]: 12/46 cut-off events. [2022-12-05 23:22:12,249 INFO L131 PetriNetUnfolder]: For 50/52 co-relation queries the response was YES. [2022-12-05 23:22:12,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 46 events. 12/46 cut-off events. For 50/52 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 1 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 122. Up to 11 conditions per place. [2022-12-05 23:22:12,250 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 143 flow [2022-12-05 23:22:12,250 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-05 23:22:12,291 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:22:12,292 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-05 23:22:12,292 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 144 flow [2022-12-05 23:22:12,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-05 23:22:12,292 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:12,292 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:22:12,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 23:22:12,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:22:12,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:12,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1252977523, now seen corresponding path program 1 times [2022-12-05 23:22:12,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:12,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006807861] [2022-12-05 23:22:12,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:22:13,010 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-05 23:22:13,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:22:13,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006807861] [2022-12-05 23:22:13,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006807861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:22:13,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:22:13,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:22:13,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605119702] [2022-12-05 23:22:13,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:22:13,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 23:22:13,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:22:13,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 23:22:13,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-05 23:22:13,012 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 23:22:13,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 144 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-05 23:22:13,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:22:13,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 23:22:13,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:22:13,187 INFO L130 PetriNetUnfolder]: 37/95 cut-off events. [2022-12-05 23:22:13,187 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-12-05 23:22:13,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 95 events. 37/95 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 331 event pairs, 3 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 351. Up to 43 conditions per place. [2022-12-05 23:22:13,188 INFO L137 encePairwiseOnDemand]: 11/18 looper letters, 21 selfloop transitions, 4 changer transitions 9/35 dead transitions. [2022-12-05 23:22:13,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 258 flow [2022-12-05 23:22:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:22:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:22:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-12-05 23:22:13,190 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2022-12-05 23:22:13,190 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 144 flow. Second operand 6 states and 33 transitions. [2022-12-05 23:22:13,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 258 flow [2022-12-05 23:22:13,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 234 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-05 23:22:13,191 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 120 flow [2022-12-05 23:22:13,192 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-12-05 23:22:13,192 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-05 23:22:13,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:22:13,192 INFO L89 Accepts]: Start accepts. Operand has 40 places, 22 transitions, 120 flow [2022-12-05 23:22:13,193 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:22:13,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:22:13,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 22 transitions, 120 flow [2022-12-05 23:22:13,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 22 transitions, 120 flow [2022-12-05 23:22:13,199 INFO L130 PetriNetUnfolder]: 9/38 cut-off events. [2022-12-05 23:22:13,199 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-05 23:22:13,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 38 events. 9/38 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 92 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 97. Up to 10 conditions per place. [2022-12-05 23:22:13,200 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 120 flow [2022-12-05 23:22:13,200 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-05 23:22:13,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] $Ultimate##0-->L747: Formula: (and (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_83| |v_P2Thread1of1ForFork1_~arg#1.offset_83|) (= v_~y$r_buff0_thd2~0_187 v_~y$r_buff1_thd2~0_194) (= v_~x~0_41 v_~__unbuffered_p0_EAX~0_137) (= v_~y$r_buff0_thd1~0_91 v_~y$r_buff1_thd1~0_99) (= v_P0Thread1of1ForFork2_~arg.base_29 |v_P0Thread1of1ForFork2_#in~arg.base_29|) (= 2 v_~y$w_buff0~0_494) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_87| 0)) (= v_~y$r_buff0_thd3~0_261 v_~y$r_buff1_thd3~0_171) (= v_~y$w_buff0_used~0_699 v_~y$w_buff1_used~0_628) (= v_~y$r_buff0_thd3~0_260 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_29| v_P0Thread1of1ForFork2_~arg.offset_29) (= |v_P2Thread1of1ForFork1_~arg#1.base_83| |v_P2Thread1of1ForFork1_#in~arg#1.base_83|) (= v_~z~0_179 2) (= v_~y$w_buff0_used~0_698 1) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_87| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_87|) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_628 256) 0)) (not (= (mod v_~y$w_buff0_used~0_698 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_87|) (= v_~y$w_buff1~0_443 v_~y$w_buff0~0_495) (= v_~y$r_buff0_thd0~0_483 v_~y$r_buff1_thd0~0_496)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_83|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_699, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_261, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_483, ~y$w_buff0~0=v_~y$w_buff0~0_495, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_187, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_91, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_83|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, ~x~0=v_~x~0_41} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_698, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_83|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_99, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_171, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_83|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_260, ~y$w_buff0~0=v_~y$w_buff0~0_494, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_83|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_91, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_29, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_83|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_194, ~y$w_buff1~0=v_~y$w_buff1~0_443, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_483, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_187, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_87|, ~z~0=v_~z~0_179, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_496, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_87|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_628} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [454] $Ultimate##0-->L762: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_581 1) (= v_~x~0_39 1) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~y~0=v_~y~0_581, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0, ~x~0] [2022-12-05 23:22:13,487 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [456] $Ultimate##0-->L762: Formula: (and (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_85| |v_P2Thread1of1ForFork1_~arg#1.offset_85|) (= v_~x~0_44 v_~__unbuffered_p0_EAX~0_139) (= 2 v_~y$w_buff0~0_498) (= v_~y$r_buff0_thd0~0_485 v_~y$r_buff1_thd0~0_498) (= v_~y~0_583 1) (= v_~y$w_buff0_used~0_703 v_~y$w_buff1_used~0_630) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_89| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_89|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_31| v_P0Thread1of1ForFork2_~arg.offset_31) (= v_~y$w_buff0_used~0_702 1) (= v_~y$r_buff0_thd3~0_264 1) (= v_~x~0_43 1) (= v_~y$w_buff1~0_445 v_~y$w_buff0~0_499) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_89| 0)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_630 256) 0)) (not (= (mod v_~y$w_buff0_used~0_702 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_89|) (= v_~y$r_buff0_thd3~0_265 v_~y$r_buff1_thd3~0_173) (= v_~z~0_181 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~y$r_buff0_thd2~0_189 v_~y$r_buff1_thd2~0_196) (= v_~y$r_buff1_thd1~0_101 v_~y$r_buff0_thd1~0_93) (= v_P0Thread1of1ForFork2_~arg.base_31 |v_P0Thread1of1ForFork2_#in~arg.base_31|) (= |v_P2Thread1of1ForFork1_~arg#1.base_85| |v_P2Thread1of1ForFork1_#in~arg#1.base_85|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_703, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_85|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_31|, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_85|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_31|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_265, ~y$w_buff0~0=v_~y$w_buff0~0_499, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_485, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_93, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_189, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~x~0=v_~x~0_44} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_702, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_85|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_101, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_173, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_85|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_31|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_264, ~y$w_buff0~0=v_~y$w_buff0~0_498, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_85|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_93, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_31, ~y~0=v_~y~0_583, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_85|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_196, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~y$w_buff1~0=v_~y$w_buff1~0_445, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_485, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_189, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_89|, ~z~0=v_~z~0_181, ~x~0=v_~x~0_43, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_498, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_89|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_630} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg#1.offset, P0Thread1of1ForFork2_~arg.base, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P0Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~z~0, ~y~0, ~x~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [381] L747-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-05 23:22:13,665 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:22:13,666 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 474 [2022-12-05 23:22:13,666 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 129 flow [2022-12-05 23:22:13,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-05 23:22:13,666 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:22:13,666 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:22:13,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 23:22:13,667 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:22:13,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:22:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -689881934, now seen corresponding path program 1 times [2022-12-05 23:22:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:22:13,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094311996] [2022-12-05 23:22:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:22:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:22:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:22:13,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 23:22:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 23:22:13,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 23:22:13,769 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 23:22:13,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 23:22:13,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 23:22:13,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 23:22:13,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 23:22:13,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 23:22:13,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 23:22:13,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 23:22:13,772 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:22:13,777 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:22:13,778 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:22:13,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:22:13 BasicIcfg [2022-12-05 23:22:13,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:22:13,849 INFO L158 Benchmark]: Toolchain (without parser) took 97493.69ms. Allocated memory was 205.5MB in the beginning and 841.0MB in the end (delta: 635.4MB). Free memory was 180.3MB in the beginning and 340.5MB in the end (delta: -160.3MB). Peak memory consumption was 476.0MB. Max. memory is 8.0GB. [2022-12-05 23:22:13,849 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 205.5MB. Free memory was 182.1MB in the beginning and 182.1MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:22:13,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.24ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 153.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:22:13,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.30ms. Allocated memory is still 205.5MB. Free memory was 153.9MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:13,850 INFO L158 Benchmark]: Boogie Preprocessor took 52.65ms. Allocated memory is still 205.5MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:13,850 INFO L158 Benchmark]: RCFGBuilder took 717.54ms. Allocated memory is still 205.5MB. Free memory was 149.1MB in the beginning and 116.6MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-05 23:22:13,850 INFO L158 Benchmark]: TraceAbstraction took 96158.84ms. Allocated memory was 205.5MB in the beginning and 841.0MB in the end (delta: 635.4MB). Free memory was 116.1MB in the beginning and 340.5MB in the end (delta: -224.4MB). Peak memory consumption was 412.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:13,851 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.11ms. Allocated memory is still 205.5MB. Free memory was 182.1MB in the beginning and 182.1MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 481.24ms. Allocated memory is still 205.5MB. Free memory was 180.1MB in the beginning and 153.9MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.30ms. Allocated memory is still 205.5MB. Free memory was 153.9MB in the beginning and 151.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.65ms. Allocated memory is still 205.5MB. Free memory was 151.2MB in the beginning and 149.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 717.54ms. Allocated memory is still 205.5MB. Free memory was 149.1MB in the beginning and 116.6MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 96158.84ms. Allocated memory was 205.5MB in the beginning and 841.0MB in the end (delta: 635.4MB). Free memory was 116.1MB in the beginning and 340.5MB in the end (delta: -224.4MB). Peak memory consumption was 412.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 111 PlacesBefore, 34 PlacesAfterwards, 103 TransitionsBefore, 25 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 1411, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1464, independent: 1411, independent conditional: 0, independent unconditional: 1411, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1194, independent: 1153, independent conditional: 0, independent unconditional: 1153, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1194, independent: 1127, independent conditional: 0, independent unconditional: 1127, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 381, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1464, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 1194, unknown conditional: 0, unknown unconditional: 1194] , Statistics on independence cache: Total cache size (in pairs): 1929, Positive cache size: 1888, Positive conditional cache size: 0, Positive unconditional cache size: 1888, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, 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, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 54, independent conditional: 1, independent unconditional: 53, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 54, independent conditional: 1, independent unconditional: 53, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 54, independent conditional: 1, independent unconditional: 53, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, independent: 51, independent conditional: 1, independent unconditional: 50, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 108, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 102, dependent conditional: 8, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 68, unknown conditional: 2, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 51, Positive conditional cache size: 1, Positive unconditional cache size: 50, Negative cache size: 17, Negative conditional cache size: 1, Negative unconditional cache size: 16, 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, 30 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 73, independent conditional: 73, 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: 90, independent: 73, independent conditional: 9, independent unconditional: 64, 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: 90, independent: 73, independent conditional: 0, independent unconditional: 73, 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: 90, independent: 73, independent conditional: 0, independent unconditional: 73, 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: 37, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 37, unknown conditional: 0, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 83, Positive conditional cache size: 1, Positive unconditional cache size: 82, Negative cache size: 22, Negative conditional cache size: 1, Negative unconditional cache size: 21, 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, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 75, independent: 60, independent conditional: 10, independent unconditional: 50, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 84, Positive conditional cache size: 1, Positive unconditional cache size: 83, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 71, independent: 56, independent conditional: 12, independent unconditional: 44, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 73, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 17, dependent conditional: 4, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 73, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 17, dependent conditional: 4, dependent unconditional: 13, 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: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 7, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 73, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 84, Positive conditional cache size: 1, Positive unconditional cache size: 83, Negative cache size: 28, Negative conditional cache size: 5, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 37 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 96, independent conditional: 96, 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: 122, independent: 96, independent conditional: 36, independent unconditional: 60, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 122, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 122, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 108, Positive conditional cache size: 1, Positive unconditional cache size: 107, Negative cache size: 29, Negative conditional cache size: 6, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 15, independent unconditional: 30, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 45, independent conditional: 5, independent unconditional: 40, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 5, independent unconditional: 40, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 39, independent conditional: 1, independent unconditional: 38, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 114, Positive conditional cache size: 5, Positive unconditional cache size: 109, Negative cache size: 31, Negative conditional cache size: 8, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 15, independent unconditional: 30, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 61, independent: 45, independent conditional: 5, independent unconditional: 40, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 61, independent: 45, independent conditional: 5, independent unconditional: 40, dependent: 16, dependent conditional: 2, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, independent: 45, independent conditional: 5, independent unconditional: 40, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 114, Positive conditional cache size: 5, Positive unconditional cache size: 109, Negative cache size: 32, Negative conditional cache size: 9, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 104, independent conditional: 104, 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: 137, independent: 104, independent conditional: 38, independent unconditional: 66, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 139, independent: 104, independent conditional: 13, independent unconditional: 91, dependent: 35, dependent conditional: 4, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 139, independent: 104, independent conditional: 13, independent unconditional: 91, dependent: 35, dependent conditional: 4, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, independent: 103, independent conditional: 12, independent unconditional: 91, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 115, Positive conditional cache size: 6, Positive unconditional cache size: 109, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 290 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 78, independent: 60, independent conditional: 10, independent unconditional: 50, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 60, independent conditional: 1, independent unconditional: 59, 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: 79, independent: 60, independent conditional: 1, independent unconditional: 59, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 60, independent conditional: 1, independent unconditional: 59, dependent: 18, dependent conditional: 1, dependent unconditional: 17, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 115, Positive conditional cache size: 6, Positive unconditional cache size: 109, Negative cache size: 34, Negative conditional cache size: 11, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 67, independent conditional: 67, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 67, independent conditional: 11, independent unconditional: 56, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 67, independent conditional: 1, independent unconditional: 66, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 67, independent conditional: 1, independent unconditional: 66, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 67, independent conditional: 1, independent unconditional: 66, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 115, Positive conditional cache size: 6, Positive unconditional cache size: 109, Negative cache size: 35, Negative conditional cache size: 12, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 94, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 94, independent conditional: 17, independent unconditional: 77, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 94, independent conditional: 6, independent unconditional: 88, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 94, independent conditional: 6, independent unconditional: 88, dependent: 26, dependent conditional: 4, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 94, independent conditional: 6, independent unconditional: 88, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 115, Positive conditional cache size: 6, Positive unconditional cache size: 109, Negative cache size: 36, Negative conditional cache size: 13, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 335, independent: 276, independent conditional: 276, independent unconditional: 0, dependent: 59, dependent conditional: 59, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 335, independent: 276, independent conditional: 118, independent unconditional: 158, dependent: 59, dependent conditional: 2, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 335, independent: 276, independent conditional: 23, independent unconditional: 253, dependent: 59, dependent conditional: 2, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 335, independent: 276, independent conditional: 23, independent unconditional: 253, dependent: 59, dependent conditional: 2, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 335, independent: 272, independent conditional: 22, independent unconditional: 250, dependent: 59, dependent conditional: 2, dependent unconditional: 57, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 132, Positive conditional cache size: 7, Positive unconditional cache size: 125, Negative cache size: 36, Negative conditional cache size: 13, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 95, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 58 PlacesBefore, 58 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 346, independent: 288, independent conditional: 288, independent unconditional: 0, dependent: 58, dependent conditional: 58, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 346, independent: 288, independent conditional: 168, independent unconditional: 120, dependent: 58, dependent conditional: 22, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 346, independent: 288, independent conditional: 104, independent unconditional: 184, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 346, independent: 288, independent conditional: 104, independent unconditional: 184, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 346, independent: 281, independent conditional: 97, independent unconditional: 184, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 141, Positive conditional cache size: 14, Positive unconditional cache size: 127, Negative cache size: 36, Negative conditional cache size: 13, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 86, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 18, independent conditional: 7, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 18, independent conditional: 7, independent unconditional: 11, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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: 26, independent: 16, independent conditional: 7, independent unconditional: 9, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 143, Positive conditional cache size: 14, Positive unconditional cache size: 129, Negative cache size: 37, Negative conditional cache size: 13, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 144, Positive conditional cache size: 14, Positive unconditional cache size: 130, Negative cache size: 37, Negative conditional cache size: 13, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.2s, 61 PlacesBefore, 55 PlacesAfterwards, 41 TransitionsBefore, 35 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 5 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 157, independent: 118, independent conditional: 118, 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: 157, independent: 118, independent conditional: 98, independent unconditional: 20, 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: 157, independent: 118, independent conditional: 67, independent unconditional: 51, 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: 157, independent: 118, independent conditional: 67, independent unconditional: 51, 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: 15, independent: 15, independent conditional: 13, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, independent: 103, independent conditional: 54, independent unconditional: 49, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 15, unknown conditional: 13, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 195, Positive conditional cache size: 31, Positive unconditional cache size: 164, Negative cache size: 37, Negative conditional cache size: 13, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 12, independent unconditional: 4, 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: 16, independent: 16, independent conditional: 12, independent unconditional: 4, 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: 16, independent: 16, independent conditional: 12, independent unconditional: 4, 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: 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: 16, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 222, Positive conditional cache size: 32, Positive unconditional cache size: 190, Negative cache size: 37, Negative conditional cache size: 13, Negative unconditional cache size: 24, 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.5s, 39 PlacesBefore, 37 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 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: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 226, Positive conditional cache size: 33, Positive unconditional cache size: 193, Negative cache size: 37, Negative conditional cache size: 13, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2516, ((void *)0), P0, ((void *)0))=-1, t2516={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2517, ((void *)0), P1, ((void *)0))=0, t2516={5:0}, t2517={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2518, ((void *)0), P2, ((void *)0))=1, t2516={5:0}, t2517={6:0}, t2518={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 [L790] 3 z = 1 [L741] 3 z = 2 [L746] 3 __unbuffered_p0_EAX = x [L758] 3 x = 1 [L761] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L822] 1 main$tmp_guard0 = __unbuffered_cnt == 3 [L824] CALL 1 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 1 !(!cond) [L824] RET 1 assume_abort_if_not(main$tmp_guard0) [L826] 1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] 1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] 1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 1 y$flush_delayed = weak$$choice2 [L836] 1 y$mem_tmp = y [L837] 1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] 1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] 1 y = y$flush_delayed ? y$mem_tmp : y [L846] 1 y$flush_delayed = (_Bool)0 [L848] CALL 1 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 1 !expression [L18] 1 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 96.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 23 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=599occurred in iteration=13, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 2203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-05 23:22:13,881 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...