/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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:48:29,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:48:29,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:48:29,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:48:29,774 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:48:29,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:48:29,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:48:29,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:48:29,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:48:29,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:48:29,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:48:29,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:48:29,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:48:29,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:48:29,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:48:29,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:48:29,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:48:29,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:48:29,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:48:29,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:48:29,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:48:29,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:48:29,790 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:48:29,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:48:29,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:48:29,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:48:29,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:48:29,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:48:29,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:48:29,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:48:29,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:48:29,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:48:29,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:48:29,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:48:29,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:48:29,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:48:29,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:48:29,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:48:29,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:48:29,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:48:29,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:48:29,800 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-13 00:48:29,842 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:48:29,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:48:29,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:48:29,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:48:29,844 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:48:29,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:48:29,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:48:29,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:48:29,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:48:29,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:48:29,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:48:29,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:48:29,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:48:29,846 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:48:29,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 00:48:30,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:48:30,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:48:30,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:48:30,118 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:48:30,119 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:48:30,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:48:31,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:48:31,433 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:48:31,434 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:48:31,443 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14da2d89/823398c8edcb402991d8b74ac6996a29/FLAGa6cd4ec85 [2022-12-13 00:48:31,458 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14da2d89/823398c8edcb402991d8b74ac6996a29 [2022-12-13 00:48:31,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:48:31,461 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:48:31,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:48:31,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:48:31,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:48:31,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8110c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31, skipping insertion in model container [2022-12-13 00:48:31,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:48:31,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:48:31,599 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 00:48:31,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:48:31,773 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:48:31,781 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-13 00:48:31,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:48:31,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:48:31,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:48:31,845 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:48:31,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31 WrapperNode [2022-12-13 00:48:31,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:48:31,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:48:31,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:48:31,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:48:31,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,889 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-13 00:48:31,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:48:31,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:48:31,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:48:31,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:48:31,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:48:31,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:48:31,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:48:31,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:48:31,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (1/1) ... [2022-12-13 00:48:31,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:48:31,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:48:31,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:48:31,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:48:31,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:48:31,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:48:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:48:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:48:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:48:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:48:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:48:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:48:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:48:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:48:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:48:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:48:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:48:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:48:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:48:31,973 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:48:32,085 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:48:32,087 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:48:32,401 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:48:32,496 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:48:32,496 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:48:32,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:32 BoogieIcfgContainer [2022-12-13 00:48:32,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:48:32,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:48:32,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:48:32,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:48:32,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:48:31" (1/3) ... [2022-12-13 00:48:32,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cef3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:32, skipping insertion in model container [2022-12-13 00:48:32,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:48:31" (2/3) ... [2022-12-13 00:48:32,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cef3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:48:32, skipping insertion in model container [2022-12-13 00:48:32,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:48:32" (3/3) ... [2022-12-13 00:48:32,507 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 00:48:32,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:48:32,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:48:32,521 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:48:32,567 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:48:32,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 00:48:32,645 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 00:48:32,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:32,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:48:32,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 00:48:32,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-13 00:48:32,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:32,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 00:48:32,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-13 00:48:32,730 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 00:48:32,730 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:32,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 00:48:32,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 00:48:32,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-13 00:48:36,518 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 00:48:36,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:48:36,534 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;@57ccff1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:48:36,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:48:36,537 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 00:48:36,537 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:36,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:36,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:48:36,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:36,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash 465769078, now seen corresponding path program 1 times [2022-12-13 00:48:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:36,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457207912] [2022-12-13 00:48:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:36,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:36,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457207912] [2022-12-13 00:48:36,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457207912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:36,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:36,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:36,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859393187] [2022-12-13 00:48:36,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:36,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:36,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:36,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:36,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 63 [2022-12-13 00:48:36,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:36,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:36,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 63 [2022-12-13 00:48:36,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:37,967 INFO L130 PetriNetUnfolder]: 7324/11563 cut-off events. [2022-12-13 00:48:37,967 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 00:48:37,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22115 conditions, 11563 events. 7324/11563 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 79303 event pairs, 2048 based on Foata normal form. 0/7186 useless extension candidates. Maximal degree in co-relation 22104. Up to 8877 conditions per place. [2022-12-13 00:48:38,002 INFO L137 encePairwiseOnDemand]: 55/63 looper letters, 32 selfloop transitions, 2 changer transitions 49/94 dead transitions. [2022-12-13 00:48:38,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 364 flow [2022-12-13 00:48:38,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-12-13 00:48:38,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2022-12-13 00:48:38,012 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 135 flow. Second operand 3 states and 129 transitions. [2022-12-13 00:48:38,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 364 flow [2022-12-13 00:48:38,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 360 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:38,016 INFO L231 Difference]: Finished difference. Result has 66 places, 32 transitions, 74 flow [2022-12-13 00:48:38,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=66, PETRI_TRANSITIONS=32} [2022-12-13 00:48:38,021 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-12-13 00:48:38,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:38,022 INFO L89 Accepts]: Start accepts. Operand has 66 places, 32 transitions, 74 flow [2022-12-13 00:48:38,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:38,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:38,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 32 transitions, 74 flow [2022-12-13 00:48:38,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 00:48:38,028 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:48:38,028 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:48:38,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 81 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:48:38,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 00:48:38,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 568 [2022-12-13 00:48:38,153 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:38,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 00:48:38,156 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 00:48:38,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:38,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:38,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:38,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:48:38,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2070113844, now seen corresponding path program 1 times [2022-12-13 00:48:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:38,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366040084] [2022-12-13 00:48:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:38,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:38,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366040084] [2022-12-13 00:48:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366040084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:38,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:48:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469935050] [2022-12-13 00:48:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:38,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:38,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:48:38,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:38,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:38,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:48:38,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:38,837 INFO L130 PetriNetUnfolder]: 3457/5416 cut-off events. [2022-12-13 00:48:38,837 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2022-12-13 00:48:38,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10882 conditions, 5416 events. 3457/5416 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 32225 event pairs, 1263 based on Foata normal form. 0/4354 useless extension candidates. Maximal degree in co-relation 10872. Up to 2682 conditions per place. [2022-12-13 00:48:38,854 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 36 selfloop transitions, 6 changer transitions 2/52 dead transitions. [2022-12-13 00:48:38,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 208 flow [2022-12-13 00:48:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-13 00:48:38,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-13 00:48:38,855 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 3 states and 69 transitions. [2022-12-13 00:48:38,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 208 flow [2022-12-13 00:48:38,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:38,856 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 110 flow [2022-12-13 00:48:38,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 00:48:38,857 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -26 predicate places. [2022-12-13 00:48:38,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:38,857 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 110 flow [2022-12-13 00:48:38,858 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:38,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:38,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 110 flow [2022-12-13 00:48:38,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 110 flow [2022-12-13 00:48:38,870 INFO L130 PetriNetUnfolder]: 46/215 cut-off events. [2022-12-13 00:48:38,871 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 00:48:38,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 215 events. 46/215 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1302 event pairs, 16 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 356. Up to 56 conditions per place. [2022-12-13 00:48:38,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 110 flow [2022-12-13 00:48:38,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 00:48:38,886 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:38,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 00:48:38,888 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 110 flow [2022-12-13 00:48:38,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:38,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:38,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:38,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:48:38,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 250980955, now seen corresponding path program 1 times [2022-12-13 00:48:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:38,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725145558] [2022-12-13 00:48:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:38,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725145558] [2022-12-13 00:48:38,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725145558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:38,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:38,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:48:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808401749] [2022-12-13 00:48:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:38,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:38,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:38,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:38,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:48:38,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:38,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:38,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:48:38,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:39,279 INFO L130 PetriNetUnfolder]: 2587/4134 cut-off events. [2022-12-13 00:48:39,279 INFO L131 PetriNetUnfolder]: For 1293/1293 co-relation queries the response was YES. [2022-12-13 00:48:39,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9710 conditions, 4134 events. 2587/4134 cut-off events. For 1293/1293 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23248 event pairs, 410 based on Foata normal form. 24/3438 useless extension candidates. Maximal degree in co-relation 9698. Up to 1765 conditions per place. [2022-12-13 00:48:39,296 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 7 changer transitions 4/59 dead transitions. [2022-12-13 00:48:39,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 276 flow [2022-12-13 00:48:39,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-13 00:48:39,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6532258064516129 [2022-12-13 00:48:39,298 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 110 flow. Second operand 4 states and 81 transitions. [2022-12-13 00:48:39,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 276 flow [2022-12-13 00:48:39,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:39,303 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 140 flow [2022-12-13 00:48:39,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2022-12-13 00:48:39,303 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -23 predicate places. [2022-12-13 00:48:39,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:39,304 INFO L89 Accepts]: Start accepts. Operand has 46 places, 37 transitions, 140 flow [2022-12-13 00:48:39,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:39,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:39,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 140 flow [2022-12-13 00:48:39,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 140 flow [2022-12-13 00:48:39,315 INFO L130 PetriNetUnfolder]: 33/178 cut-off events. [2022-12-13 00:48:39,315 INFO L131 PetriNetUnfolder]: For 87/100 co-relation queries the response was YES. [2022-12-13 00:48:39,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 178 events. 33/178 cut-off events. For 87/100 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1024 event pairs, 10 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 336. Up to 44 conditions per place. [2022-12-13 00:48:39,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 140 flow [2022-12-13 00:48:39,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 00:48:39,333 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:39,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 00:48:39,334 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 140 flow [2022-12-13 00:48:39,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:39,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:39,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:39,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:48:39,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash -809575241, now seen corresponding path program 1 times [2022-12-13 00:48:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:39,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923086683] [2022-12-13 00:48:39,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:39,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:39,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923086683] [2022-12-13 00:48:39,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923086683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:39,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:39,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:48:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97404641] [2022-12-13 00:48:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:39,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:48:39,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:39,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:39,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:48:39,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:39,730 INFO L130 PetriNetUnfolder]: 2433/3916 cut-off events. [2022-12-13 00:48:39,730 INFO L131 PetriNetUnfolder]: For 2801/2801 co-relation queries the response was YES. [2022-12-13 00:48:39,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9731 conditions, 3916 events. 2433/3916 cut-off events. For 2801/2801 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 21697 event pairs, 695 based on Foata normal form. 24/3254 useless extension candidates. Maximal degree in co-relation 9716. Up to 1308 conditions per place. [2022-12-13 00:48:39,746 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 43 selfloop transitions, 6 changer transitions 4/61 dead transitions. [2022-12-13 00:48:39,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 316 flow [2022-12-13 00:48:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 00:48:39,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-13 00:48:39,747 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 140 flow. Second operand 4 states and 80 transitions. [2022-12-13 00:48:39,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 316 flow [2022-12-13 00:48:39,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:48:39,756 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 183 flow [2022-12-13 00:48:39,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 00:48:39,756 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -18 predicate places. [2022-12-13 00:48:39,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:39,757 INFO L89 Accepts]: Start accepts. Operand has 51 places, 39 transitions, 183 flow [2022-12-13 00:48:39,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:39,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:39,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 183 flow [2022-12-13 00:48:39,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 39 transitions, 183 flow [2022-12-13 00:48:39,766 INFO L130 PetriNetUnfolder]: 21/134 cut-off events. [2022-12-13 00:48:39,766 INFO L131 PetriNetUnfolder]: For 114/124 co-relation queries the response was YES. [2022-12-13 00:48:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 134 events. 21/134 cut-off events. For 114/124 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 683 event pairs, 6 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 294. Up to 34 conditions per place. [2022-12-13 00:48:39,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 39 transitions, 183 flow [2022-12-13 00:48:39,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-13 00:48:39,769 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:39,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 00:48:39,769 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 183 flow [2022-12-13 00:48:39,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:39,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:39,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:39,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:48:39,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:39,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1440806137, now seen corresponding path program 1 times [2022-12-13 00:48:39,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:39,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027146948] [2022-12-13 00:48:39,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:39,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027146948] [2022-12-13 00:48:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027146948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:39,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:39,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168201804] [2022-12-13 00:48:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:39,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:39,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:39,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:48:39,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:39,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:39,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:48:39,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:40,371 INFO L130 PetriNetUnfolder]: 3359/5446 cut-off events. [2022-12-13 00:48:40,371 INFO L131 PetriNetUnfolder]: For 6514/6514 co-relation queries the response was YES. [2022-12-13 00:48:40,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14091 conditions, 5446 events. 3359/5446 cut-off events. For 6514/6514 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 34081 event pairs, 595 based on Foata normal form. 96/4512 useless extension candidates. Maximal degree in co-relation 14072. Up to 2620 conditions per place. [2022-12-13 00:48:40,389 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 51 selfloop transitions, 9 changer transitions 14/82 dead transitions. [2022-12-13 00:48:40,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 490 flow [2022-12-13 00:48:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2022-12-13 00:48:40,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2022-12-13 00:48:40,391 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 183 flow. Second operand 5 states and 105 transitions. [2022-12-13 00:48:40,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 490 flow [2022-12-13 00:48:40,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:40,433 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 230 flow [2022-12-13 00:48:40,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-13 00:48:40,434 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -14 predicate places. [2022-12-13 00:48:40,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:40,434 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 230 flow [2022-12-13 00:48:40,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:40,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:40,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 230 flow [2022-12-13 00:48:40,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 230 flow [2022-12-13 00:48:40,443 INFO L130 PetriNetUnfolder]: 16/125 cut-off events. [2022-12-13 00:48:40,444 INFO L131 PetriNetUnfolder]: For 121/126 co-relation queries the response was YES. [2022-12-13 00:48:40,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 125 events. 16/125 cut-off events. For 121/126 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 654 event pairs, 3 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 285. Up to 30 conditions per place. [2022-12-13 00:48:40,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 230 flow [2022-12-13 00:48:40,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 682 [2022-12-13 00:48:40,446 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:40,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 00:48:40,447 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 230 flow [2022-12-13 00:48:40,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:40,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:40,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:40,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:48:40,448 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -565447153, now seen corresponding path program 1 times [2022-12-13 00:48:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:40,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56100928] [2022-12-13 00:48:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:40,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56100928] [2022-12-13 00:48:40,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56100928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:40,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:40,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119089714] [2022-12-13 00:48:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:40,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:40,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:40,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:40,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:40,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:48:40,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:40,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:40,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:48:40,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:41,160 INFO L130 PetriNetUnfolder]: 3801/6150 cut-off events. [2022-12-13 00:48:41,160 INFO L131 PetriNetUnfolder]: For 7875/7875 co-relation queries the response was YES. [2022-12-13 00:48:41,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15839 conditions, 6150 events. 3801/6150 cut-off events. For 7875/7875 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 38976 event pairs, 789 based on Foata normal form. 120/4988 useless extension candidates. Maximal degree in co-relation 15818. Up to 1554 conditions per place. [2022-12-13 00:48:41,181 INFO L137 encePairwiseOnDemand]: 24/31 looper letters, 47 selfloop transitions, 10 changer transitions 36/101 dead transitions. [2022-12-13 00:48:41,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 580 flow [2022-12-13 00:48:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:48:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:48:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2022-12-13 00:48:41,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6682027649769585 [2022-12-13 00:48:41,182 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 230 flow. Second operand 7 states and 145 transitions. [2022-12-13 00:48:41,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 580 flow [2022-12-13 00:48:41,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 554 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:41,202 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 207 flow [2022-12-13 00:48:41,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2022-12-13 00:48:41,203 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2022-12-13 00:48:41,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:41,203 INFO L89 Accepts]: Start accepts. Operand has 62 places, 39 transitions, 207 flow [2022-12-13 00:48:41,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:41,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:41,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 39 transitions, 207 flow [2022-12-13 00:48:41,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 39 transitions, 207 flow [2022-12-13 00:48:41,211 INFO L130 PetriNetUnfolder]: 7/82 cut-off events. [2022-12-13 00:48:41,211 INFO L131 PetriNetUnfolder]: For 100/103 co-relation queries the response was YES. [2022-12-13 00:48:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 82 events. 7/82 cut-off events. For 100/103 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 1 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 181. Up to 18 conditions per place. [2022-12-13 00:48:41,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 39 transitions, 207 flow [2022-12-13 00:48:41,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 580 [2022-12-13 00:48:41,235 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [386] $Ultimate##0-->L804: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_5 |v_P2Thread1of1ForFork1_#in~arg.offset_5|) (= v_P2Thread1of1ForFork1_~arg.base_5 |v_P2Thread1of1ForFork1_#in~arg.base_5|) (= v_~y~0_14 v_~__unbuffered_p2_EAX~0_15)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_14} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_5|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_5, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_5, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_5|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [321] L784-->L787: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 00:48:41,265 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] $Ultimate##0-->L787: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_39 |v_P2Thread1of1ForFork1_#in~arg.base_39|) (= v_~y~0_128 v_~__unbuffered_p2_EAX~0_113) (= v_P2Thread1of1ForFork1_~arg.offset_39 |v_P2Thread1of1ForFork1_#in~arg.offset_39|) (= v_~y~0_127 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_39|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_39|, ~y~0=v_~y~0_128} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_39|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_39, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_39, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_39|, ~y~0=v_~y~0_127} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0] and [328] L804-->L807: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~y~0_4) InVars {~y~0=v_~y~0_4} OutVars{~y~0=v_~y~0_4, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-13 00:48:41,300 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:48:41,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-13 00:48:41,301 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 207 flow [2022-12-13 00:48:41,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:41,301 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:41,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:41,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:48:41,302 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:41,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:41,302 INFO L85 PathProgramCache]: Analyzing trace with hash -963014169, now seen corresponding path program 1 times [2022-12-13 00:48:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855363944] [2022-12-13 00:48:41,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:41,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:41,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855363944] [2022-12-13 00:48:41,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855363944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:41,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:41,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:48:41,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209952093] [2022-12-13 00:48:41,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:41,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:41,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:41,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:41,434 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:48:41,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:41,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:41,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:48:41,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:41,743 INFO L130 PetriNetUnfolder]: 2724/4211 cut-off events. [2022-12-13 00:48:41,743 INFO L131 PetriNetUnfolder]: For 6010/6020 co-relation queries the response was YES. [2022-12-13 00:48:41,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10706 conditions, 4211 events. 2724/4211 cut-off events. For 6010/6020 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23045 event pairs, 921 based on Foata normal form. 42/2765 useless extension candidates. Maximal degree in co-relation 10681. Up to 4063 conditions per place. [2022-12-13 00:48:41,762 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 36 selfloop transitions, 10 changer transitions 4/59 dead transitions. [2022-12-13 00:48:41,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 400 flow [2022-12-13 00:48:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 00:48:41,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6979166666666666 [2022-12-13 00:48:41,764 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 207 flow. Second operand 3 states and 67 transitions. [2022-12-13 00:48:41,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 400 flow [2022-12-13 00:48:41,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 348 flow, removed 10 selfloop flow, removed 8 redundant places. [2022-12-13 00:48:41,773 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 237 flow [2022-12-13 00:48:41,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 00:48:41,773 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -15 predicate places. [2022-12-13 00:48:41,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:41,774 INFO L89 Accepts]: Start accepts. Operand has 54 places, 47 transitions, 237 flow [2022-12-13 00:48:41,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:41,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:41,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 237 flow [2022-12-13 00:48:41,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 237 flow [2022-12-13 00:48:41,849 INFO L130 PetriNetUnfolder]: 704/1270 cut-off events. [2022-12-13 00:48:41,849 INFO L131 PetriNetUnfolder]: For 125/138 co-relation queries the response was YES. [2022-12-13 00:48:41,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1270 events. 704/1270 cut-off events. For 125/138 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 8154 event pairs, 334 based on Foata normal form. 9/660 useless extension candidates. Maximal degree in co-relation 2581. Up to 1096 conditions per place. [2022-12-13 00:48:41,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 237 flow [2022-12-13 00:48:41,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 00:48:41,881 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:41,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 00:48:41,883 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 237 flow [2022-12-13 00:48:41,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:41,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:41,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:41,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:48:41,884 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:41,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1634842359, now seen corresponding path program 1 times [2022-12-13 00:48:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:41,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272708044] [2022-12-13 00:48:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:42,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:42,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272708044] [2022-12-13 00:48:42,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272708044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:42,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:42,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38605839] [2022-12-13 00:48:42,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:42,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:42,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:42,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:42,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 00:48:42,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:42,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:42,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 00:48:42,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:42,548 INFO L130 PetriNetUnfolder]: 3572/5666 cut-off events. [2022-12-13 00:48:42,548 INFO L131 PetriNetUnfolder]: For 4175/4301 co-relation queries the response was YES. [2022-12-13 00:48:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16364 conditions, 5666 events. 3572/5666 cut-off events. For 4175/4301 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 35259 event pairs, 1266 based on Foata normal form. 118/4520 useless extension candidates. Maximal degree in co-relation 16344. Up to 3737 conditions per place. [2022-12-13 00:48:42,573 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 60 selfloop transitions, 8 changer transitions 22/101 dead transitions. [2022-12-13 00:48:42,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 634 flow [2022-12-13 00:48:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-13 00:48:42,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 00:48:42,574 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 237 flow. Second operand 5 states and 104 transitions. [2022-12-13 00:48:42,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 634 flow [2022-12-13 00:48:42,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:48:42,580 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 231 flow [2022-12-13 00:48:42,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2022-12-13 00:48:42,583 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -12 predicate places. [2022-12-13 00:48:42,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:42,583 INFO L89 Accepts]: Start accepts. Operand has 57 places, 46 transitions, 231 flow [2022-12-13 00:48:42,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:42,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:42,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 231 flow [2022-12-13 00:48:42,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 46 transitions, 231 flow [2022-12-13 00:48:42,635 INFO L130 PetriNetUnfolder]: 666/1185 cut-off events. [2022-12-13 00:48:42,635 INFO L131 PetriNetUnfolder]: For 140/157 co-relation queries the response was YES. [2022-12-13 00:48:42,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 1185 events. 666/1185 cut-off events. For 140/157 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 7654 event pairs, 325 based on Foata normal form. 15/590 useless extension candidates. Maximal degree in co-relation 2389. Up to 1039 conditions per place. [2022-12-13 00:48:42,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 46 transitions, 231 flow [2022-12-13 00:48:42,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 00:48:42,659 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:42,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 00:48:42,661 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 231 flow [2022-12-13 00:48:42,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:42,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:42,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:42,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:48:42,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:42,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1506843620, now seen corresponding path program 1 times [2022-12-13 00:48:42,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:42,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713615930] [2022-12-13 00:48:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:42,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:42,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713615930] [2022-12-13 00:48:42,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713615930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:42,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:42,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966985450] [2022-12-13 00:48:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:48:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:48:42,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:48:42,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2022-12-13 00:48:42,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:42,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:42,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2022-12-13 00:48:42,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:43,129 INFO L130 PetriNetUnfolder]: 1541/2667 cut-off events. [2022-12-13 00:48:43,129 INFO L131 PetriNetUnfolder]: For 2402/2406 co-relation queries the response was YES. [2022-12-13 00:48:43,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8149 conditions, 2667 events. 1541/2667 cut-off events. For 2402/2406 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 15949 event pairs, 237 based on Foata normal form. 132/1872 useless extension candidates. Maximal degree in co-relation 8128. Up to 2161 conditions per place. [2022-12-13 00:48:43,140 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 40 selfloop transitions, 19 changer transitions 6/74 dead transitions. [2022-12-13 00:48:43,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 495 flow [2022-12-13 00:48:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:48:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:48:43,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-13 00:48:43,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7096774193548387 [2022-12-13 00:48:43,141 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 231 flow. Second operand 4 states and 88 transitions. [2022-12-13 00:48:43,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 495 flow [2022-12-13 00:48:43,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 471 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:48:43,144 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 327 flow [2022-12-13 00:48:43,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2022-12-13 00:48:43,145 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -12 predicate places. [2022-12-13 00:48:43,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:43,146 INFO L89 Accepts]: Start accepts. Operand has 57 places, 55 transitions, 327 flow [2022-12-13 00:48:43,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:43,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:43,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 55 transitions, 327 flow [2022-12-13 00:48:43,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 55 transitions, 327 flow [2022-12-13 00:48:43,196 INFO L130 PetriNetUnfolder]: 525/1062 cut-off events. [2022-12-13 00:48:43,197 INFO L131 PetriNetUnfolder]: For 212/505 co-relation queries the response was YES. [2022-12-13 00:48:43,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3153 conditions, 1062 events. 525/1062 cut-off events. For 212/505 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 7498 event pairs, 82 based on Foata normal form. 15/587 useless extension candidates. Maximal degree in co-relation 3134. Up to 844 conditions per place. [2022-12-13 00:48:43,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 55 transitions, 327 flow [2022-12-13 00:48:43,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 00:48:43,209 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:43,210 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 00:48:43,210 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 327 flow [2022-12-13 00:48:43,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:43,210 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:43,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:43,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:48:43,210 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:43,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:43,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1561265905, now seen corresponding path program 1 times [2022-12-13 00:48:43,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:43,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931949231] [2022-12-13 00:48:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:43,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931949231] [2022-12-13 00:48:43,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931949231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:43,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:43,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:48:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954422523] [2022-12-13 00:48:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:43,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:43,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:43,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:48:43,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:43,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:43,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:48:43,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:43,700 INFO L130 PetriNetUnfolder]: 2489/4492 cut-off events. [2022-12-13 00:48:43,700 INFO L131 PetriNetUnfolder]: For 4990/5470 co-relation queries the response was YES. [2022-12-13 00:48:43,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16389 conditions, 4492 events. 2489/4492 cut-off events. For 4990/5470 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 32474 event pairs, 645 based on Foata normal form. 332/3927 useless extension candidates. Maximal degree in co-relation 16367. Up to 2880 conditions per place. [2022-12-13 00:48:43,716 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 53 selfloop transitions, 6 changer transitions 36/109 dead transitions. [2022-12-13 00:48:43,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 833 flow [2022-12-13 00:48:43,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:48:43,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2022-12-13 00:48:43,717 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 327 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:48:43,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 833 flow [2022-12-13 00:48:43,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 747 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 00:48:43,722 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 288 flow [2022-12-13 00:48:43,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2022-12-13 00:48:43,722 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -9 predicate places. [2022-12-13 00:48:43,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:43,723 INFO L89 Accepts]: Start accepts. Operand has 60 places, 53 transitions, 288 flow [2022-12-13 00:48:43,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:43,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:43,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 53 transitions, 288 flow [2022-12-13 00:48:43,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 53 transitions, 288 flow [2022-12-13 00:48:43,770 INFO L130 PetriNetUnfolder]: 522/1049 cut-off events. [2022-12-13 00:48:43,770 INFO L131 PetriNetUnfolder]: For 479/571 co-relation queries the response was YES. [2022-12-13 00:48:43,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2862 conditions, 1049 events. 522/1049 cut-off events. For 479/571 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 7390 event pairs, 81 based on Foata normal form. 15/579 useless extension candidates. Maximal degree in co-relation 2842. Up to 811 conditions per place. [2022-12-13 00:48:43,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 53 transitions, 288 flow [2022-12-13 00:48:43,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 614 [2022-12-13 00:48:43,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:48:43,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 00:48:43,809 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 284 flow [2022-12-13 00:48:43,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:43,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:43,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:43,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:48:43,809 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash 499696880, now seen corresponding path program 1 times [2022-12-13 00:48:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:43,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048712668] [2022-12-13 00:48:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:44,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048712668] [2022-12-13 00:48:44,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048712668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:44,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:44,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052411295] [2022-12-13 00:48:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:44,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:44,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:44,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2022-12-13 00:48:44,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 284 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:44,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:44,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2022-12-13 00:48:44,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:44,461 INFO L130 PetriNetUnfolder]: 1983/3561 cut-off events. [2022-12-13 00:48:44,461 INFO L131 PetriNetUnfolder]: For 4921/5187 co-relation queries the response was YES. [2022-12-13 00:48:44,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12286 conditions, 3561 events. 1983/3561 cut-off events. For 4921/5187 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 24414 event pairs, 240 based on Foata normal form. 275/3104 useless extension candidates. Maximal degree in co-relation 12263. Up to 2133 conditions per place. [2022-12-13 00:48:44,472 INFO L137 encePairwiseOnDemand]: 21/30 looper letters, 58 selfloop transitions, 18 changer transitions 27/117 dead transitions. [2022-12-13 00:48:44,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 117 transitions, 827 flow [2022-12-13 00:48:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 00:48:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 00:48:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-12-13 00:48:44,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2022-12-13 00:48:44,473 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 284 flow. Second operand 7 states and 129 transitions. [2022-12-13 00:48:44,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 117 transitions, 827 flow [2022-12-13 00:48:44,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 757 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 00:48:44,479 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 376 flow [2022-12-13 00:48:44,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=376, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2022-12-13 00:48:44,480 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2022-12-13 00:48:44,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:44,480 INFO L89 Accepts]: Start accepts. Operand has 62 places, 64 transitions, 376 flow [2022-12-13 00:48:44,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:44,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:44,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 64 transitions, 376 flow [2022-12-13 00:48:44,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 376 flow [2022-12-13 00:48:44,551 INFO L130 PetriNetUnfolder]: 784/1542 cut-off events. [2022-12-13 00:48:44,551 INFO L131 PetriNetUnfolder]: For 1045/1148 co-relation queries the response was YES. [2022-12-13 00:48:44,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4467 conditions, 1542 events. 784/1542 cut-off events. For 1045/1148 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 10969 event pairs, 81 based on Foata normal form. 20/850 useless extension candidates. Maximal degree in co-relation 4445. Up to 1162 conditions per place. [2022-12-13 00:48:44,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 64 transitions, 376 flow [2022-12-13 00:48:44,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:48:44,563 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] $Ultimate##0-->L807: Formula: (and (= v_~__unbuffered_p2_EBX~0_96 v_~y~0_135) (= v_P2Thread1of1ForFork1_~arg.base_43 |v_P2Thread1of1ForFork1_#in~arg.base_43|) (= v_P2Thread1of1ForFork1_~arg.offset_43 |v_P2Thread1of1ForFork1_#in~arg.offset_43|) (= v_~y~0_135 v_~__unbuffered_p2_EAX~0_117)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_135} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_96, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_43, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_135} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [439] $Ultimate##0-->L745: 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_~y~0_57 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|, ~y~0=v_~y~0_57, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:48:44,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] $Ultimate##0-->L807: Formula: (and (= v_~__unbuffered_p2_EBX~0_96 v_~y~0_135) (= v_P2Thread1of1ForFork1_~arg.base_43 |v_P2Thread1of1ForFork1_#in~arg.base_43|) (= v_P2Thread1of1ForFork1_~arg.offset_43 |v_P2Thread1of1ForFork1_#in~arg.offset_43|) (= v_~y~0_135 v_~__unbuffered_p2_EAX~0_117)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_135} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_96, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_43, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_135} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [439] $Ultimate##0-->L745: 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_~y~0_57 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|, ~y~0=v_~y~0_57, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:48:44,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [475] $Ultimate##0-->L807: Formula: (and (= v_~__unbuffered_p2_EBX~0_96 v_~y~0_135) (= v_P2Thread1of1ForFork1_~arg.base_43 |v_P2Thread1of1ForFork1_#in~arg.base_43|) (= v_P2Thread1of1ForFork1_~arg.offset_43 |v_P2Thread1of1ForFork1_#in~arg.offset_43|) (= v_~y~0_135 v_~__unbuffered_p2_EAX~0_117)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_135} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_96, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_43, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_117, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_135} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0] and [314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:48:44,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [477] $Ultimate##0-->L745: Formula: (and (= v_~y~0_142 v_~__unbuffered_p2_EAX~0_121) (= v_P2Thread1of1ForFork1_~arg.offset_47 |v_P2Thread1of1ForFork1_#in~arg.offset_47|) (= v_P0Thread1of1ForFork2_~arg.base_29 |v_P0Thread1of1ForFork2_#in~arg.base_29|) (= v_P2Thread1of1ForFork1_~arg.base_47 |v_P2Thread1of1ForFork1_#in~arg.base_47|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_29| v_P0Thread1of1ForFork2_~arg.offset_29) (= v_~y~0_141 2) (= v_~y~0_142 v_~__unbuffered_p2_EBX~0_100)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_47|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_47|, ~y~0=v_~y~0_142} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_47|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_100, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_29|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_47, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_47, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_29, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_121, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_47|, ~y~0=v_~y~0_141, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_29} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork2_~arg.base] and [321] L784-->L787: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 00:48:44,800 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [439] $Ultimate##0-->L745: 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_~y~0_57 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|, ~y~0=v_~y~0_57, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] and [321] L784-->L787: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] [2022-12-13 00:48:44,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] $Ultimate##0-->L745: Formula: (and (= v_~y~0_138 v_~__unbuffered_p2_EAX~0_119) (= v_P2Thread1of1ForFork1_~arg.offset_45 |v_P2Thread1of1ForFork1_#in~arg.offset_45|) (= v_~y~0_137 2) (= v_P0Thread1of1ForFork2_~arg.base_27 |v_P0Thread1of1ForFork2_#in~arg.base_27|) (= v_P2Thread1of1ForFork1_~arg.base_45 |v_P2Thread1of1ForFork1_#in~arg.base_45|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_27| v_P0Thread1of1ForFork2_~arg.offset_27) (= v_~__unbuffered_p2_EBX~0_98 v_~y~0_138)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_45|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_27|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_27|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_45|, ~y~0=v_~y~0_138} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_45|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_98, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_27|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_45, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_45, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_27, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_119, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_45|, ~y~0=v_~y~0_137, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_27} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0, P0Thread1of1ForFork2_~arg.base] and [329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:44,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:45,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L784: Formula: (and (= v_~x$w_buff0~0_131 v_~x$w_buff1~0_109) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$w_buff0_used~0_205 1) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff1_thd1~0_67 v_~x$r_buff0_thd1~0_71) (= v_~x$w_buff0_used~0_206 v_~x$w_buff1_used~0_182) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_205 256) 0)) (not (= (mod v_~x$w_buff1_used~0_182 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$w_buff0~0_130 1) (= v_~x$r_buff1_thd2~0_49 v_~x$r_buff0_thd2~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_131, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_206} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_109, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_182, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_205, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:45,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L784: Formula: (and (= v_~x$w_buff0~0_131 v_~x$w_buff1~0_109) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$w_buff0_used~0_205 1) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff1_thd1~0_67 v_~x$r_buff0_thd1~0_71) (= v_~x$w_buff0_used~0_206 v_~x$w_buff1_used~0_182) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_205 256) 0)) (not (= (mod v_~x$w_buff1_used~0_182 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$w_buff0~0_130 1) (= v_~x$r_buff1_thd2~0_49 v_~x$r_buff0_thd2~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_131, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_206} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_109, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_182, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_205, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [314] L745-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_32 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_40 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_118 256) 0)) (.cse4 (and .cse3 .cse10)) (.cse8 (and .cse3 (= (mod v_~x$w_buff1_used~0_103 256) 0)))) (let ((.cse6 (or .cse11 .cse4 .cse8)) (.cse7 (and .cse5 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_102 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_117 256) 0))) (and (= v_~x~0_70 (ite .cse0 v_~x$mem_tmp~0_14 v_~__unbuffered_p0_EAX~0_6)) (= (ite .cse0 v_~x$r_buff0_thd1~0_40 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_40 (ite (and (not .cse1) .cse5) 0 v_~x$r_buff0_thd1~0_40))) v_~x$r_buff0_thd1~0_39) (= |v_P0Thread1of1ForFork2_#t~nondet4_1| v_~weak$$choice2~0_30) (= |v_P0Thread1of1ForFork2_#t~nondet3_1| v_~weak$$choice0~0_11) (= v_~__unbuffered_p0_EAX~0_6 (ite .cse6 v_~x~0_72 (ite .cse7 v_~x$w_buff0~0_65 v_~x$w_buff1~0_54))) (= (ite .cse0 v_~x$w_buff1_used~0_103 (ite (or .cse1 .cse4 .cse8) v_~x$w_buff1_used~0_103 0)) v_~x$w_buff1_used~0_102) (= v_~x$flush_delayed~0_21 0) (= v_~x~0_72 v_~x$mem_tmp~0_14) (= v_~x$w_buff1~0_54 v_~x$w_buff1~0_53) (= v_~x$w_buff0_used~0_117 (ite .cse0 v_~x$w_buff0_used~0_118 (ite .cse6 v_~x$w_buff0_used~0_118 (ite .cse7 0 v_~x$w_buff0_used~0_118)))) (= v_~x$r_buff1_thd1~0_31 (ite .cse0 v_~x$r_buff1_thd1~0_32 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_39 256) 0))) (or (and .cse2 .cse9) .cse1 (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_32 0))) (= v_~x$w_buff0~0_65 v_~x$w_buff0~0_64))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_65, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_54, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_32, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_1|, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_1|, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_117, ~weak$$choice0~0=v_~weak$$choice0~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~x~0=v_~x~0_70} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:48:45,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L784: Formula: (and (= v_~x$w_buff0~0_131 v_~x$w_buff1~0_109) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$w_buff0_used~0_205 1) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff1_thd1~0_67 v_~x$r_buff0_thd1~0_71) (= v_~x$w_buff0_used~0_206 v_~x$w_buff1_used~0_182) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_205 256) 0)) (not (= (mod v_~x$w_buff1_used~0_182 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$w_buff0~0_130 1) (= v_~x$r_buff1_thd2~0_49 v_~x$r_buff0_thd2~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_131, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_206} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_109, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_182, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_205, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [482] L787-->L814: Formula: (let ((.cse14 (not (= (mod v_~x$r_buff0_thd2~0_169 256) 0)))) (let ((.cse11 (and .cse14 (not (= (mod v_~x$w_buff0_used~0_512 256) 0))))) (let ((.cse10 (ite .cse11 0 v_~x$w_buff0_used~0_512))) (let ((.cse5 (not (= (mod v_~x$r_buff1_thd2~0_128 256) 0))) (.cse4 (not (= (mod .cse10 256) 0)))) (let ((.cse0 (and .cse14 .cse4)) (.cse12 (and .cse5 (not (= (mod v_~x$w_buff1_used~0_462 256) 0))))) (let ((.cse3 (ite (or .cse0 .cse12) 0 v_~x$w_buff1_used~0_462))) (let ((.cse8 (not (= (mod v_~x$r_buff1_thd3~0_151 256) 0))) (.cse6 (not (= (mod .cse3 256) 0))) (.cse7 (not (= (mod v_~x$w_buff0_used~0_510 256) 0))) (.cse13 (not (= (mod v_~x$r_buff0_thd3~0_152 256) 0)))) (let ((.cse1 (and .cse7 .cse13)) (.cse9 (and .cse13 .cse4)) (.cse2 (and .cse8 .cse6))) (and (= v_~x$r_buff0_thd2~0_168 (ite .cse0 0 v_~x$r_buff0_thd2~0_169)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_152) v_~x$r_buff0_thd3~0_151) (= (ite (or .cse1 .cse2) 0 .cse3) v_~x$w_buff1_used~0_460) (= (ite (or (and (not (= 0 (mod v_~x$r_buff0_thd2~0_168 256))) .cse4) (and .cse5 .cse6)) 0 v_~x$r_buff1_thd2~0_128) v_~x$r_buff1_thd2~0_127) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_151 256) 0)) .cse7) (and .cse8 (not (= (mod v_~x$w_buff1_used~0_460 256) 0)))) 0 v_~x$r_buff1_thd3~0_151) v_~x$r_buff1_thd3~0_150) (= v_~x$w_buff0_used~0_510 (ite .cse9 0 .cse10)) (= v_~x~0_389 (ite .cse9 v_~x$w_buff0~0_322 (ite .cse2 v_~x$w_buff1~0_266 (ite .cse11 v_~x$w_buff0~0_322 (ite .cse12 v_~x$w_buff1~0_266 v_~x~0_391)))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_322, ~x$w_buff1~0=v_~x$w_buff1~0_266, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_151, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_462, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_128, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_152, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_169, ~x~0=v_~x~0_391, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_512} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_322, ~x$w_buff1~0=v_~x$w_buff1~0_266, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_150, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_460, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_151, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ~x~0=v_~x~0_389, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_510} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff0_thd3~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:46,182 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:48:46,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1703 [2022-12-13 00:48:46,183 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 394 flow [2022-12-13 00:48:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:46,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:46,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:46,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:48:46,184 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 271736668, now seen corresponding path program 1 times [2022-12-13 00:48:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358119056] [2022-12-13 00:48:46,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:46,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:46,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358119056] [2022-12-13 00:48:46,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358119056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:46,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:46,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:46,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466269528] [2022-12-13 00:48:46,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:46,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:48:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:46,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:48:46,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:48:46,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-13 00:48:46,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 394 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:46,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:46,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-13 00:48:46,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:46,521 INFO L130 PetriNetUnfolder]: 673/1370 cut-off events. [2022-12-13 00:48:46,522 INFO L131 PetriNetUnfolder]: For 1920/1921 co-relation queries the response was YES. [2022-12-13 00:48:46,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 1370 events. 673/1370 cut-off events. For 1920/1921 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8520 event pairs, 26 based on Foata normal form. 162/1019 useless extension candidates. Maximal degree in co-relation 5193. Up to 685 conditions per place. [2022-12-13 00:48:46,527 INFO L137 encePairwiseOnDemand]: 27/38 looper letters, 39 selfloop transitions, 28 changer transitions 10/83 dead transitions. [2022-12-13 00:48:46,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 670 flow [2022-12-13 00:48:46,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:48:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:48:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2022-12-13 00:48:46,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5052631578947369 [2022-12-13 00:48:46,528 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 394 flow. Second operand 5 states and 96 transitions. [2022-12-13 00:48:46,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 670 flow [2022-12-13 00:48:46,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 625 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 00:48:46,533 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 396 flow [2022-12-13 00:48:46,533 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-13 00:48:46,533 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -8 predicate places. [2022-12-13 00:48:46,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:46,533 INFO L89 Accepts]: Start accepts. Operand has 61 places, 58 transitions, 396 flow [2022-12-13 00:48:46,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:46,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:46,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 58 transitions, 396 flow [2022-12-13 00:48:46,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 58 transitions, 396 flow [2022-12-13 00:48:46,571 INFO L130 PetriNetUnfolder]: 412/905 cut-off events. [2022-12-13 00:48:46,572 INFO L131 PetriNetUnfolder]: For 514/744 co-relation queries the response was YES. [2022-12-13 00:48:46,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 905 events. 412/905 cut-off events. For 514/744 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 6137 event pairs, 0 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 3354. Up to 676 conditions per place. [2022-12-13 00:48:46,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 58 transitions, 396 flow [2022-12-13 00:48:46,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-13 00:48:46,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [465] $Ultimate##0-->L784: Formula: (and (= v_~x$w_buff0~0_131 v_~x$w_buff1~0_109) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$w_buff0_used~0_205 1) (= v_~x$r_buff1_thd3~0_62 v_~x$r_buff0_thd3~0_65) (= v_~x$r_buff1_thd1~0_67 v_~x$r_buff0_thd1~0_71) (= v_~x$w_buff0_used~0_206 v_~x$w_buff1_used~0_182) (= v_~x$r_buff1_thd0~0_63 v_~x$r_buff0_thd0~0_67) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_205 256) 0)) (not (= (mod v_~x$w_buff1_used~0_182 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|) (= v_~x$r_buff0_thd2~0_64 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~x$w_buff0~0_130 1) (= v_~x$r_buff1_thd2~0_49 v_~x$r_buff0_thd2~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_131, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_65, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_206} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_67, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_109, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_62, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_182, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_67, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_65, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_64, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_63, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_205, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] and [480] $Ultimate##0-->L787: Formula: (and (= v_~y~0_153 1) (= |v_P0Thread1of1ForFork2_#in~arg.offset_33| v_P0Thread1of1ForFork2_~arg.offset_33) (= v_P0Thread1of1ForFork2_~arg.base_33 |v_P0Thread1of1ForFork2_#in~arg.base_33|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_33|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_33|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_33|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_33, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_33|, ~y~0=v_~y~0_153, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_33} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~y~0, P0Thread1of1ForFork2_~arg.base] [2022-12-13 00:48:46,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L841-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_197 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_546 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_195 256) 0)))) (let ((.cse0 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_547 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_485 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_485) v_~x$w_buff1_used~0_484) (= v_~x$r_buff1_thd0~0_196 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd0~0_194 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_484 256) 0)))) 0 v_~x$r_buff1_thd0~0_197)) (= v_~x$w_buff0_used~0_546 (ite .cse4 0 v_~x$w_buff0_used~0_547)) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_108 1) (= v_~__unbuffered_p2_EAX~0_129 1) (= v_~__unbuffered_p0_EAX~0_136 0) (= v_~y~0_167 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_178) (= v_~x$r_buff0_thd0~0_194 (ite .cse0 0 v_~x$r_buff0_thd0~0_195)) (= (ite .cse4 v_~x$w_buff0~0_350 (ite .cse1 v_~x$w_buff1~0_282 v_~x~0_408)) v_~x~0_407) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_165| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_161| (mod v_~main$tmp_guard1~0_178 256)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_161| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_165|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_195, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_108, ~x$w_buff1~0=v_~x$w_buff1~0_282, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_485, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_129, ~y~0=v_~y~0_167, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x~0=v_~x~0_408, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_547} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_194, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_165|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_108, ~x$w_buff1~0=v_~x$w_buff1~0_282, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_484, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_178, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_196, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_546, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_161|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_129, ~y~0=v_~y~0_167, ~x~0=v_~x~0_407} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] and [484] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0_used~0_523 v_~x$w_buff1_used~0_470) (= v_~x$r_buff0_thd2~0_176 1) (= v_~x$r_buff0_thd3~0_159 v_~x$r_buff1_thd3~0_158) (= v_~y~0_161 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_57| |v_P1Thread1of1ForFork0_#in~arg#1.base_57|) (= v_~x$w_buff0~0_328 1) (= v_~x$w_buff0~0_329 v_~x$w_buff1~0_270) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| 0)) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_522 256) 0)) (not (= (mod v_~x$w_buff1_used~0_470 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_57| |v_P1Thread1of1ForFork0_~arg#1.offset_57|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_63| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|) (= v_~x$r_buff0_thd0~0_184 v_~x$r_buff1_thd0~0_186) (= v_~x$r_buff0_thd1~0_163 v_~x$r_buff1_thd1~0_161) (= v_~x$w_buff0_used~0_522 1) (= v_~x$r_buff0_thd2~0_177 v_~x$r_buff1_thd2~0_133)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_329, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_184, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_57|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_159, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_523} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_328, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_184, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_63|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_57|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_57|, ~x$w_buff1~0=v_~x$w_buff1~0_270, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_158, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_133, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_470, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_161, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_63|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_159, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_176, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_186, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_57|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_522, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_57|, ~y~0=v_~y~0_161} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] [2022-12-13 00:48:48,005 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:48:48,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1473 [2022-12-13 00:48:48,006 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 417 flow [2022-12-13 00:48:48,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:48,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:48,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:48,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:48:48,006 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash 927964911, now seen corresponding path program 1 times [2022-12-13 00:48:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:48,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008328484] [2022-12-13 00:48:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:48,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:48,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008328484] [2022-12-13 00:48:48,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008328484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:48,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:48,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:48:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641240901] [2022-12-13 00:48:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:48:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:48:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:48:48,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:48:48,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:48,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:48,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:48:48,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:48,815 INFO L130 PetriNetUnfolder]: 859/1598 cut-off events. [2022-12-13 00:48:48,816 INFO L131 PetriNetUnfolder]: For 3219/3334 co-relation queries the response was YES. [2022-12-13 00:48:48,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7446 conditions, 1598 events. 859/1598 cut-off events. For 3219/3334 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 9994 event pairs, 107 based on Foata normal form. 102/1259 useless extension candidates. Maximal degree in co-relation 7422. Up to 1119 conditions per place. [2022-12-13 00:48:48,822 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 34 selfloop transitions, 6 changer transitions 50/104 dead transitions. [2022-12-13 00:48:48,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 947 flow [2022-12-13 00:48:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:48:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:48:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-13 00:48:48,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-13 00:48:48,823 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 417 flow. Second operand 6 states and 102 transitions. [2022-12-13 00:48:48,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 947 flow [2022-12-13 00:48:48,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 757 flow, removed 43 selfloop flow, removed 4 redundant places. [2022-12-13 00:48:48,839 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 315 flow [2022-12-13 00:48:48,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2022-12-13 00:48:48,840 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -7 predicate places. [2022-12-13 00:48:48,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:48,840 INFO L89 Accepts]: Start accepts. Operand has 62 places, 52 transitions, 315 flow [2022-12-13 00:48:48,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:48,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:48,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 52 transitions, 315 flow [2022-12-13 00:48:48,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 52 transitions, 315 flow [2022-12-13 00:48:48,869 INFO L130 PetriNetUnfolder]: 264/565 cut-off events. [2022-12-13 00:48:48,869 INFO L131 PetriNetUnfolder]: For 872/891 co-relation queries the response was YES. [2022-12-13 00:48:48,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 565 events. 264/565 cut-off events. For 872/891 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 3614 event pairs, 1 based on Foata normal form. 3/232 useless extension candidates. Maximal degree in co-relation 1669. Up to 298 conditions per place. [2022-12-13 00:48:48,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 52 transitions, 315 flow [2022-12-13 00:48:48,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 00:48:48,873 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:48:48,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-13 00:48:48,874 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 315 flow [2022-12-13 00:48:48,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:48,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:48,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:48,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:48:48,874 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2006228417, now seen corresponding path program 1 times [2022-12-13 00:48:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:48,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4866538] [2022-12-13 00:48:48,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:49,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4866538] [2022-12-13 00:48:49,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4866538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:49,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:49,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:48:49,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697894914] [2022-12-13 00:48:49,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:49,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:48:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:48:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:48:49,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 00:48:49,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:49,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:49,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 00:48:49,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:49,081 INFO L130 PetriNetUnfolder]: 440/832 cut-off events. [2022-12-13 00:48:49,081 INFO L131 PetriNetUnfolder]: For 2005/2051 co-relation queries the response was YES. [2022-12-13 00:48:49,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 832 events. 440/832 cut-off events. For 2005/2051 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4557 event pairs, 55 based on Foata normal form. 56/665 useless extension candidates. Maximal degree in co-relation 3015. Up to 392 conditions per place. [2022-12-13 00:48:49,084 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 2 changer transitions 19/72 dead transitions. [2022-12-13 00:48:49,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 526 flow [2022-12-13 00:48:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:48:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:48:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 00:48:49,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2022-12-13 00:48:49,085 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 315 flow. Second operand 3 states and 58 transitions. [2022-12-13 00:48:49,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 526 flow [2022-12-13 00:48:49,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 505 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 00:48:49,090 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2022-12-13 00:48:49,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-13 00:48:49,091 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -15 predicate places. [2022-12-13 00:48:49,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:49,091 INFO L89 Accepts]: Start accepts. Operand has 54 places, 42 transitions, 228 flow [2022-12-13 00:48:49,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:49,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:49,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 228 flow [2022-12-13 00:48:49,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 228 flow [2022-12-13 00:48:49,104 INFO L130 PetriNetUnfolder]: 91/208 cut-off events. [2022-12-13 00:48:49,104 INFO L131 PetriNetUnfolder]: For 319/325 co-relation queries the response was YES. [2022-12-13 00:48:49,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 208 events. 91/208 cut-off events. For 319/325 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1038 event pairs, 1 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 613. Up to 109 conditions per place. [2022-12-13 00:48:49,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 228 flow [2022-12-13 00:48:49,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-13 00:48:50,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0_used~0_543 v_~x$w_buff1_used~0_482) (= v_~y~0_165 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_65| |v_P1Thread1of1ForFork0_#in~arg#1.base_65|) (= v_~x$w_buff0~0_346 1) (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_168) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd0~0_192 v_~x$r_buff1_thd0~0_194) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$r_buff0_thd2~0_195 v_~x$r_buff1_thd2~0_143) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_482 256) 0)) (not (= (mod v_~x$w_buff0_used~0_542 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd2~0_194 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_65| |v_P1Thread1of1ForFork0_~arg#1.offset_65|) (= v_~x$w_buff0_used~0_542 1) (= v_~x$r_buff0_thd1~0_173 v_~x$r_buff1_thd1~0_171) (= v_~x$w_buff0~0_347 v_~x$w_buff1~0_280)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_195, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_543} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_65|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_280, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_168, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_482, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_171, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~y~0=v_~y~0_165} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [501] $Ultimate##0-->P2EXIT: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_596 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_196 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_195 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_535 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_597 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_534 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_535)) (= v_~x~0_455 (ite .cse2 v_~x$w_buff0~0_380 (ite .cse1 v_~x$w_buff1~0_312 v_~x~0_456))) (= v_~y~0_189 v_~__unbuffered_p2_EAX~0_145) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_534 256) 0))) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_195 256) 0)))) 0 v_~x$r_buff1_thd3~0_195) v_~x$r_buff1_thd3~0_194) (= |v_P2Thread1of1ForFork1_#res.base_49| 0) (= v_~__unbuffered_cnt~0_427 (+ v_~__unbuffered_cnt~0_428 1)) (= v_P2Thread1of1ForFork1_~arg.offset_59 |v_P2Thread1of1ForFork1_#in~arg.offset_59|) (= |v_P2Thread1of1ForFork1_#res.offset_49| 0) (= v_~y~0_189 v_~__unbuffered_p2_EBX~0_124) (= v_~x$w_buff0_used~0_596 (ite .cse2 0 v_~x$w_buff0_used~0_597)) (= v_P2Thread1of1ForFork1_~arg.base_59 |v_P2Thread1of1ForFork1_#in~arg.base_59|) (= v_~x$r_buff0_thd3~0_195 (ite .cse0 0 v_~x$r_buff0_thd3~0_196))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_380, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_59|, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_535, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_428, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_59|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_196, ~y~0=v_~y~0_189, ~x~0=v_~x~0_456, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_597} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_380, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_59|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_124, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_59, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_49|, ~x$w_buff1~0=v_~x$w_buff1~0_312, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_194, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_534, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_195, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_59, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_427, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_145, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_59|, ~y~0=v_~y~0_189, ~x~0=v_~x~0_455, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_49|} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#res.base, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~x~0, P2Thread1of1ForFork1_#res.offset, ~x$w_buff0_used~0] [2022-12-13 00:48:50,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0_used~0_543 v_~x$w_buff1_used~0_482) (= v_~y~0_165 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_65| |v_P1Thread1of1ForFork0_#in~arg#1.base_65|) (= v_~x$w_buff0~0_346 1) (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_168) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd0~0_192 v_~x$r_buff1_thd0~0_194) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$r_buff0_thd2~0_195 v_~x$r_buff1_thd2~0_143) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_482 256) 0)) (not (= (mod v_~x$w_buff0_used~0_542 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd2~0_194 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_65| |v_P1Thread1of1ForFork0_~arg#1.offset_65|) (= v_~x$w_buff0_used~0_542 1) (= v_~x$r_buff0_thd1~0_173 v_~x$r_buff1_thd1~0_171) (= v_~x$w_buff0~0_347 v_~x$w_buff1~0_280)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_195, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_543} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_65|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_280, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_168, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_482, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_171, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~y~0=v_~y~0_165} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [502] $Ultimate##0-->L814: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_600 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_199 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_200 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_601 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_539 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= v_~x$w_buff1_used~0_538 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_539)) (= v_~y~0_191 v_~__unbuffered_p2_EBX~0_126) (= v_P2Thread1of1ForFork1_~arg.base_61 |v_P2Thread1of1ForFork1_#in~arg.base_61|) (= (ite .cse2 0 v_~x$w_buff0_used~0_601) v_~x$w_buff0_used~0_600) (= v_P2Thread1of1ForFork1_~arg.offset_61 |v_P2Thread1of1ForFork1_#in~arg.offset_61|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_199 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_538 256) 0)))) 0 v_~x$r_buff1_thd3~0_199) v_~x$r_buff1_thd3~0_198) (= (ite .cse2 v_~x$w_buff0~0_382 (ite .cse1 v_~x$w_buff1~0_314 v_~x~0_460)) v_~x~0_459) (= v_~y~0_191 v_~__unbuffered_p2_EAX~0_147) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_200) v_~x$r_buff0_thd3~0_199)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_382, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_61|, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_539, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_61|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_200, ~y~0=v_~y~0_191, ~x~0=v_~x~0_460, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_601} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_382, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_61|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_126, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_61, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_198, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_538, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_199, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_600, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_61, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_147, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_61|, ~y~0=v_~y~0_191, ~x~0=v_~x~0_459} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:50,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0_used~0_543 v_~x$w_buff1_used~0_482) (= v_~y~0_165 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_65| |v_P1Thread1of1ForFork0_#in~arg#1.base_65|) (= v_~x$w_buff0~0_346 1) (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_168) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd0~0_192 v_~x$r_buff1_thd0~0_194) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$r_buff0_thd2~0_195 v_~x$r_buff1_thd2~0_143) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_482 256) 0)) (not (= (mod v_~x$w_buff0_used~0_542 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd2~0_194 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_65| |v_P1Thread1of1ForFork0_~arg#1.offset_65|) (= v_~x$w_buff0_used~0_542 1) (= v_~x$r_buff0_thd1~0_173 v_~x$r_buff1_thd1~0_171) (= v_~x$w_buff0~0_347 v_~x$w_buff1~0_280)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_195, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_543} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_65|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_280, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_168, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_482, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_171, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~y~0=v_~y~0_165} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [499] $Ultimate##0-->L817: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_588 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_188 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_187 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_527 256) 0)) .cse4)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_589 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_376 (ite .cse1 v_~x$w_buff1~0_308 v_~x~0_448)) v_~x~0_447) (= v_P2Thread1of1ForFork1_~arg.offset_55 |v_P2Thread1of1ForFork1_#in~arg.offset_55|) (= v_~y~0_185 v_~__unbuffered_p2_EAX~0_141) (= v_~x$w_buff1_used~0_526 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_527)) (= v_~y~0_185 v_~__unbuffered_p2_EBX~0_120) (= v_~x$w_buff0_used~0_588 (ite .cse0 0 v_~x$w_buff0_used~0_589)) (= v_P2Thread1of1ForFork1_~arg.base_55 |v_P2Thread1of1ForFork1_#in~arg.base_55|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_187 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_526 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_187) v_~x$r_buff1_thd3~0_186) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_188) v_~x$r_buff0_thd3~0_187) (= v_~__unbuffered_cnt~0_419 (+ v_~__unbuffered_cnt~0_420 1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_376, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_55|, ~x$w_buff1~0=v_~x$w_buff1~0_308, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_187, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_527, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_420, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_55|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_188, ~y~0=v_~y~0_185, ~x~0=v_~x~0_448, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_589} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_376, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_55|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_120, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_55, ~x$w_buff1~0=v_~x$w_buff1~0_308, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_186, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_526, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_187, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_588, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_419, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_141, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_55|, ~y~0=v_~y~0_185, ~x~0=v_~x~0_447} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:50,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0_used~0_543 v_~x$w_buff1_used~0_482) (= v_~y~0_165 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_65| |v_P1Thread1of1ForFork0_#in~arg#1.base_65|) (= v_~x$w_buff0~0_346 1) (= v_~x$r_buff0_thd3~0_169 v_~x$r_buff1_thd3~0_168) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd0~0_192 v_~x$r_buff1_thd0~0_194) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71| 0)) (= v_~x$r_buff0_thd2~0_195 v_~x$r_buff1_thd2~0_143) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_482 256) 0)) (not (= (mod v_~x$w_buff0_used~0_542 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|) (= v_~x$r_buff0_thd2~0_194 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_65| |v_P1Thread1of1ForFork0_~arg#1.offset_65|) (= v_~x$w_buff0_used~0_542 1) (= v_~x$r_buff0_thd1~0_173 v_~x$r_buff1_thd1~0_171) (= v_~x$w_buff0~0_347 v_~x$w_buff1~0_280)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_347, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_195, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_543} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_346, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_192, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_71|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_173, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_65|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_65|, ~x$w_buff1~0=v_~x$w_buff1~0_280, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_168, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_143, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_482, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_171, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_71|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_169, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_194, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_194, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_65|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_542, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_65|, ~y~0=v_~y~0_165} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [500] $Ultimate##0-->P2FINAL: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_191 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_592 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_192 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_531 256) 0)) .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_593 256) 0)) .cse5))) (and (= v_~y~0_187 v_~__unbuffered_p2_EBX~0_122) (= |v_P2Thread1of1ForFork1_#res.base_47| 0) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_531) v_~x$w_buff1_used~0_530) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_192) v_~x$r_buff0_thd3~0_191) (= (ite .cse2 v_~x$w_buff0~0_378 (ite .cse0 v_~x$w_buff1~0_310 v_~x~0_452)) v_~x~0_451) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_530 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_191 256) 0)))) 0 v_~x$r_buff1_thd3~0_191) v_~x$r_buff1_thd3~0_190) (= v_P2Thread1of1ForFork1_~arg.offset_57 |v_P2Thread1of1ForFork1_#in~arg.offset_57|) (= |v_P2Thread1of1ForFork1_#res.offset_47| 0) (= v_~y~0_187 v_~__unbuffered_p2_EAX~0_143) (= v_~__unbuffered_cnt~0_423 (+ v_~__unbuffered_cnt~0_424 1)) (= v_~x$w_buff0_used~0_592 (ite .cse2 0 v_~x$w_buff0_used~0_593)) (= v_P2Thread1of1ForFork1_~arg.base_57 |v_P2Thread1of1ForFork1_#in~arg.base_57|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_378, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_57|, ~x$w_buff1~0=v_~x$w_buff1~0_310, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_191, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_424, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_57|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_192, ~y~0=v_~y~0_187, ~x~0=v_~x~0_452, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_593} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_378, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_57|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_122, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_57, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_47|, ~x$w_buff1~0=v_~x$w_buff1~0_310, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_190, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_530, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_191, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_592, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_423, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_143, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_57|, ~y~0=v_~y~0_187, ~x~0=v_~x~0_451, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_47|} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#res.base, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_cnt~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~x~0, P2Thread1of1ForFork1_#res.offset, ~x$w_buff0_used~0] [2022-12-13 00:48:50,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] $Ultimate##0-->P2EXIT: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_604 256) 0))) (.cse1 (not (= (mod v_~x$r_buff0_thd3~0_204 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_606 256) 0))) (let ((.cse3 (and .cse1 (not .cse4))) (.cse0 (and .cse1 .cse2))) (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_71| |v_P1Thread1of1ForFork0_~arg#1.offset_71|) (= |v_P1Thread1of1ForFork0_~arg#1.base_71| |v_P1Thread1of1ForFork0_#in~arg#1.base_71|) (= |v_P2Thread1of1ForFork1_#res.base_51| 0) (= |v_P2Thread1of1ForFork1_#res.offset_51| 0) (= v_P2Thread1of1ForFork1_~arg.base_63 |v_P2Thread1of1ForFork1_#in~arg.base_63|) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_204) v_~x$r_buff0_thd3~0_203) (= v_~__unbuffered_cnt~0_431 (+ v_~__unbuffered_cnt~0_432 1)) (= v_~y~0_193 1) (= (ite (or (and .cse1 (not (= (mod v_~x$w_buff1_used~0_542 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_203 256) 0)) .cse2)) 0 v_~x$r_buff0_thd3~0_204) v_~x$r_buff1_thd3~0_202) (= (ite .cse1 v_~x$w_buff0~0_384 (ite .cse3 v_~x$w_buff1~0_316 v_~x~0_464)) v_~x~0_463) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_77| 0)) (= v_~x$r_buff0_thd1~0_183 v_~x$r_buff1_thd1~0_181) (= (ite .cse1 0 1) v_~x$w_buff0_used~0_604) (= v_~x$r_buff0_thd2~0_207 v_~x$r_buff1_thd2~0_149) (= v_~y~0_193 v_~__unbuffered_p2_EBX~0_128) (= v_~x$w_buff0~0_385 v_~x$w_buff1~0_316) (= v_~x$r_buff0_thd2~0_206 1) (= (ite (or .cse3 .cse0) 0 v_~x$w_buff0_used~0_606) v_~x$w_buff1_used~0_542) (= v_~x$w_buff0~0_384 1) (= v_P2Thread1of1ForFork1_~arg.offset_63 |v_P2Thread1of1ForFork1_#in~arg.offset_63|) (= v_~y~0_193 v_~__unbuffered_p2_EAX~0_149) (= v_~x$r_buff0_thd0~0_218 v_~x$r_buff1_thd0~0_222) (= (ite .cse4 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_77| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_385, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_63|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_218, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_204, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_207, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_71|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_606, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_71|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_432, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_63|, ~x~0=v_~x~0_464} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_384, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_183, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_202, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_181, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_203, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_77|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_71|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_71|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_63, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_149, ~y~0=v_~y~0_193, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_51|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_63|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_218, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_77|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_71|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_128, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_63, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_51|, ~x$w_buff1~0=v_~x$w_buff1~0_316, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_542, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_149, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_206, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_222, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_604, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_431, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_63|, ~x~0=v_~x~0_463} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#res.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~__unbuffered_cnt~0, ~y~0, ~x~0, P2Thread1of1ForFork1_#res.offset] and [322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:51,202 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [505] $Ultimate##0-->L817: Formula: (let ((.cse3 (= (mod v_~x$w_buff0_used~0_618 256) 0)) (.cse4 (not (= (mod v_~x$w_buff0_used~0_616 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd3~0_212 256) 0)))) (let ((.cse2 (and .cse4 .cse0)) (.cse1 (and .cse0 (not .cse3)))) (and (= v_~__unbuffered_cnt~0_435 (+ v_~__unbuffered_cnt~0_436 1)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_81| 0)) (= v_~y~0_197 v_~__unbuffered_p2_EBX~0_132) (= v_~x$w_buff0_used~0_616 (ite .cse0 0 1)) (= v_~x~0_471 (ite .cse0 v_~x$w_buff0~0_392 (ite .cse1 v_~x$w_buff1~0_320 v_~x~0_472))) (= v_~x$r_buff0_thd3~0_211 (ite .cse2 0 v_~x$r_buff0_thd3~0_212)) (= v_~x$w_buff0~0_393 v_~x$w_buff1~0_320) (= v_~x$r_buff0_thd0~0_222 v_~x$r_buff1_thd0~0_226) (= |v_P1Thread1of1ForFork0_~arg#1.base_75| |v_P1Thread1of1ForFork0_#in~arg#1.base_75|) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_81|) (= v_P2Thread1of1ForFork1_~arg.offset_67 |v_P2Thread1of1ForFork1_#in~arg.offset_67|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_550 256) 0)) .cse0) (and .cse4 (not (= (mod v_~x$r_buff0_thd3~0_211 256) 0)))) 0 v_~x$r_buff0_thd3~0_212) v_~x$r_buff1_thd3~0_210) (= v_~x$w_buff1_used~0_550 (ite (or .cse2 .cse1) 0 v_~x$w_buff0_used~0_618)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_81| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_81|) (= v_P2Thread1of1ForFork1_~arg.base_67 |v_P2Thread1of1ForFork1_#in~arg.base_67|) (= v_~y~0_197 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_75| |v_P1Thread1of1ForFork0_~arg#1.offset_75|) (= v_~x$r_buff0_thd2~0_215 v_~x$r_buff1_thd2~0_153) (= v_~y~0_197 v_~__unbuffered_p2_EAX~0_153) (= v_~x$r_buff0_thd1~0_187 v_~x$r_buff1_thd1~0_185) (= v_~x$w_buff0~0_392 1) (= v_~x$r_buff0_thd2~0_214 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_393, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_67|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_222, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_212, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_215, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_75|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_618, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_75|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_436, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_67|, ~x~0=v_~x~0_472} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_187, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_75|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_210, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_185, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_211, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_81|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_75|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_75|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_67, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_153, ~y~0=v_~y~0_197, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_67|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_222, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_81|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_75|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_132, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_67, ~x$w_buff1~0=v_~x$w_buff1~0_320, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_550, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_214, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_226, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_616, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_435, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_67|, ~x~0=v_~x~0_471} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~__unbuffered_cnt~0, ~y~0, ~x~0] and [322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:51,495 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [506] $Ultimate##0-->P2FINAL: Formula: (let ((.cse3 (= (mod v_~x$w_buff0_used~0_624 256) 0)) (.cse2 (not (= (mod v_~x$r_buff0_thd3~0_216 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_622 256) 0)))) (let ((.cse0 (and .cse2 .cse4)) (.cse1 (and (not .cse3) .cse2))) (and (= v_P2Thread1of1ForFork1_~arg.offset_69 |v_P2Thread1of1ForFork1_#in~arg.offset_69|) (= v_~x$r_buff0_thd2~0_219 v_~x$r_buff1_thd2~0_155) (= (ite (or .cse0 .cse1) 0 v_~x$w_buff0_used~0_624) v_~x$w_buff1_used~0_554) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= (ite .cse2 0 1) v_~x$w_buff0_used~0_622) (= |v_P2Thread1of1ForFork1_#res.base_53| 0) (= v_P2Thread1of1ForFork1_~arg.base_69 |v_P2Thread1of1ForFork1_#in~arg.base_69|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_77| |v_P1Thread1of1ForFork0_~arg#1.offset_77|) (= |v_P2Thread1of1ForFork1_#res.offset_53| 0) (= v_~x$w_buff0~0_397 v_~x$w_buff1~0_322) (= v_~x$r_buff0_thd2~0_218 1) (= v_~y~0_199 v_~__unbuffered_p2_EBX~0_134) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|) (= (+ v_~__unbuffered_cnt~0_440 1) v_~__unbuffered_cnt~0_439) (= |v_P1Thread1of1ForFork0_~arg#1.base_77| |v_P1Thread1of1ForFork0_#in~arg#1.base_77|) (= (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_554 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_215 256) 0)) .cse4)) 0 v_~x$r_buff0_thd3~0_216) v_~x$r_buff1_thd3~0_214) (= v_~y~0_199 v_~__unbuffered_p2_EAX~0_155) (= v_~x$r_buff0_thd1~0_189 v_~x$r_buff1_thd1~0_187) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_216) v_~x$r_buff0_thd3~0_215) (= v_~x$w_buff0~0_396 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83| 0)) (= v_~x$r_buff0_thd0~0_224 v_~x$r_buff1_thd0~0_228) (= (ite .cse2 v_~x$w_buff0~0_396 (ite .cse1 v_~x$w_buff1~0_322 v_~x~0_476)) v_~x~0_475) (= v_~y~0_199 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_397, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_69|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_224, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_216, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_219, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_77|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_624, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_77|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_440, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_69|, ~x~0=v_~x~0_476} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_396, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_189, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_77|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_214, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_215, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_83|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_77|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_77|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_69, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_155, ~y~0=v_~y~0_199, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_53|, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_69|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_224, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_83|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_77|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_134, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_69, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_53|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_155, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_218, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_228, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_622, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_439, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_69|, ~x~0=v_~x~0_475} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_#res.base, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~__unbuffered_cnt~0, ~y~0, ~x~0, P2Thread1of1ForFork1_#res.offset] and [322] L787-->L794: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_29 256) 0)))) (let ((.cse2 (and .cse1 .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_89 256) 0)))) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_102 256) 0)) .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~x$r_buff0_thd2~0_28 256) 0)) .cse1)) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$r_buff0_thd2~0_29) v_~x$r_buff0_thd2~0_28) (= v_~x$w_buff1_used~0_88 (ite (or .cse2 .cse3) 0 v_~x$w_buff1_used~0_89)) (= v_~x~0_58 (ite .cse4 v_~x$w_buff0~0_50 (ite .cse3 v_~x$w_buff1~0_41 v_~x~0_59))) (= (ite .cse4 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_89, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_50, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_88, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_28, ~x~0=v_~x~0_58, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:48:51,803 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 00:48:51,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2713 [2022-12-13 00:48:51,804 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 260 flow [2022-12-13 00:48:51,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:51,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:51,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:51,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:48:51,804 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:51,804 INFO L85 PathProgramCache]: Analyzing trace with hash 312415898, now seen corresponding path program 1 times [2022-12-13 00:48:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:51,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860485102] [2022-12-13 00:48:51,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:48:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:48:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:48:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860485102] [2022-12-13 00:48:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860485102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:48:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:48:52,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:48:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619333416] [2022-12-13 00:48:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:48:52,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:48:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:48:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:48:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:48:52,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2022-12-13 00:48:52,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:52,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:48:52,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2022-12-13 00:48:52,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:48:52,218 INFO L130 PetriNetUnfolder]: 170/354 cut-off events. [2022-12-13 00:48:52,218 INFO L131 PetriNetUnfolder]: For 988/1000 co-relation queries the response was YES. [2022-12-13 00:48:52,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1306 conditions, 354 events. 170/354 cut-off events. For 988/1000 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1754 event pairs, 8 based on Foata normal form. 36/287 useless extension candidates. Maximal degree in co-relation 1285. Up to 196 conditions per place. [2022-12-13 00:48:52,220 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 23 selfloop transitions, 3 changer transitions 28/63 dead transitions. [2022-12-13 00:48:52,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 504 flow [2022-12-13 00:48:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:48:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:48:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-13 00:48:52,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 00:48:52,221 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 260 flow. Second operand 6 states and 62 transitions. [2022-12-13 00:48:52,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 504 flow [2022-12-13 00:48:52,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 436 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-13 00:48:52,222 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 185 flow [2022-12-13 00:48:52,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 00:48:52,223 INFO L295 CegarLoopForPetriNet]: 69 programPoint places, -24 predicate places. [2022-12-13 00:48:52,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:48:52,223 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 185 flow [2022-12-13 00:48:52,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:48:52,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:48:52,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 185 flow [2022-12-13 00:48:52,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 185 flow [2022-12-13 00:48:52,233 INFO L130 PetriNetUnfolder]: 63/160 cut-off events. [2022-12-13 00:48:52,233 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-12-13 00:48:52,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 160 events. 63/160 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 842 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 471. Up to 109 conditions per place. [2022-12-13 00:48:52,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 185 flow [2022-12-13 00:48:52,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 00:48:52,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] $Ultimate##0-->L814: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_610 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd3~0_208 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_612 256) 0))) (let ((.cse1 (and .cse0 (not .cse2))) (.cse3 (and .cse0 .cse4))) (and (= v_~x$r_buff0_thd1~0_185 v_~x$r_buff1_thd1~0_183) (= v_~x$r_buff0_thd2~0_211 v_~x$r_buff1_thd2~0_151) (= (ite .cse0 v_~x$w_buff0~0_388 (ite .cse1 v_~x$w_buff1~0_318 v_~x~0_468)) v_~x~0_467) (= v_P2Thread1of1ForFork1_~arg.offset_65 |v_P2Thread1of1ForFork1_#in~arg.offset_65|) (= v_~y~0_195 1) (= v_~y~0_195 v_~__unbuffered_p2_EAX~0_151) (= v_~x$r_buff0_thd0~0_220 v_~x$r_buff1_thd0~0_224) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_79| 0)) (= (ite .cse2 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_79|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_79| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_79|) (= v_~x$w_buff1_used~0_546 (ite (or .cse3 .cse1) 0 v_~x$w_buff0_used~0_612)) (= v_~y~0_195 v_~__unbuffered_p2_EBX~0_130) (= (ite .cse0 0 1) v_~x$w_buff0_used~0_610) (= |v_P1Thread1of1ForFork0_~arg#1.base_73| |v_P1Thread1of1ForFork0_#in~arg#1.base_73|) (= v_~x$w_buff0~0_388 1) (= v_~x$w_buff0~0_389 v_~x$w_buff1~0_318) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_73| |v_P1Thread1of1ForFork0_~arg#1.offset_73|) (= (ite .cse3 0 v_~x$r_buff0_thd3~0_208) v_~x$r_buff0_thd3~0_207) (= v_~x$r_buff0_thd2~0_210 1) (= v_~x$r_buff1_thd3~0_206 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_207 256) 0)) .cse4) (and .cse0 (not (= (mod v_~x$w_buff1_used~0_546 256) 0)))) 0 v_~x$r_buff0_thd3~0_208)) (= v_P2Thread1of1ForFork1_~arg.base_65 |v_P2Thread1of1ForFork1_#in~arg.base_65|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_389, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_65|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_220, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_73|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_185, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_65|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_208, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ~x~0=v_~x~0_468, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_73|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_612} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_185, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_73|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_206, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_183, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_207, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_79|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_73|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_73|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_65, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_151, ~y~0=v_~y~0_195, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_65|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_220, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_79|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_130, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_65, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_546, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_151, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_210, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_224, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_65|, ~x~0=v_~x~0_467} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~y~0, ~x~0] and [498] $Ultimate##0-->L763: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_178 256) 0)) (.cse4 (= (mod v_~x$r_buff0_thd1~0_180 256) 0))) (let ((.cse6 (not .cse4)) (.cse1 (and .cse4 .cse10)) (.cse11 (= 0 (mod v_~x$w_buff0_used~0_585 256))) (.cse3 (and (= (mod v_~x$w_buff1_used~0_523 256) 0) .cse4))) (let ((.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_584 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_522 256) 0)) (.cse7 (or .cse1 .cse11 .cse3)) (.cse8 (and .cse6 (not .cse11)))) (and (= v_~x$w_buff1~0_304 v_~x$w_buff1~0_305) (= (ite .cse0 v_~x$w_buff1_used~0_523 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_523 0)) v_~x$w_buff1_used~0_522) (= (ite .cse0 v_~x$r_buff0_thd1~0_180 (ite (or .cse1 .cse2 (and .cse4 .cse5)) v_~x$r_buff0_thd1~0_180 (ite (and .cse6 (not .cse2)) 0 v_~x$r_buff0_thd1~0_180))) v_~x$r_buff0_thd1~0_179) (= v_P0Thread1of1ForFork2_~arg.base_39 |v_P0Thread1of1ForFork2_#in~arg.base_39|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_39| v_P0Thread1of1ForFork2_~arg.offset_39) (= (ite .cse0 v_~x$mem_tmp~0_72 v_~__unbuffered_p0_EAX~0_148) v_~x~0_443) (= v_~y~0_183 2) (= (ite .cse0 v_~x$w_buff0_used~0_585 (ite .cse7 v_~x$w_buff0_used~0_585 (ite .cse8 0 v_~x$w_buff0_used~0_585))) v_~x$w_buff0_used~0_584) (= v_~weak$$choice2~0_88 |v_P0Thread1of1ForFork2_#t~nondet4_94|) (= v_~x$mem_tmp~0_72 v_~x~0_444) (= (ite .cse0 v_~x$r_buff1_thd1~0_178 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_179 256) 0))) (or .cse2 (and .cse9 .cse10) (and .cse5 .cse9))) v_~x$r_buff1_thd1~0_178 0)) v_~x$r_buff1_thd1~0_177) (= v_~x$w_buff0~0_373 v_~x$w_buff0~0_372) (= (ite .cse7 v_~x~0_444 (ite .cse8 v_~x$w_buff0~0_373 v_~x$w_buff1~0_305)) v_~__unbuffered_p0_EAX~0_148) (= v_~weak$$choice0~0_69 |v_P0Thread1of1ForFork2_#t~nondet3_94|) (= v_~x$flush_delayed~0_81 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_373, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_180, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_39|, ~x$w_buff1~0=v_~x$w_buff1~0_305, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_523, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_178, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_39|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_94|, ~x~0=v_~x~0_444, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_94|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_585} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_372, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, ~x$flush_delayed~0=v_~x$flush_delayed~0_81, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_177, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_39|, ~x$mem_tmp~0=v_~x$mem_tmp~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_584, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_39, ~weak$$choice0~0=v_~weak$$choice0~0_69, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_148, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_39|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_39, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y~0=v_~y~0_183, ~x~0=v_~x~0_443} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, ~x$w_buff0_used~0, P0Thread1of1ForFork2_~arg.base, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, ~weak$$choice2~0, ~y~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] [2022-12-13 00:48:54,484 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:48:54,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2262 [2022-12-13 00:48:54,485 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 244 flow [2022-12-13 00:48:54,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:48:54,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:48:54,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:54,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:48:54,485 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:48:54,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:48:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash 252817952, now seen corresponding path program 1 times [2022-12-13 00:48:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:48:54,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708556855] [2022-12-13 00:48:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:48:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:48:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:48:54,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:48:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:48:54,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:48:54,552 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:48:54,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:48:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:48:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:48:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:48:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:48:54,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:48:54,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:48:54,554 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:48:54,558 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:48:54,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:48:54,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:48:54 BasicIcfg [2022-12-13 00:48:54,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:48:54,612 INFO L158 Benchmark]: Toolchain (without parser) took 23151.19ms. Allocated memory was 203.4MB in the beginning and 929.0MB in the end (delta: 725.6MB). Free memory was 178.3MB in the beginning and 808.9MB in the end (delta: -630.6MB). Peak memory consumption was 96.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:54,612 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 181.2MB in the beginning and 181.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:48:54,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.26ms. Allocated memory is still 203.4MB. Free memory was 178.3MB in the beginning and 152.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:48:54,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 203.4MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:54,613 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 203.4MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:54,613 INFO L158 Benchmark]: RCFGBuilder took 589.60ms. Allocated memory is still 203.4MB. Free memory was 147.9MB in the beginning and 116.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-13 00:48:54,613 INFO L158 Benchmark]: TraceAbstraction took 22109.42ms. Allocated memory was 203.4MB in the beginning and 929.0MB in the end (delta: 725.6MB). Free memory was 115.4MB in the beginning and 808.9MB in the end (delta: -693.5MB). Peak memory consumption was 33.1MB. Max. memory is 8.0GB. [2022-12-13 00:48:54,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 203.4MB. Free memory was 181.2MB in the beginning and 181.1MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 384.26ms. Allocated memory is still 203.4MB. Free memory was 178.3MB in the beginning and 152.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 203.4MB. Free memory was 152.1MB in the beginning and 150.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 203.4MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 589.60ms. Allocated memory is still 203.4MB. Free memory was 147.9MB in the beginning and 116.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22109.42ms. Allocated memory was 203.4MB in the beginning and 929.0MB in the end (delta: 725.6MB). Free memory was 115.4MB in the beginning and 808.9MB in the end (delta: -693.5MB). Peak memory consumption was 33.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 112 PlacesBefore, 69 PlacesAfterwards, 104 TransitionsBefore, 63 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 41 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4047, independent: 3869, independent conditional: 3869, independent unconditional: 0, dependent: 178, dependent conditional: 178, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4047, independent: 3869, independent conditional: 0, independent unconditional: 3869, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4047, independent: 3869, independent conditional: 0, independent unconditional: 3869, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4047, independent: 3869, independent conditional: 0, independent unconditional: 3869, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2010, independent: 1956, independent conditional: 0, independent unconditional: 1956, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2010, independent: 1917, independent conditional: 0, independent unconditional: 1917, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 210, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4047, independent: 1913, independent conditional: 0, independent unconditional: 1913, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 2010, unknown conditional: 0, unknown unconditional: 2010] , Statistics on independence cache: Total cache size (in pairs): 3878, Positive cache size: 3824, Positive conditional cache size: 0, Positive unconditional cache size: 3824, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, 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, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 159, independent conditional: 159, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 193, independent: 159, independent conditional: 10, independent unconditional: 149, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 159, independent conditional: 10, independent unconditional: 149, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 159, independent conditional: 10, independent unconditional: 149, dependent: 34, dependent conditional: 5, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167, independent: 143, independent conditional: 10, independent unconditional: 133, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167, independent: 125, independent conditional: 0, independent unconditional: 125, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 100, dependent conditional: 16, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 167, unknown conditional: 12, unknown unconditional: 155] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 143, Positive conditional cache size: 10, Positive unconditional cache size: 133, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 131, independent conditional: 131, 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: 148, independent: 131, independent conditional: 22, independent unconditional: 109, dependent: 17, dependent conditional: 10, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 131, independent conditional: 0, independent unconditional: 131, 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: 148, independent: 131, independent conditional: 0, independent unconditional: 131, 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: 21, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 21, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 148, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 163, Positive conditional cache size: 10, Positive unconditional cache size: 153, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 115, independent conditional: 16, independent unconditional: 99, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 174, Positive conditional cache size: 10, Positive unconditional cache size: 164, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 130, independent: 107, independent conditional: 107, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 130, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 130, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 130, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 130, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 176, Positive conditional cache size: 10, Positive unconditional cache size: 166, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 682 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 109, independent conditional: 109, 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: 133, independent: 109, independent conditional: 18, independent unconditional: 91, dependent: 24, dependent conditional: 4, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 141, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 141, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 177, Positive conditional cache size: 10, Positive unconditional cache size: 167, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 59 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 570, independent: 497, independent conditional: 497, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 570, independent: 497, independent conditional: 92, independent unconditional: 405, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 570, independent: 497, independent conditional: 8, independent unconditional: 489, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 570, independent: 497, independent conditional: 8, independent unconditional: 489, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 5, independent unconditional: 16, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 570, independent: 476, independent conditional: 3, independent unconditional: 473, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 21, unknown conditional: 5, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 203, Positive conditional cache size: 15, Positive unconditional cache size: 188, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 28, independent conditional: 4, independent unconditional: 24, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 206, Positive conditional cache size: 15, Positive unconditional cache size: 191, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 18, independent conditional: 18, 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: 38, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 5, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 210, Positive conditional cache size: 15, Positive unconditional cache size: 195, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, independent: 65, independent conditional: 65, 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: 91, independent: 65, independent conditional: 33, independent unconditional: 32, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, independent: 65, independent conditional: 30, independent unconditional: 35, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, independent: 65, independent conditional: 30, independent unconditional: 35, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 6, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, independent: 58, independent conditional: 24, independent unconditional: 34, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 217, Positive conditional cache size: 21, Positive unconditional cache size: 196, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 52 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 79, independent conditional: 45, independent unconditional: 34, dependent: 50, dependent conditional: 24, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 73, independent conditional: 0, independent unconditional: 73, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 224, Positive conditional cache size: 21, Positive unconditional cache size: 203, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 117, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 62 PlacesBefore, 60 PlacesAfterwards, 64 TransitionsBefore, 62 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 104, independent conditional: 84, independent unconditional: 20, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 104, independent conditional: 23, independent unconditional: 81, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 104, independent conditional: 23, independent unconditional: 81, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 9, independent unconditional: 19, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 108, independent: 76, independent conditional: 14, independent unconditional: 62, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 28, unknown conditional: 9, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 290, Positive conditional cache size: 30, Positive unconditional cache size: 260, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 61, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 61 PlacesBefore, 59 PlacesAfterwards, 58 TransitionsBefore, 56 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 20, 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: 20, independent: 20, independent conditional: 3, independent unconditional: 17, 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: 20, independent: 20, independent conditional: 3, independent unconditional: 17, 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: 8, independent: 8, independent conditional: 3, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 318, Positive conditional cache size: 33, Positive unconditional cache size: 285, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 59 PlacesBefore, 59 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 318, Positive conditional cache size: 33, Positive unconditional cache size: 285, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 51 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, independent: 83, independent conditional: 83, 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: 83, independent: 83, independent conditional: 77, independent unconditional: 6, 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: 83, independent: 83, independent conditional: 39, independent unconditional: 44, 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: 83, independent: 83, independent conditional: 39, independent unconditional: 44, 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: 11, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 83, independent: 72, independent conditional: 33, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 6, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 378, Positive conditional cache size: 39, Positive unconditional cache size: 339, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 42 PlacesBefore, 39 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, independent: 67, independent conditional: 67, 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: 67, independent: 67, independent conditional: 58, independent unconditional: 9, 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: 67, independent: 67, independent conditional: 58, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 67, independent conditional: 58, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, 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: 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: 67, independent: 64, independent conditional: 56, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 462, Positive conditional cache size: 41, Positive unconditional cache size: 421, Negative cache size: 30, Negative conditional cache size: 2, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-2, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-1, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1899, ((void *)0), P2, ((void *)0))=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 [L803] 2 __unbuffered_p2_EAX = y [L806] 2 __unbuffered_p2_EBX = y [L809] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 2 y = 2 [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 x$flush_delayed = weak$$choice2 [L752] 2 x$mem_tmp = x [L753] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 2 __unbuffered_p0_EAX = x [L761] 2 x = x$flush_delayed ? x$mem_tmp : x [L762] 2 x$flush_delayed = (_Bool)0 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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, 133 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: 22.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 480 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 480 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 14 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:48:54,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...